agentic-qe 3.6.8 → 3.6.9

package/v3/dist/kernel/unified-memory-hnsw.js

@@ -0,0 +1,411 @@
+/**
+ * In-Memory HNSW Index for Fast Vector Search
+ *
+ * Provides O(log n) approximate nearest neighbor search via a multi-layer
+ * navigable small-world graph. Extracted from unified-memory.ts.
+ *
+ * Algorithm reference: Malkov & Yashunin, "Efficient and robust approximate
+ * nearest neighbor search using Hierarchical Navigable Small World graphs",
+ * IEEE TPAMI 2018.
+ */
+import { cosineSimilarity } from '../shared/utils/vector-math.js';
+import { HNSW_CONSTANTS } from './constants.js';
+// ============================================================================
+// Binary Heap (used by HNSW beam search)
+// ============================================================================
+/**
+ * Binary min/max heap for O(log n) insertion and extraction.
+ * Replaces sorted arrays with O(n) splice in HNSW beam search.
+ */
+export class BinaryHeap {
+    data = [];
+    compareFn;
+    constructor(compareFn) {
+        this.compareFn = compareFn;
+    }
+    push(item) {
+        this.data.push(item);
+        this.bubbleUp(this.data.length - 1);
+    }
+    pop() {
+        if (this.data.length === 0)
+            return undefined;
+        const top = this.data[0];
+        const last = this.data.pop();
+        if (this.data.length > 0) {
+            this.data[0] = last;
+            this.sinkDown(0);
+        }
+        return top;
+    }
+    peek() {
+        return this.data[0];
+    }
+    size() {
+        return this.data.length;
+    }
+    bubbleUp(i) {
+        while (i > 0) {
+            const parent = (i - 1) >> 1;
+            if (this.compareFn(this.data[i], this.data[parent]) < 0) {
+                [this.data[i], this.data[parent]] = [this.data[parent], this.data[i]];
+                i = parent;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    sinkDown(i) {
+        const n = this.data.length;
+        while (true) {
+            let smallest = i;
+            const left = 2 * i + 1;
+            const right = 2 * i + 2;
+            if (left < n && this.compareFn(this.data[left], this.data[smallest]) < 0) {
+                smallest = left;
+            }
+            if (right < n && this.compareFn(this.data[right], this.data[smallest]) < 0) {
+                smallest = right;
+            }
+            if (smallest !== i) {
+                [this.data[i], this.data[smallest]] = [this.data[smallest], this.data[i]];
+                i = smallest;
+            }
+            else {
+                break;
+            }
+        }
+    }
+}
+// ============================================================================
+// HNSW Index
+// ============================================================================
+/**
+ * In-memory HNSW (Hierarchical Navigable Small World) index built from
+ * SQLite vectors on startup. Provides O(log n) approximate nearest
+ * neighbor search via a multi-layer navigable small-world graph.
+ */
+export class InMemoryHNSWIndex {
+    nodes = new Map();
+    M = HNSW_CONSTANTS.M_CONNECTIONS;
+    Mmax0 = HNSW_CONSTANTS.M_CONNECTIONS * 2;
+    efConstruction = HNSW_CONSTANTS.EF_CONSTRUCTION;
+    efSearch = HNSW_CONSTANTS.EF_SEARCH;
+    mL = 1 / Math.log(HNSW_CONSTANTS.M_CONNECTIONS);
+    maxLevel = 16;
+    entryPoint = null;
+    currentMaxLevel = -1;
+    /**
+     * Assign a random layer for a new node using a geometric distribution.
+     * level = floor(-ln(uniform_random) * mL), capped at maxLevel.
+     */
+    randomLevel() {
+        return Math.min(Math.floor(-Math.log(Math.random()) * this.mL), this.maxLevel);
+    }
+    /**
+     * Compute cosine similarity between a query vector and a stored node.
+     */
+    similarity(query, nodeId) {
+        const node = this.nodes.get(nodeId);
+        if (!node)
+            return -1;
+        return cosineSimilarity(query, node.embedding);
+    }
+    /**
+     * Greedy search at a single layer: starting from a single entry point,
+     * greedily move to the neighbor closest to the query until no improvement.
+     * Returns the closest node found.
+     */
+    searchLayer(query, entryId, level) {
+        let current = entryId;
+        let currentDist = this.similarity(query, current);
+        let improved = true;
+        while (improved) {
+            improved = false;
+            const node = this.nodes.get(current);
+            if (!node)
+                break;
+            const neighbors = node.neighbors.get(level) ?? [];
+            for (const neighborId of neighbors) {
+                if (!this.nodes.has(neighborId))
+                    continue;
+                const dist = this.similarity(query, neighborId);
+                if (dist > currentDist) {
+                    current = neighborId;
+                    currentDist = dist;
+                    improved = true;
+                }
+            }
+        }
+        return current;
+    }
+    /**
+     * Beam search at a single layer: starting from an entry point, explore
+     * up to `ef` candidates and return the `ef` closest found.
+     * Uses a max-heap for candidates and a min-heap for results to achieve
+     * O(log n) insertion instead of O(n) Array.splice.
+     * Returns results sorted by descending similarity.
+     */
+    searchLayerBeam(query, entryIds, level, ef) {
+        const visited = new Set(entryIds);
+        const initial = entryIds
+            .filter(id => this.nodes.has(id))
+            .map(id => ({ id, score: this.similarity(query, id) }));
+        // Max-heap for candidates (best score = highest priority)
+        const candidateHeap = new BinaryHeap((a, b) => b.score - a.score // max-heap: highest score first
+        );
+        // Min-heap for results (worst score at top for fast eviction)
+        const resultHeap = new BinaryHeap((a, b) => a.score - b.score // min-heap: lowest score first
+        );
+        for (const entry of initial) {
+            candidateHeap.push(entry);
+            resultHeap.push(entry);
+        }
+        while (candidateHeap.size() > 0) {
+            const closest = candidateHeap.pop();
+            // If the closest candidate is worse than the worst in results
+            // and we already have ef results, stop
+            if (resultHeap.size() >= ef && closest.score < resultHeap.peek().score) {
+                break;
+            }
+            const node = this.nodes.get(closest.id);
+            if (!node)
+                continue;
+            const neighbors = node.neighbors.get(level) ?? [];
+            for (const neighborId of neighbors) {
+                if (visited.has(neighborId))
+                    continue;
+                visited.add(neighborId);
+                if (!this.nodes.has(neighborId))
+                    continue;
+                const score = this.similarity(query, neighborId);
+                const worstResult = resultHeap.size() >= ef ? resultHeap.peek().score : -Infinity;
+                if (resultHeap.size() < ef || score > worstResult) {
+                    const entry = { id: neighborId, score };
+                    candidateHeap.push(entry);
+                    resultHeap.push(entry);
+                    // Evict worst result if over capacity
+                    if (resultHeap.size() > ef) {
+                        resultHeap.pop();
+                    }
+                }
+            }
+        }
+        // Drain result heap into array sorted descending by score
+        const results = [];
+        while (resultHeap.size() > 0) {
+            results.push(resultHeap.pop());
+        }
+        results.reverse(); // min-heap drains ascending, reverse for descending
+        return results;
+    }
+    /**
+     * Select the M best neighbors from candidates for a node, using the
+     * simple heuristic (closest M by similarity).
+     */
+    selectNeighbors(_query, candidates, maxConnections) {
+        return candidates
+            .sort((a, b) => b.score - a.score)
+            .slice(0, maxConnections)
+            .map(c => c.id);
+    }
+    /**
+     * Get max connections allowed at a given level.
+     * Level 0 allows Mmax0 (= 2*M), higher levels allow M.
+     */
+    getMaxConnections(level) {
+        return level === 0 ? this.Mmax0 : this.M;
+    }
+    /**
+     * Add a vector to the HNSW index with proper graph construction.
+     * O(log n) amortized via hierarchical layer structure.
+     */
+    add(id, embedding) {
+        // Handle duplicate: remove old node first
+        if (this.nodes.has(id)) {
+            this.remove(id);
+        }
+        const nodeLevel = this.randomLevel();
+        const newNode = {
+            id,
+            embedding,
+            neighbors: new Map(),
+        };
+        // Initialize neighbor lists for each layer
+        for (let l = 0; l <= nodeLevel; l++) {
+            newNode.neighbors.set(l, []);
+        }
+        this.nodes.set(id, newNode);
+        // First node: set as entry point
+        if (this.entryPoint === null) {
+            this.entryPoint = id;
+            this.currentMaxLevel = nodeLevel;
+            return;
+        }
+        let currentEntry = this.entryPoint;
+        // Phase 1: Traverse layers above the new node's level (greedy descent)
+        for (let l = this.currentMaxLevel; l > nodeLevel; l--) {
+            currentEntry = this.searchLayer(embedding, currentEntry, l);
+        }
+        // Phase 2: For each layer from nodeLevel down to 0, find neighbors and link
+        for (let l = Math.min(nodeLevel, this.currentMaxLevel); l >= 0; l--) {
+            const maxConn = this.getMaxConnections(l);
+            // Beam search to find efConstruction nearest neighbors at this layer
+            const nearest = this.searchLayerBeam(embedding, [currentEntry], l, this.efConstruction);
+            // Select M best neighbors
+            const selectedIds = this.selectNeighbors(embedding, nearest, maxConn);
+            // Set the new node's neighbors at this layer
+            newNode.neighbors.set(l, [...selectedIds]);
+            // Add bidirectional connections and prune if over capacity
+            for (const neighborId of selectedIds) {
+                const neighbor = this.nodes.get(neighborId);
+                if (!neighbor)
+                    continue;
+                const neighborList = neighbor.neighbors.get(l) ?? [];
+                neighborList.push(id);
+                // Prune if neighbor has too many connections
+                if (neighborList.length > maxConn) {
+                    // Keep the maxConn closest neighbors
+                    const scored = neighborList
+                        .filter(nId => this.nodes.has(nId))
+                        .map(nId => ({
+                        id: nId,
+                        score: cosineSimilarity(neighbor.embedding, this.nodes.get(nId).embedding),
+                    }));
+                    scored.sort((a, b) => b.score - a.score);
+                    neighbor.neighbors.set(l, scored.slice(0, maxConn).map(s => s.id));
+                }
+                else {
+                    neighbor.neighbors.set(l, neighborList);
+                }
+            }
+            // Update entry for next layer down
+            if (nearest.length > 0) {
+                currentEntry = nearest[0].id;
+            }
+        }
+        // Update entry point if new node's level exceeds current max
+        if (nodeLevel > this.currentMaxLevel) {
+            this.entryPoint = id;
+            this.currentMaxLevel = nodeLevel;
+        }
+    }
+    /**
+     * Remove a node from the HNSW index and repair connections.
+     * Orphaned neighbors are reconnected to the removed node's other neighbors.
+     */
+    remove(id) {
+        const node = this.nodes.get(id);
+        if (!node)
+            return false;
+        // For each layer the node exists in, remove from neighbor lists and repair
+        for (const [level, neighbors] of node.neighbors.entries()) {
+            for (const neighborId of neighbors) {
+                const neighbor = this.nodes.get(neighborId);
+                if (!neighbor)
+                    continue;
+                const neighborList = neighbor.neighbors.get(level);
+                if (!neighborList)
+                    continue;
+                // Remove the deleted node from this neighbor's list
+                const idx = neighborList.indexOf(id);
+                if (idx !== -1) {
+                    neighborList.splice(idx, 1);
+                }
+                // Try to reconnect: for each of the deleted node's other neighbors,
+                // add a connection if capacity allows and not already connected
+                const maxConn = this.getMaxConnections(level);
+                if (neighborList.length < maxConn) {
+                    for (const otherNeighborId of neighbors) {
+                        if (otherNeighborId !== neighborId &&
+                            otherNeighborId !== id &&
+                            this.nodes.has(otherNeighborId) &&
+                            !neighborList.includes(otherNeighborId)) {
+                            neighborList.push(otherNeighborId);
+                            // Add reverse connection too
+                            const otherNeighbor = this.nodes.get(otherNeighborId);
+                            if (otherNeighbor) {
+                                const otherList = otherNeighbor.neighbors.get(level) ?? [];
+                                if (!otherList.includes(neighborId) && otherList.length < maxConn) {
+                                    otherList.push(neighborId);
+                                    otherNeighbor.neighbors.set(level, otherList);
+                                }
+                            }
+                            if (neighborList.length >= maxConn)
+                                break;
+                        }
+                    }
+                }
+                neighbor.neighbors.set(level, neighborList);
+            }
+        }
+        // Delete the node
+        this.nodes.delete(id);
+        // If the entry point was removed, pick a replacement
+        if (this.entryPoint === id) {
+            if (this.nodes.size === 0) {
+                this.entryPoint = null;
+                this.currentMaxLevel = -1;
+            }
+            else {
+                // Find the node with the highest level to be the new entry point
+                let bestId = null;
+                let bestLevel = -1;
+                for (const [nodeId, n] of this.nodes.entries()) {
+                    let maxNodeLevel = -1;
+                    for (const l of n.neighbors.keys()) {
+                        if (l > maxNodeLevel)
+                            maxNodeLevel = l;
+                    }
+                    if (maxNodeLevel > bestLevel) {
+                        bestLevel = maxNodeLevel;
+                        bestId = nodeId;
+                    }
+                }
+                this.entryPoint = bestId;
+                this.currentMaxLevel = bestLevel;
+            }
+        }
+        return true;
+    }
+    /**
+     * Search for k approximate nearest neighbors using HNSW traversal.
+     * O(log n) via hierarchical layer descent + beam search at base layer.
+     */
+    search(query, k) {
+        if (this.nodes.size === 0 || this.entryPoint === null) {
+            return [];
+        }
+        // Single node shortcut
+        if (this.nodes.size === 1) {
+            const node = this.nodes.get(this.entryPoint);
+            return [{ id: node.id, score: cosineSimilarity(query, node.embedding) }];
+        }
+        let currentEntry = this.entryPoint;
+        // Phase 1: Greedily traverse layers above base to find local minimum
+        for (let l = this.currentMaxLevel; l > 0; l--) {
+            currentEntry = this.searchLayer(query, currentEntry, l);
+        }
+        // Phase 2: Beam search at layer 0 with efSearch candidates
+        const ef = Math.max(this.efSearch, k);
+        const results = this.searchLayerBeam(query, [currentEntry], 0, ef);
+        // Return top-k results sorted by descending similarity
+        return results.slice(0, k);
+    }
+    /**
+     * Get index size
+     */
+    size() {
+        return this.nodes.size;
+    }
+    /**
+     * Clear the index and reset entry point
+     */
+    clear() {
+        this.nodes.clear();
+        this.entryPoint = null;
+        this.currentMaxLevel = -1;
+    }
+}
+//# sourceMappingURL=unified-memory-hnsw.js.map

package/v3/dist/kernel/unified-memory-hnsw.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"unified-memory-hnsw.js","sourceRoot":"","sources":["../../src/kernel/unified-memory-hnsw.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAEhD,+EAA+E;AAC/E,yCAAyC;AACzC,+EAA+E;AAE/E;;;GAGG;AACH,MAAM,OAAO,UAAU;IACb,IAAI,GAAQ,EAAE,CAAC;IACf,SAAS,CAAyB;IAE1C,YAAY,SAAiC;QAC3C,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAED,IAAI,CAAC,IAAO;QACV,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,CAAC;IAED,GAAG;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG,CAAC;QAC9B,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACnB,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACxD,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBACtE,CAAC,GAAG,MAAM,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,MAAM,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACvB,MAAM,KAAK,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YACxB,IAAI,IAAI,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBACzE,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC3E,QAAQ,GAAG,KAAK,CAAC;YACnB,CAAC;YACD,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACnB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1E,CAAC,GAAG,QAAQ,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,MAAM;YACR,CAAC;QACH,CAAC;IACH,CAAC;CACF;AAYD,+EAA+E;AAC/E,aAAa;AACb,+EAA+E;AAE/E;;;;GAIG;AACH,MAAM,OAAO,iBAAiB;IACpB,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;IAChC,CAAC,GAAW,cAAc,CAAC,aAAa,CAAC;IACzC,KAAK,GAAW,cAAc,CAAC,aAAa,GAAG,CAAC,CAAC;IACjD,cAAc,GAAW,cAAc,CAAC,eAAe,CAAC;IACxD,QAAQ,GAAW,cAAc,CAAC,SAAS,CAAC;IAC5C,EAAE,GAAW,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;IACxD,QAAQ,GAAW,EAAE,CAAC;IAE/B,UAAU,GAAkB,IAAI,CAAC;IACjC,eAAe,GAAW,CAAC,CAAC,CAAC;IAErC;;;OAGG;IACK,WAAW;QACjB,OAAO,IAAI,CAAC,GAAG,CACb,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,EAC9C,IAAI,CAAC,QAAQ,CACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,KAAe,EAAE,MAAc;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,CAAC;QACrB,OAAO,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IACjD,CAAC;IAED;;;;OAIG;IACK,WAAW,CACjB,KAAe,EACf,OAAe,EACf,KAAa;QAEb,IAAI,OAAO,GAAG,OAAO,CAAC;QACtB,IAAI,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClD,IAAI,QAAQ,GAAG,IAAI,CAAC;QAEpB,OAAO,QAAQ,EAAE,CAAC;YAChB,QAAQ,GAAG,KAAK,CAAC;YACjB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI;gBAAE,MAAM;YAEjB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAClD,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;gBAChD,IAAI,IAAI,GAAG,WAAW,EAAE,CAAC;oBACvB,OAAO,GAAG,UAAU,CAAC;oBACrB,WAAW,GAAG,IAAI,CAAC;oBACnB,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;OAMG;IACK,eAAe,CACrB,KAAe,EACf,QAAkB,EAClB,KAAa,EACb,EAAU;QAEV,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;QAE1C,MAAM,OAAO,GAAG,QAAQ;aACrB,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;aAChC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE1D,0DAA0D;QAC1D,MAAM,aAAa,GAAG,IAAI,UAAU,CAClC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,gCAAgC;SAC7D,CAAC;QACF,8DAA8D;QAC9D,MAAM,UAAU,GAAG,IAAI,UAAU,CAC/B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,+BAA+B;SAC5D,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;YAC5B,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC1B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;QAED,OAAO,aAAa,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAChC,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,EAAG,CAAC;YAErC,8DAA8D;YAC9D,uCAAuC;YACvC,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,OAAO,CAAC,KAAK,GAAG,UAAU,CAAC,IAAI,EAAG,CAAC,KAAK,EAAE,CAAC;gBACxE,MAAM;YACR,CAAC;YAED,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YACxC,IAAI,CAAC,IAAI;gBAAE,SAAS;YAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YAClD,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,IAAI,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBACtC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAExB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC;oBAAE,SAAS;gBAE1C,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;gBACjD,MAAM,WAAW,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,EAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;gBAEnF,IAAI,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,IAAI,KAAK,GAAG,WAAW,EAAE,CAAC;oBAClD,MAAM,KAAK,GAAG,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,CAAC;oBACxC,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAC1B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAEvB,sCAAsC;oBACtC,IAAI,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;wBAC3B,UAAU,CAAC,GAAG,EAAE,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,0DAA0D;QAC1D,MAAM,OAAO,GAAyC,EAAE,CAAC;QACzD,OAAO,UAAU,CAAC,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAG,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,oDAAoD;QACvE,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;OAGG;IACK,eAAe,CACrB,MAAgB,EAChB,UAAgD,EAChD,cAAsB;QAEtB,OAAO,UAAU;aACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC;aACjC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC;aACxB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACpB,CAAC;IAED;;;OAGG;IACK,iBAAiB,CAAC,KAAa;QACrC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,GAAG,CAAC,EAAU,EAAE,SAAmB;QACjC,0CAA0C;QAC1C,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvB,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAClB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,OAAO,GAAa;YACxB,EAAE;YACF,SAAS;YACT,SAAS,EAAE,IAAI,GAAG,EAAE;SACrB,CAAC;QAEF,2CAA2C;QAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QAC/B,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAE5B,iCAAiC;QACjC,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;YACjC,OAAO;QACT,CAAC;QAED,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,uEAAuE;QACvE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACtD,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,SAAS,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAC9D,CAAC;QAED,4EAA4E;QAC5E,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,eAAe,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACpE,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;YAE1C,qEAAqE;YACrE,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC,cAAc,CAAC,CAAC;YAExF,0BAA0B;YAC1B,MAAM,WAAW,GAAG,IAAI,CAAC,eAAe,CAAC,SAAS,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC;YAEtE,6CAA6C;YAC7C,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,CAAC,CAAC;YAE3C,2DAA2D;YAC3D,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;gBACrC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBACrD,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAEtB,6CAA6C;gBAC7C,IAAI,YAAY,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;oBAClC,qCAAqC;oBACrC,MAAM,MAAM,GAAG,YAAY;yBACxB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;yBAClC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;wBACX,EAAE,EAAE,GAAG;wBACP,KAAK,EAAE,gBAAgB,CAAC,QAAQ,CAAC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC,SAAS,CAAC;qBAC5E,CAAC,CAAC,CAAC;oBACN,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;oBACzC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACrE,CAAC;qBAAM,CAAC;oBACN,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;YAED,mCAAmC;YACnC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,6DAA6D;QAC7D,IAAI,SAAS,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC;YACrC,IAAI,CAAC,UAAU,GAAG,EAAE,CAAC;YACrB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;QACnC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,EAAU;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAChC,IAAI,CAAC,IAAI;YAAE,OAAO,KAAK,CAAC;QAExB,2EAA2E;QAC3E,KAAK,MAAM,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YAC1D,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;gBACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5C,IAAI,CAAC,QAAQ;oBAAE,SAAS;gBAExB,MAAM,YAAY,GAAG,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACnD,IAAI,CAAC,YAAY;oBAAE,SAAS;gBAE5B,oDAAoD;gBACpD,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;gBACrC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC;oBACf,YAAY,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;gBAC9B,CAAC;gBAED,oEAAoE;gBACpE,gEAAgE;gBAChE,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,CAAC,KAAK,CAAC,CAAC;gBAC9C,IAAI,YAAY,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;oBAClC,KAAK,MAAM,eAAe,IAAI,SAAS,EAAE,CAAC;wBACxC,IACE,eAAe,KAAK,UAAU;4BAC9B,eAAe,KAAK,EAAE;4BACtB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC;4BAC/B,CAAC,YAAY,CAAC,QAAQ,CAAC,eAAe,CAAC,EACvC,CAAC;4BACD,YAAY,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC;4BACnC,6BAA6B;4BAC7B,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,eAAe,CAAC,CAAC;4BACtD,IAAI,aAAa,EAAE,CAAC;gCAClB,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;gCAC3D,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,SAAS,CAAC,MAAM,GAAG,OAAO,EAAE,CAAC;oCAClE,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;oCAC3B,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;gCAChD,CAAC;4BACH,CAAC;4BACD,IAAI,YAAY,CAAC,MAAM,IAAI,OAAO;gCAAE,MAAM;wBAC5C,CAAC;oBACH,CAAC;gBACH,CAAC;gBAED,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YAC9C,CAAC;QACH,CAAC;QAED,kBAAkB;QAClB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QAEtB,qDAAqD;QACrD,IAAI,IAAI,CAAC,UAAU,KAAK,EAAE,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,iEAAiE;gBACjE,IAAI,MAAM,GAAkB,IAAI,CAAC;gBACjC,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;gBACnB,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC/C,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;oBACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;wBACnC,IAAI,CAAC,GAAG,YAAY;4BAAE,YAAY,GAAG,CAAC,CAAC;oBACzC,CAAC;oBACD,IAAI,YAAY,GAAG,SAAS,EAAE,CAAC;wBAC7B,SAAS,GAAG,YAAY,CAAC;wBACzB,MAAM,GAAG,MAAM,CAAC;oBAClB,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC;gBACzB,IAAI,CAAC,eAAe,GAAG,SAAS,CAAC;YACnC,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAe,EAAE,CAAS;QAC/B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YACtD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,uBAAuB;QACvB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAE,CAAC;YAC9C,OAAO,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,KAAK,EAAE,gBAAgB,CAAC,KAAK,EAAE,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;QAC3E,CAAC;QAED,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,qEAAqE;QACrE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,eAAe,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,YAAY,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;QAC1D,CAAC;QAED,2DAA2D;QAC3D,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC;QAEnE,uDAAuD;QACvD,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,IAAI;QACF,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,eAAe,GAAG,CAAC,CAAC,CAAC;IAC5B,CAAC;CACF"}

package/v3/dist/kernel/unified-memory-migration.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"unified-memory-migration.d.ts","sourceRoot":"","sources":["../../src/kernel/unified-memory-migration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAOH,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,aAAa,EAAE,OAAO,CAAC;IACvB,qDAAqD;IACrD,0BAA0B,EAAE,OAAO,CAAC;IACpC,yDAAyD;IACzD,MAAM,EAAE,OAAO,CAAC;CACjB;AASD;;GAEG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAClC,OAAO,CAAC,eAAe,CAAC,CA2N1B;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,OAAO,GAAE,MAAsB,GAAG,OAAO,CAGxE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,GAAE,MAAsB,GAAG;IACnE,cAAc,EAAE,OAAO,CAAC;IACxB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,OAAO,CAAC;CACvB,CAaA"}
+{"version":3,"file":"unified-memory-migration.d.ts","sourceRoot":"","sources":["../../src/kernel/unified-memory-migration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAWH,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,OAAO,CAAC;IACjB,cAAc,EAAE,MAAM,EAAE,CAAC;IACzB,eAAe,EAAE,MAAM,EAAE,CAAC;IAC1B,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAED,MAAM,WAAW,gBAAgB;IAC/B,mCAAmC;IACnC,OAAO,EAAE,MAAM,CAAC;IAChB,sCAAsC;IACtC,aAAa,EAAE,OAAO,CAAC;IACvB,qDAAqD;IACrD,0BAA0B,EAAE,OAAO,CAAC;IACpC,yDAAyD;IACzD,MAAM,EAAE,OAAO,CAAC;CACjB;AASD;;GAEG;AACH,wBAAsB,sBAAsB,CAC1C,OAAO,CAAC,EAAE,OAAO,CAAC,gBAAgB,CAAC,GAClC,OAAO,CAAC,eAAe,CAAC,CAwN1B;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,OAAO,GAAE,MAAsB,GAAG,OAAO,CAGxE;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAAC,OAAO,GAAE,MAAsB,GAAG;IACnE,cAAc,EAAE,OAAO,CAAC;IACxB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,YAAY,EAAE,OAAO,CAAC;CACvB,CAaA"}

package/v3/dist/kernel/unified-memory-migration.js

@@ -10,7 +10,9 @@
 import Database from 'better-sqlite3';
 import * as fs from 'fs';
 import * as path from 'path';
+import { LoggerFactory } from '../logging/index.js';
 import { validateTableName } from '../shared/sql-safety.js';
+const logger = LoggerFactory.create('UnifiedMemoryMigration');
 const DEFAULT_OPTIONS = {
     baseDir: '.agentic-qe',
     createBackups: true,
@@ -31,12 +33,10 @@ export async function migrateToUnifiedMemory(options) {
     };
     const memoryDbPath = path.join(opts.baseDir, 'memory.db');
     const aqeDbPath = path.join(opts.baseDir, 'aqe.db');
-    console.log(`[Migration] Starting unified memory migration`);
-    console.log(`[Migration] Target: ${memoryDbPath}`);
-    console.log(`[Migration] Source: ${aqeDbPath}`);
+    logger.info('Starting unified memory migration', { target: memoryDbPath, source: aqeDbPath });
     // Check if source exists
     if (!fs.existsSync(aqeDbPath)) {
-        console.log(`[Migration] No aqe.db found - nothing to migrate`);
+        logger.info('No aqe.db found - nothing to migrate');
         result.success = true;
         return result;
     }
@@ -48,16 +48,16 @@ export async function migrateToUnifiedMemory(options) {
             const backupPath = `${memoryDbPath}.backup-${timestamp}`;
             fs.copyFileSync(memoryDbPath, backupPath);
             result.backupsCreated.push(backupPath);
-            console.log(`[Migration] Created backup: ${backupPath}`);
+            logger.info('Created backup', { path: backupPath });
         }
         // Backup aqe.db
         const aqeBackupPath = `${aqeDbPath}.backup-${timestamp}`;
         fs.copyFileSync(aqeDbPath, aqeBackupPath);
         result.backupsCreated.push(aqeBackupPath);
-        console.log(`[Migration] Created backup: ${aqeBackupPath}`);
+        logger.info('Created backup', { path: aqeBackupPath });
     }
     if (opts.dryRun) {
-        console.log(`[Migration] DRY RUN - showing what would be migrated:`);
+        logger.info('DRY RUN - showing what would be migrated');
     }
     let sourceDb = null;
     let targetDb = null;
@@ -79,7 +79,6 @@ export async function migrateToUnifiedMemory(options) {
             'goap_goals',
             'goap_actions',
             'goap_plans',
-            'goap_execution_steps',
             'goap_plan_signatures',
             'concept_nodes',
             'concept_edges',
@@ -101,7 +100,7 @@ export async function migrateToUnifiedMemory(options) {
                 if (rowCount === 0) {
                     continue;
                 }
-                console.log(`[Migration] Table ${tableName}: ${rowCount} rows`);
+                logger.info('Table migration', { table: tableName, rows: rowCount });
                 if (opts.dryRun) {
                     result.tableseMigrated.push(tableName);
                     result.rowsMigrated += rowCount;
@@ -134,7 +133,7 @@ export async function migrateToUnifiedMemory(options) {
             }
             catch (tableError) {
                 const errMsg = `Failed to migrate ${tableName}: ${tableError}`;
-                console.error(`[Migration] ${errMsg}`);
+                logger.error(errMsg);
                 result.errors.push(errMsg);
             }
         }
@@ -169,11 +168,11 @@ export async function migrateToUnifiedMemory(options) {
                         insertStmt.run(r.key, r.namespace, r.value, r.expires_at, r.created_at);
                     }
                 }
-                console.log(`[Migration] KV store: ${kvRows.length} entries (new only, no overwrites)`);
+                logger.info('KV store migration', { entries: kvRows.length, mode: 'no overwrites' });
             }
         }
         catch (kvError) {
-            console.warn(`[Migration] KV migration skipped: ${kvError}`);
+            logger.warn('KV migration skipped', { error: kvError });
         }
         // Close databases
         sourceDb.close();
@@ -192,14 +191,14 @@ export async function migrateToUnifiedMemory(options) {
                 fs.unlinkSync(walPath);
             if (fs.existsSync(shmPath))
                 fs.unlinkSync(shmPath);
-            console.log(`[Migration] Deleted source: ${aqeDbPath}`);
+            logger.info('Deleted source', { path: aqeDbPath });
         }
         result.success = result.errors.length === 0;
-        console.log(`[Migration] Complete: ${result.tableseMigrated.length} tables, ${result.rowsMigrated} rows`);
+        logger.info('Migration complete', { tables: result.tableseMigrated.length, rows: result.rowsMigrated });
     }
     catch (error) {
         result.errors.push(`Migration failed: ${error}`);
-        console.error(`[Migration] Fatal error: ${error}`);
+        logger.error('Fatal migration error', error instanceof Error ? error : undefined);
     }
     finally {
         if (sourceDb)

package/v3/dist/kernel/unified-memory-migration.js.map

@@ -1 +1 @@
-{"version":3,"file":"unified-memory-migration.js","sourceRoot":"","sources":["../../src/kernel/unified-memory-migration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,QAA2C,MAAM,gBAAgB,CAAC;AACzE,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAC7B,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAqB5D,MAAM,eAAe,GAAqB;IACxC,OAAO,EAAE,aAAa;IACtB,aAAa,EAAE,IAAI;IACnB,0BAA0B,EAAE,KAAK,EAAE,eAAe;IAClD,MAAM,EAAE,KAAK;CACd,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAmC;IAEnC,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAChD,MAAM,MAAM,GAAoB;QAC9B,OAAO,EAAE,KAAK;QACd,cAAc,EAAE,EAAE;QAClB,eAAe,EAAE,EAAE;QACnB,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,EAAE;KACX,CAAC;IAEF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEpD,OAAO,CAAC,GAAG,CAAC,+CAA+C,CAAC,CAAC;IAC7D,OAAO,CAAC,GAAG,CAAC,uBAAuB,YAAY,EAAE,CAAC,CAAC;IACnD,OAAO,CAAC,GAAG,CAAC,uBAAuB,SAAS,EAAE,CAAC,CAAC;IAEhD,yBAAyB;IACzB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,CAAC,kDAAkD,CAAC,CAAC;QAChE,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,iBAAiB;IACjB,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAEjE,gCAAgC;QAChC,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;YAChC,MAAM,UAAU,GAAG,GAAG,YAAY,WAAW,SAAS,EAAE,CAAC;YACzD,EAAE,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YAC1C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvC,OAAO,CAAC,GAAG,CAAC,+BAA+B,UAAU,EAAE,CAAC,CAAC;QAC3D,CAAC;QAED,gBAAgB;QAChB,MAAM,aAAa,GAAG,GAAG,SAAS,WAAW,SAAS,EAAE,CAAC;QACzD,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;QAC1C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1C,OAAO,CAAC,GAAG,CAAC,+BAA+B,aAAa,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,OAAO,CAAC,GAAG,CAAC,uDAAuD,CAAC,CAAC;IACvE,CAAC;IAED,IAAI,QAAQ,GAAwB,IAAI,CAAC;IACzC,IAAI,QAAQ,GAAwB,IAAI,CAAC;IAEzC,IAAI,CAAC;QACH,gCAAgC;QAChC,QAAQ,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAEvD,mCAAmC;QACnC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,0BAA0B;YAC1B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACjC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAClD,CAAC;YACD,QAAQ,GAAG,IAAI,QAAQ,CAAC,YAAY,CAAC,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QAED,gCAAgC;QAChC,MAAM,eAAe,GAAG;YACtB,aAAa;YACb,YAAY;YACZ,cAAc;YACd,YAAY;YACZ,sBAAsB;YACtB,sBAAsB;YACtB,eAAe;YACf,eAAe;YACf,cAAc;YACd,gBAAgB;SACjB,CAAC;QAEF,KAAK,MAAM,SAAS,IAAI,eAAe,EAAE,CAAC;YACxC,IAAI,CAAC;gBACH,kCAAkC;gBAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC;;SAEpC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAElB,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;gBAED,aAAa;gBACb,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,iCAAiC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,EAAuB,CAAC;gBAC9H,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;gBAEhC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACnB,SAAS;gBACX,CAAC;gBAED,OAAO,CAAC,GAAG,CAAC,qBAAqB,SAAS,KAAK,QAAQ,OAAO,CAAC,CAAC;gBAEhE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChB,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACvC,MAAM,CAAC,YAAY,IAAI,QAAQ,CAAC;oBAChC,SAAS;gBACX,CAAC;gBAED,gEAAgE;gBAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC;;SAElC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAoB,CAAC;gBAErC,QAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBAE9B,YAAY;gBACZ,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,iBAAiB,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;gBAErF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC,CAAC;oBAC/C,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvD,MAAM,UAAU,GAAG,QAAS,CAAC,OAAO,CAAC;qCACV,iBAAiB,CAAC,SAAS,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;sBAClE,YAAY;WACvB,CAAC,CAAC;oBAEH,MAAM,UAAU,GAAG,QAAS,CAAC,WAAW,CAAC,CAAC,KAAgB,EAAE,EAAE;wBAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;4BACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,IAAgC,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC1E,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;wBAC5B,CAAC;oBACH,CAAC,CAAC,CAAC;oBAEH,UAAU,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAED,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACvC,MAAM,CAAC,YAAY,IAAI,QAAQ,CAAC;YAElC,CAAC;YAAC,OAAO,UAAU,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,qBAAqB,SAAS,KAAK,UAAU,EAAE,CAAC;gBAC/D,OAAO,CAAC,KAAK,CAAC,eAAe,MAAM,EAAE,CAAC,CAAC;gBACvC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC;;OAEjC,CAAC,CAAC,GAAG,EAAE,CAAC;YAET,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC,GAAG,EAAE,CAAC;gBAEhE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACtC,yBAAyB;oBACzB,QAAS,CAAC,IAAI,CAAC;;;;;;;;;;;WAWd,CAAC,CAAC;oBAEH,uCAAuC;oBACvC,MAAM,UAAU,GAAG,QAAS,CAAC,OAAO,CAAC;;;WAGpC,CAAC,CAAC;oBAEH,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;wBACzB,MAAM,CAAC,GAAG,GAAuG,CAAC;wBAClH,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;oBAC1E,CAAC;gBACH,CAAC;gBAED,OAAO,CAAC,GAAG,CAAC,yBAAyB,MAAM,CAAC,MAAM,oCAAoC,CAAC,CAAC;YAC1F,CAAC;QACH,CAAC;QAAC,OAAO,OAAO,EAAE,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,qCAAqC,OAAO,EAAE,CAAC,CAAC;QAC/D,CAAC;QAED,kBAAkB;QAClB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,QAAQ,GAAG,IAAI,CAAC;QAEhB,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,0DAA0D;QAC1D,IAAI,IAAI,CAAC,0BAA0B,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClF,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACzB,8BAA8B;YAC9B,MAAM,OAAO,GAAG,GAAG,SAAS,MAAM,CAAC;YACnC,MAAM,OAAO,GAAG,GAAG,SAAS,MAAM,CAAC;YACnC,IAAI,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;gBAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACnD,IAAI,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;gBAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACnD,OAAO,CAAC,GAAG,CAAC,+BAA+B,SAAS,EAAE,CAAC,CAAC;QAC1D,CAAC;QAED,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;QAE5C,OAAO,CAAC,GAAG,CAAC,yBAAyB,MAAM,CAAC,eAAe,CAAC,MAAM,YAAY,MAAM,CAAC,YAAY,OAAO,CAAC,CAAC;IAE5G,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAqB,KAAK,EAAE,CAAC,CAAC;QACjD,OAAO,CAAC,KAAK,CAAC,4BAA4B,KAAK,EAAE,CAAC,CAAC;IAErD,CAAC;YAAS,CAAC;QACT,IAAI,QAAQ;YAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,QAAQ;YAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,UAAkB,aAAa;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC/C,OAAO,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAkB,aAAa;IAMhE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAE/C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAEtD,OAAO;QACL,cAAc,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;QAClC,OAAO;QACP,MAAM,EAAE,YAAY;QACpB,YAAY,EAAE,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;KAC1C,CAAC;AACJ,CAAC"}
+{"version":3,"file":"unified-memory-migration.js","sourceRoot":"","sources":["../../src/kernel/unified-memory-migration.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,QAA2C,MAAM,gBAAgB,CAAC;AACzE,OAAO,KAAK,EAAE,MAAM,IAAI,CAAC;AACzB,OAAO,KAAK,IAAI,MAAM,MAAM,CAAC;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC;AAEpD,OAAO,EAAE,iBAAiB,EAAE,MAAM,yBAAyB,CAAC;AAE5D,MAAM,MAAM,GAAW,aAAa,CAAC,MAAM,CAAC,wBAAwB,CAAC,CAAC;AAqBtE,MAAM,eAAe,GAAqB;IACxC,OAAO,EAAE,aAAa;IACtB,aAAa,EAAE,IAAI;IACnB,0BAA0B,EAAE,KAAK,EAAE,eAAe;IAClD,MAAM,EAAE,KAAK;CACd,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,OAAmC;IAEnC,MAAM,IAAI,GAAG,EAAE,GAAG,eAAe,EAAE,GAAG,OAAO,EAAE,CAAC;IAChD,MAAM,MAAM,GAAoB;QAC9B,OAAO,EAAE,KAAK;QACd,cAAc,EAAE,EAAE;QAClB,eAAe,EAAE,EAAE;QACnB,YAAY,EAAE,CAAC;QACf,MAAM,EAAE,EAAE;KACX,CAAC;IAEF,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEpD,MAAM,CAAC,IAAI,CAAC,mCAAmC,EAAE,EAAE,MAAM,EAAE,YAAY,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC;IAE9F,yBAAyB;IACzB,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC9B,MAAM,CAAC,IAAI,CAAC,sCAAsC,CAAC,CAAC;QACpD,MAAM,CAAC,OAAO,GAAG,IAAI,CAAC;QACtB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,iBAAiB;IACjB,IAAI,IAAI,CAAC,aAAa,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QAEjE,gCAAgC;QAChC,IAAI,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC,EAAE,CAAC;YAChC,MAAM,UAAU,GAAG,GAAG,YAAY,WAAW,SAAS,EAAE,CAAC;YACzD,EAAE,CAAC,YAAY,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;YAC1C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACvC,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,gBAAgB;QAChB,MAAM,aAAa,GAAG,GAAG,SAAS,WAAW,SAAS,EAAE,CAAC;QACzD,EAAE,CAAC,YAAY,CAAC,SAAS,EAAE,aAAa,CAAC,CAAC;QAC1C,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC;QAC1C,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,IAAI,EAAE,aAAa,EAAE,CAAC,CAAC;IACzD,CAAC;IAED,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChB,MAAM,CAAC,IAAI,CAAC,0CAA0C,CAAC,CAAC;IAC1D,CAAC;IAED,IAAI,QAAQ,GAAwB,IAAI,CAAC;IACzC,IAAI,QAAQ,GAAwB,IAAI,CAAC;IAEzC,IAAI,CAAC;QACH,gCAAgC;QAChC,QAAQ,GAAG,IAAI,QAAQ,CAAC,SAAS,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;QAEvD,mCAAmC;QACnC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,0BAA0B;YAC1B,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;gBACjC,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YAClD,CAAC;YACD,QAAQ,GAAG,IAAI,QAAQ,CAAC,YAAY,CAAC,CAAC;YACtC,QAAQ,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;QACxC,CAAC;QAED,gCAAgC;QAChC,MAAM,eAAe,GAAG;YACtB,aAAa;YACb,YAAY;YACZ,cAAc;YACd,YAAY;YACZ,sBAAsB;YACtB,eAAe;YACf,eAAe;YACf,cAAc;YACd,gBAAgB;SACjB,CAAC;QAEF,KAAK,MAAM,SAAS,IAAI,eAAe,EAAE,CAAC;YACxC,IAAI,CAAC;gBACH,kCAAkC;gBAClC,MAAM,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC;;SAEpC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAElB,IAAI,CAAC,WAAW,EAAE,CAAC;oBACjB,SAAS;gBACX,CAAC;gBAED,aAAa;gBACb,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,iCAAiC,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,EAAuB,CAAC;gBAC9H,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC;gBAEhC,IAAI,QAAQ,KAAK,CAAC,EAAE,CAAC;oBACnB,SAAS;gBACX,CAAC;gBAED,MAAM,CAAC,IAAI,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;gBAErE,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAChB,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACvC,MAAM,CAAC,YAAY,IAAI,QAAQ,CAAC;oBAChC,SAAS;gBACX,CAAC;gBAED,gEAAgE;gBAChE,MAAM,SAAS,GAAG,QAAQ,CAAC,OAAO,CAAC;;SAElC,CAAC,CAAC,GAAG,CAAC,SAAS,CAAoB,CAAC;gBAErC,QAAS,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;gBAE9B,YAAY;gBACZ,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,iBAAiB,iBAAiB,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;gBAErF,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACpB,MAAM,OAAO,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAW,CAAC,CAAC;oBAC/C,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;oBACvD,MAAM,UAAU,GAAG,QAAS,CAAC,OAAO,CAAC;qCACV,iBAAiB,CAAC,SAAS,CAAC,KAAK,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;sBAClE,YAAY;WACvB,CAAC,CAAC;oBAEH,MAAM,UAAU,GAAG,QAAS,CAAC,WAAW,CAAC,CAAC,KAAgB,EAAE,EAAE;wBAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;4BACzB,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAE,IAAgC,CAAC,GAAG,CAAC,CAAC,CAAC;4BAC1E,UAAU,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;wBAC5B,CAAC;oBACH,CAAC,CAAC,CAAC;oBAEH,UAAU,CAAC,IAAI,CAAC,CAAC;gBACnB,CAAC;gBAED,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACvC,MAAM,CAAC,YAAY,IAAI,QAAQ,CAAC;YAElC,CAAC;YAAC,OAAO,UAAU,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,qBAAqB,SAAS,KAAK,UAAU,EAAE,CAAC;gBAC/D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;gBACrB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC;QAED,8CAA8C;QAC9C,IAAI,CAAC;YACH,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC;;OAEjC,CAAC,CAAC,GAAG,EAAE,CAAC;YAET,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,MAAM,GAAG,QAAQ,CAAC,OAAO,CAAC,wBAAwB,CAAC,CAAC,GAAG,EAAE,CAAC;gBAEhE,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;oBACtC,yBAAyB;oBACzB,QAAS,CAAC,IAAI,CAAC;;;;;;;;;;;WAWd,CAAC,CAAC;oBAEH,uCAAuC;oBACvC,MAAM,UAAU,GAAG,QAAS,CAAC,OAAO,CAAC;;;WAGpC,CAAC,CAAC;oBAEH,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;wBACzB,MAAM,CAAC,GAAG,GAAuG,CAAC;wBAClH,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,SAAS,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC;oBAC1E,CAAC;gBACH,CAAC;gBAED,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE,EAAE,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,EAAE,eAAe,EAAE,CAAC,CAAC;YACvF,CAAC;QACH,CAAC;QAAC,OAAO,OAAO,EAAE,CAAC;YACjB,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QAC1D,CAAC;QAED,kBAAkB;QAClB,QAAQ,CAAC,KAAK,EAAE,CAAC;QACjB,QAAQ,GAAG,IAAI,CAAC;QAEhB,IAAI,QAAQ,EAAE,CAAC;YACb,QAAQ,CAAC,KAAK,EAAE,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QAED,0DAA0D;QAC1D,IAAI,IAAI,CAAC,0BAA0B,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClF,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YACzB,8BAA8B;YAC9B,MAAM,OAAO,GAAG,GAAG,SAAS,MAAM,CAAC;YACnC,MAAM,OAAO,GAAG,GAAG,SAAS,MAAM,CAAC;YACnC,IAAI,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;gBAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACnD,IAAI,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC;gBAAE,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC;YACnD,MAAM,CAAC,IAAI,CAAC,gBAAgB,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC,CAAC;QACrD,CAAC;QAED,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC;QAE5C,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,eAAe,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;IAE1G,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,qBAAqB,KAAK,EAAE,CAAC,CAAC;QACjD,MAAM,CAAC,KAAK,CAAC,uBAAuB,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAEpF,CAAC;YAAS,CAAC;QACT,IAAI,QAAQ;YAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,QAAQ;YAAE,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjC,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,UAAkB,aAAa;IAC7D,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAC/C,OAAO,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAAC,UAAkB,aAAa;IAMhE,MAAM,YAAY,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACrD,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAE/C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,EAAE,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAEtD,OAAO;QACL,cAAc,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC;QAClC,OAAO;QACP,MAAM,EAAE,YAAY;QACpB,YAAY,EAAE,EAAE,CAAC,UAAU,CAAC,YAAY,CAAC;KAC1C,CAAC;AACJ,CAAC"}

package/v3/dist/kernel/unified-memory-schemas.d.ts

@@ -0,0 +1,21 @@
+/**
+ * SQL Schema Definitions for Unified Memory
+ *
+ * Contains all table schemas used by UnifiedMemoryManager.
+ * Extracted from unified-memory.ts for maintainability.
+ */
+import { HYPERGRAPH_SCHEMA } from '../migrations/20260120_add_hypergraph_tables.js';
+export { HYPERGRAPH_SCHEMA };
+export declare const SCHEMA_VERSION = 8;
+export declare const SCHEMA_VERSION_TABLE = "\n  CREATE TABLE IF NOT EXISTS schema_version (\n    id INTEGER PRIMARY KEY CHECK (id = 1),\n    version INTEGER NOT NULL,\n    migrated_at TEXT DEFAULT (datetime('now'))\n  );\n";
+export declare const KV_STORE_SCHEMA = "\n  -- Key-Value Store (v2 compatible - same schema as HybridBackend)\n  CREATE TABLE IF NOT EXISTS kv_store (\n    key TEXT NOT NULL,\n    namespace TEXT NOT NULL,\n    value TEXT NOT NULL,\n    expires_at INTEGER,\n    created_at INTEGER DEFAULT (strftime('%s', 'now') * 1000),\n    PRIMARY KEY (namespace, key)\n  );\n  CREATE INDEX IF NOT EXISTS idx_kv_namespace ON kv_store(namespace);\n  CREATE INDEX IF NOT EXISTS idx_kv_expires ON kv_store(expires_at) WHERE expires_at IS NOT NULL;\n";
+export declare const VECTORS_SCHEMA = "\n  -- Vector Embeddings (new in v3 - replaces in-memory AgentDB)\n  CREATE TABLE IF NOT EXISTS vectors (\n    id TEXT PRIMARY KEY,\n    namespace TEXT NOT NULL DEFAULT 'default',\n    embedding BLOB NOT NULL,\n    dimensions INTEGER NOT NULL,\n    metadata TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now'))\n  );\n  CREATE INDEX IF NOT EXISTS idx_vectors_namespace ON vectors(namespace);\n  CREATE INDEX IF NOT EXISTS idx_vectors_dimensions ON vectors(dimensions);\n";
+export declare const RL_QVALUES_SCHEMA = "\n  -- Q-Values for RL algorithms (ADR-046)\n  CREATE TABLE IF NOT EXISTS rl_q_values (\n    id TEXT PRIMARY KEY,\n    algorithm TEXT NOT NULL,\n    agent_id TEXT NOT NULL,\n    state_key TEXT NOT NULL,\n    action_key TEXT NOT NULL,\n    q_value REAL NOT NULL DEFAULT 0.0,\n    visits INTEGER NOT NULL DEFAULT 0,\n    last_reward REAL,\n    domain TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    UNIQUE(algorithm, agent_id, state_key, action_key)\n  );\n  CREATE INDEX IF NOT EXISTS idx_qvalues_agent ON rl_q_values(agent_id);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_algorithm ON rl_q_values(algorithm);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_state ON rl_q_values(agent_id, state_key);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_domain ON rl_q_values(domain);\n  CREATE INDEX IF NOT EXISTS idx_qvalues_updated ON rl_q_values(updated_at);\n";
+export declare const GOAP_SCHEMA = "\n  -- GOAP Goals\n  CREATE TABLE IF NOT EXISTS goap_goals (\n    id TEXT PRIMARY KEY,\n    name TEXT NOT NULL,\n    description TEXT,\n    conditions TEXT NOT NULL,\n    priority INTEGER DEFAULT 3,\n    qe_domain TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Actions\n  CREATE TABLE IF NOT EXISTS goap_actions (\n    id TEXT PRIMARY KEY,\n    name TEXT NOT NULL,\n    description TEXT,\n    agent_type TEXT NOT NULL,\n    preconditions TEXT NOT NULL,\n    effects TEXT NOT NULL,\n    cost REAL DEFAULT 1.0,\n    estimated_duration_ms INTEGER,\n    success_rate REAL DEFAULT 1.0,\n    execution_count INTEGER DEFAULT 0,\n    category TEXT NOT NULL,\n    qe_domain TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Plans\n  CREATE TABLE IF NOT EXISTS goap_plans (\n    id TEXT PRIMARY KEY,\n    goal_id TEXT,\n    initial_state TEXT NOT NULL,\n    goal_state TEXT NOT NULL,\n    action_sequence TEXT NOT NULL,\n    total_cost REAL,\n    estimated_duration_ms INTEGER,\n    status TEXT DEFAULT 'pending',\n    reused_from TEXT,\n    similarity_score REAL,\n    created_at TEXT DEFAULT (datetime('now')),\n    executed_at TEXT,\n    completed_at TEXT,\n    FOREIGN KEY (goal_id) REFERENCES goap_goals(id)\n  );\n\n  -- Plan Signatures (for similarity matching)\n  CREATE TABLE IF NOT EXISTS goap_plan_signatures (\n    id TEXT PRIMARY KEY,\n    plan_id TEXT NOT NULL UNIQUE,\n    goal_hash TEXT NOT NULL,\n    state_vector TEXT NOT NULL,\n    action_sequence TEXT NOT NULL,\n    total_cost REAL NOT NULL,\n    success_rate REAL DEFAULT 1.0,\n    usage_count INTEGER DEFAULT 0,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- GOAP Indexes\n  CREATE INDEX IF NOT EXISTS idx_goap_actions_category ON goap_actions(category);\n  CREATE INDEX IF NOT EXISTS idx_goap_actions_agent ON goap_actions(agent_type);\n  CREATE INDEX IF NOT EXISTS idx_goap_plans_status ON goap_plans(status);\n  CREATE INDEX IF NOT EXISTS idx_goap_sig_goal ON goap_plan_signatures(goal_hash);\n";
+export declare const DREAM_SCHEMA = "\n  -- Concept Graph Nodes (Dream Engine)\n  CREATE TABLE IF NOT EXISTS concept_nodes (\n    id TEXT PRIMARY KEY,\n    concept_type TEXT NOT NULL,\n    content TEXT NOT NULL,\n    embedding BLOB,\n    activation_level REAL DEFAULT 0.0,\n    last_activated TEXT,\n    pattern_id TEXT,\n    metadata TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Concept Edges\n  CREATE TABLE IF NOT EXISTS concept_edges (\n    id TEXT PRIMARY KEY,\n    source TEXT NOT NULL,\n    target TEXT NOT NULL,\n    weight REAL NOT NULL DEFAULT 1.0,\n    edge_type TEXT NOT NULL,\n    evidence INTEGER DEFAULT 1,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (source) REFERENCES concept_nodes(id) ON DELETE CASCADE,\n    FOREIGN KEY (target) REFERENCES concept_nodes(id) ON DELETE CASCADE\n  );\n\n  -- Dream Cycles\n  CREATE TABLE IF NOT EXISTS dream_cycles (\n    id TEXT PRIMARY KEY,\n    start_time TEXT NOT NULL,\n    end_time TEXT,\n    duration_ms INTEGER,\n    concepts_processed INTEGER DEFAULT 0,\n    associations_found INTEGER DEFAULT 0,\n    insights_generated INTEGER DEFAULT 0,\n    status TEXT DEFAULT 'running',\n    error TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Dream Insights\n  CREATE TABLE IF NOT EXISTS dream_insights (\n    id TEXT PRIMARY KEY,\n    cycle_id TEXT NOT NULL,\n    insight_type TEXT NOT NULL,\n    source_concepts TEXT NOT NULL,\n    description TEXT NOT NULL,\n    novelty_score REAL DEFAULT 0.5,\n    confidence_score REAL DEFAULT 0.5,\n    actionable INTEGER DEFAULT 0,\n    applied INTEGER DEFAULT 0,\n    suggested_action TEXT,\n    pattern_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (cycle_id) REFERENCES dream_cycles(id) ON DELETE CASCADE\n  );\n\n  -- Dream Indexes\n  CREATE INDEX IF NOT EXISTS idx_concept_type ON concept_nodes(concept_type);\n  CREATE INDEX IF NOT EXISTS idx_concept_activation ON concept_nodes(activation_level);\n  CREATE INDEX IF NOT EXISTS idx_concept_pattern ON concept_nodes(pattern_id);\n  CREATE INDEX IF NOT EXISTS idx_edge_source ON concept_edges(source);\n  CREATE INDEX IF NOT EXISTS idx_edge_target ON concept_edges(target);\n  CREATE INDEX IF NOT EXISTS idx_edge_type ON concept_edges(edge_type);\n  CREATE INDEX IF NOT EXISTS idx_edge_weight ON concept_edges(weight DESC);\n  CREATE INDEX IF NOT EXISTS idx_insight_cycle ON dream_insights(cycle_id);\n  CREATE INDEX IF NOT EXISTS idx_dream_status ON dream_cycles(status);\n";
+export declare const QE_PATTERNS_SCHEMA = "\n  -- QE Patterns table (unified from sqlite-persistence.ts)\n  CREATE TABLE IF NOT EXISTS qe_patterns (\n    id TEXT PRIMARY KEY,\n    pattern_type TEXT NOT NULL,\n    qe_domain TEXT NOT NULL,\n    domain TEXT NOT NULL,\n    name TEXT NOT NULL,\n    description TEXT,\n    confidence REAL DEFAULT 0.5,\n    usage_count INTEGER DEFAULT 0,\n    success_rate REAL DEFAULT 0.0,\n    quality_score REAL DEFAULT 0.0,\n    tier TEXT DEFAULT 'short-term',\n    template_json TEXT,\n    context_json TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    last_used_at TEXT,\n    successful_uses INTEGER DEFAULT 0,\n    tokens_used INTEGER,\n    input_tokens INTEGER,\n    output_tokens INTEGER,\n    latency_ms REAL,\n    reusable INTEGER DEFAULT 0,\n    reuse_count INTEGER DEFAULT 0,\n    average_token_savings REAL DEFAULT 0,\n    total_tokens_saved INTEGER\n  );\n\n  -- Pattern embeddings table (BLOB storage for vectors)\n  CREATE TABLE IF NOT EXISTS qe_pattern_embeddings (\n    pattern_id TEXT PRIMARY KEY,\n    embedding BLOB NOT NULL,\n    dimension INTEGER NOT NULL,\n    model TEXT DEFAULT 'all-MiniLM-L6-v2',\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (pattern_id) REFERENCES qe_patterns(id) ON DELETE CASCADE\n  );\n\n  -- Pattern usage history (no FK -- used as analytics log by hooks with synthetic IDs)\n  CREATE TABLE IF NOT EXISTS qe_pattern_usage (\n    id INTEGER PRIMARY KEY AUTOINCREMENT,\n    pattern_id TEXT NOT NULL,\n    success INTEGER NOT NULL,\n    metrics_json TEXT,\n    feedback TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Learning trajectories\n  CREATE TABLE IF NOT EXISTS qe_trajectories (\n    id TEXT PRIMARY KEY,\n    task TEXT NOT NULL,\n    agent TEXT,\n    domain TEXT,\n    started_at TEXT DEFAULT (datetime('now')),\n    ended_at TEXT,\n    success INTEGER,\n    steps_json TEXT,\n    metadata_json TEXT\n  );\n\n  -- Embeddings table (unified from EmbeddingCache.ts)\n  -- Renamed from 'embedding_cache' to 'embeddings' to match existing code\n  CREATE TABLE IF NOT EXISTS embeddings (\n    key TEXT NOT NULL,\n    namespace TEXT NOT NULL,\n    vector BLOB NOT NULL,\n    dimension INTEGER NOT NULL,\n    text TEXT NOT NULL,\n    timestamp INTEGER NOT NULL,\n    quantization TEXT NOT NULL,\n    metadata TEXT,\n    access_count INTEGER DEFAULT 1,\n    last_access INTEGER NOT NULL,\n    PRIMARY KEY (key, namespace)\n  );\n\n  -- Execution results table (unified from plan-executor.ts)\n  CREATE TABLE IF NOT EXISTS execution_results (\n    id TEXT PRIMARY KEY,\n    plan_id TEXT NOT NULL,\n    status TEXT NOT NULL,\n    steps_completed INTEGER DEFAULT 0,\n    steps_failed INTEGER DEFAULT 0,\n    total_duration_ms INTEGER DEFAULT 0,\n    final_world_state TEXT,\n    error_message TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- Executed steps table (unified from plan-executor.ts)\n  CREATE TABLE IF NOT EXISTS executed_steps (\n    id TEXT PRIMARY KEY,\n    execution_id TEXT NOT NULL,\n    plan_id TEXT NOT NULL,\n    action_id TEXT NOT NULL,\n    step_order INTEGER NOT NULL,\n    status TEXT NOT NULL,\n    retries INTEGER DEFAULT 0,\n    started_at TEXT NOT NULL,\n    completed_at TEXT,\n    duration_ms INTEGER,\n    agent_id TEXT,\n    agent_output TEXT,\n    world_state_before TEXT,\n    world_state_after TEXT,\n    error_message TEXT,\n    FOREIGN KEY (execution_id) REFERENCES execution_results(id)\n  );\n\n  -- QE Patterns indexes\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_domain ON qe_patterns(qe_domain);\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_type ON qe_patterns(pattern_type);\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_tier ON qe_patterns(tier);\n  CREATE INDEX IF NOT EXISTS idx_qe_patterns_quality ON qe_patterns(quality_score DESC);\n  CREATE INDEX IF NOT EXISTS idx_qe_usage_pattern ON qe_pattern_usage(pattern_id);\n  CREATE INDEX IF NOT EXISTS idx_qe_trajectories_domain ON qe_trajectories(domain);\n  CREATE INDEX IF NOT EXISTS idx_embeddings_namespace ON embeddings(namespace);\n  CREATE INDEX IF NOT EXISTS idx_embeddings_timestamp ON embeddings(timestamp);\n  CREATE INDEX IF NOT EXISTS idx_execution_results_plan ON execution_results(plan_id);\n  CREATE INDEX IF NOT EXISTS idx_execution_results_status ON execution_results(status);\n  CREATE INDEX IF NOT EXISTS idx_executed_steps_execution ON executed_steps(execution_id);\n  CREATE INDEX IF NOT EXISTS idx_executed_steps_action ON executed_steps(action_id);\n";
+export declare const MINCUT_SCHEMA = "\n  -- MinCut Graph Snapshots (ADR-047)\n  CREATE TABLE IF NOT EXISTS mincut_snapshots (\n    id TEXT PRIMARY KEY,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    vertex_count INTEGER NOT NULL,\n    edge_count INTEGER NOT NULL,\n    total_weight REAL NOT NULL DEFAULT 0.0,\n    is_connected INTEGER NOT NULL DEFAULT 1,\n    component_count INTEGER NOT NULL DEFAULT 1,\n    vertices_json TEXT NOT NULL,\n    edges_json TEXT NOT NULL,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- MinCut History (time-series MinCut values)\n  CREATE TABLE IF NOT EXISTS mincut_history (\n    id INTEGER PRIMARY KEY AUTOINCREMENT,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    mincut_value REAL NOT NULL,\n    vertex_count INTEGER NOT NULL,\n    edge_count INTEGER NOT NULL,\n    algorithm TEXT NOT NULL DEFAULT 'weighted-degree',\n    duration_ms INTEGER,\n    snapshot_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Weak Vertices (detected bottlenecks)\n  CREATE TABLE IF NOT EXISTS mincut_weak_vertices (\n    id TEXT PRIMARY KEY,\n    vertex_id TEXT NOT NULL,\n    weighted_degree REAL NOT NULL,\n    risk_score REAL NOT NULL,\n    reason TEXT NOT NULL,\n    domain TEXT,\n    vertex_type TEXT NOT NULL,\n    suggestions_json TEXT,\n    detected_at TEXT NOT NULL DEFAULT (datetime('now')),\n    resolved_at TEXT,\n    snapshot_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Alerts\n  CREATE TABLE IF NOT EXISTS mincut_alerts (\n    id TEXT PRIMARY KEY,\n    severity TEXT NOT NULL,\n    message TEXT NOT NULL,\n    mincut_value REAL NOT NULL,\n    threshold REAL NOT NULL,\n    affected_vertices_json TEXT,\n    remediations_json TEXT,\n    acknowledged INTEGER DEFAULT 0,\n    acknowledged_at TEXT,\n    acknowledged_by TEXT,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n\n  -- MinCut Healing Actions (self-healing history)\n  CREATE TABLE IF NOT EXISTS mincut_healing_actions (\n    id TEXT PRIMARY KEY,\n    action_type TEXT NOT NULL,\n    action_params_json TEXT NOT NULL,\n    success INTEGER NOT NULL,\n    mincut_before REAL NOT NULL,\n    mincut_after REAL NOT NULL,\n    improvement REAL NOT NULL DEFAULT 0.0,\n    error_message TEXT,\n    duration_ms INTEGER NOT NULL,\n    triggered_by TEXT,\n    snapshot_before_id TEXT,\n    snapshot_after_id TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_before_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL,\n    FOREIGN KEY (snapshot_after_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Strange Loop Observations (P1: self-organizing)\n  CREATE TABLE IF NOT EXISTS mincut_observations (\n    id TEXT PRIMARY KEY,\n    iteration INTEGER NOT NULL,\n    mincut_value REAL NOT NULL,\n    weak_vertex_count INTEGER NOT NULL DEFAULT 0,\n    weak_vertices_json TEXT,\n    snapshot_id TEXT,\n    prediction_json TEXT,\n    actual_vs_predicted_diff REAL,\n    timestamp TEXT NOT NULL DEFAULT (datetime('now')),\n    FOREIGN KEY (snapshot_id) REFERENCES mincut_snapshots(id) ON DELETE SET NULL\n  );\n\n  -- MinCut Indexes\n  CREATE INDEX IF NOT EXISTS idx_mincut_history_timestamp ON mincut_history(timestamp DESC);\n  CREATE INDEX IF NOT EXISTS idx_mincut_history_value ON mincut_history(mincut_value);\n  CREATE INDEX IF NOT EXISTS idx_mincut_weak_vertex ON mincut_weak_vertices(vertex_id);\n  CREATE INDEX IF NOT EXISTS idx_mincut_weak_risk ON mincut_weak_vertices(risk_score DESC);\n  CREATE INDEX IF NOT EXISTS idx_mincut_weak_resolved ON mincut_weak_vertices(resolved_at);\n  CREATE INDEX IF NOT EXISTS idx_mincut_alerts_severity ON mincut_alerts(severity);\n  CREATE INDEX IF NOT EXISTS idx_mincut_alerts_ack ON mincut_alerts(acknowledged);\n  CREATE INDEX IF NOT EXISTS idx_mincut_healing_type ON mincut_healing_actions(action_type);\n  CREATE INDEX IF NOT EXISTS idx_mincut_healing_success ON mincut_healing_actions(success);\n  CREATE INDEX IF NOT EXISTS idx_mincut_observations_iter ON mincut_observations(iteration);\n";
+export declare const SONA_PATTERNS_SCHEMA = "\n  -- SONA Patterns table (ADR-046: Pattern Persistence for Neural Backbone)\n  CREATE TABLE IF NOT EXISTS sona_patterns (\n    id TEXT PRIMARY KEY,\n    type TEXT NOT NULL,\n    domain TEXT NOT NULL,\n    state_embedding BLOB,\n    action_embedding BLOB,\n    action_type TEXT NOT NULL,\n    action_value TEXT,\n    outcome_reward REAL NOT NULL DEFAULT 0.0,\n    outcome_success INTEGER NOT NULL DEFAULT 0,\n    outcome_quality REAL NOT NULL DEFAULT 0.0,\n    confidence REAL DEFAULT 0.5,\n    usage_count INTEGER DEFAULT 0,\n    success_count INTEGER DEFAULT 0,\n    failure_count INTEGER DEFAULT 0,\n    metadata TEXT,\n    created_at TEXT DEFAULT (datetime('now')),\n    updated_at TEXT DEFAULT (datetime('now')),\n    last_used_at TEXT\n  );\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_type ON sona_patterns(type);\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_domain ON sona_patterns(domain);\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_confidence ON sona_patterns(confidence DESC);\n  CREATE INDEX IF NOT EXISTS idx_sona_patterns_updated ON sona_patterns(updated_at DESC);\n";
+export declare const FEEDBACK_SCHEMA = "\n  -- Test outcomes (ADR-023: Quality Feedback Loop)\n  CREATE TABLE IF NOT EXISTS test_outcomes (\n    id TEXT PRIMARY KEY,\n    test_id TEXT NOT NULL,\n    test_name TEXT NOT NULL,\n    generated_by TEXT NOT NULL,\n    pattern_id TEXT,\n    framework TEXT NOT NULL,\n    language TEXT NOT NULL,\n    domain TEXT NOT NULL,\n    passed INTEGER NOT NULL,\n    error_message TEXT,\n    coverage_lines REAL DEFAULT 0,\n    coverage_branches REAL DEFAULT 0,\n    coverage_functions REAL DEFAULT 0,\n    mutation_score REAL,\n    execution_time_ms REAL NOT NULL,\n    flaky INTEGER DEFAULT 0,\n    flakiness_score REAL,\n    maintainability_score REAL NOT NULL,\n    complexity REAL,\n    lines_of_code INTEGER,\n    assertion_count INTEGER,\n    file_path TEXT,\n    source_file_path TEXT,\n    metadata_json TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n  CREATE INDEX IF NOT EXISTS idx_test_outcomes_pattern ON test_outcomes(pattern_id);\n  CREATE INDEX IF NOT EXISTS idx_test_outcomes_agent ON test_outcomes(generated_by);\n  CREATE INDEX IF NOT EXISTS idx_test_outcomes_domain ON test_outcomes(domain);\n  CREATE INDEX IF NOT EXISTS idx_test_outcomes_created ON test_outcomes(created_at);\n\n  -- Routing outcomes (ADR-022: Adaptive QE Agent Routing)\n  CREATE TABLE IF NOT EXISTS routing_outcomes (\n    id TEXT PRIMARY KEY,\n    task_json TEXT NOT NULL,\n    decision_json TEXT NOT NULL,\n    used_agent TEXT NOT NULL,\n    followed_recommendation INTEGER NOT NULL,\n    success INTEGER NOT NULL,\n    quality_score REAL NOT NULL,\n    duration_ms REAL NOT NULL,\n    error TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n  CREATE INDEX IF NOT EXISTS idx_routing_outcomes_agent ON routing_outcomes(used_agent);\n  CREATE INDEX IF NOT EXISTS idx_routing_outcomes_created ON routing_outcomes(created_at);\n\n  -- Coverage sessions (ADR-023: Coverage Learning)\n  CREATE TABLE IF NOT EXISTS coverage_sessions (\n    id TEXT PRIMARY KEY,\n    target_path TEXT NOT NULL,\n    agent_id TEXT NOT NULL,\n    technique TEXT NOT NULL,\n    before_lines REAL DEFAULT 0,\n    before_branches REAL DEFAULT 0,\n    before_functions REAL DEFAULT 0,\n    after_lines REAL DEFAULT 0,\n    after_branches REAL DEFAULT 0,\n    after_functions REAL DEFAULT 0,\n    tests_generated INTEGER DEFAULT 0,\n    tests_passed INTEGER DEFAULT 0,\n    gaps_json TEXT,\n    duration_ms REAL NOT NULL,\n    started_at TEXT NOT NULL,\n    completed_at TEXT NOT NULL,\n    context_json TEXT,\n    created_at TEXT DEFAULT (datetime('now'))\n  );\n  CREATE INDEX IF NOT EXISTS idx_coverage_sessions_technique ON coverage_sessions(technique);\n  CREATE INDEX IF NOT EXISTS idx_coverage_sessions_agent ON coverage_sessions(agent_id);\n  CREATE INDEX IF NOT EXISTS idx_coverage_sessions_created ON coverage_sessions(created_at);\n";
+export declare const STATS_TABLES: string[];
+//# sourceMappingURL=unified-memory-schemas.d.ts.map

package/v3/dist/kernel/unified-memory-schemas.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"unified-memory-schemas.d.ts","sourceRoot":"","sources":["../../src/kernel/unified-memory-schemas.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,iBAAiB,EAAE,MAAM,iDAAiD,CAAC;AAGpF,OAAO,EAAE,iBAAiB,EAAE,CAAC;AAM7B,eAAO,MAAM,cAAc,IAAI,CAAC;AAEhC,eAAO,MAAM,oBAAoB,uLAMhC,CAAC;AAMF,eAAO,MAAM,eAAe,gfAY3B,CAAC;AAEF,eAAO,MAAM,cAAc,2gBAa1B,CAAC;AAEF,eAAO,MAAM,iBAAiB,44BAqB7B,CAAC;AAEF,eAAO,MAAM,WAAW,0hEAkEvB,CAAC;AAEF,eAAO,MAAM,YAAY,+9EAqExB,CAAC;AAEF,eAAO,MAAM,kBAAkB,y6IA6H9B,CAAC;AAEF,eAAO,MAAM,aAAa,2qIA0GzB,CAAC;AAEF,eAAO,MAAM,oBAAoB,ykCA0BhC,CAAC;AAEF,eAAO,MAAM,eAAe,ywFA0E3B,CAAC;AAMF,eAAO,MAAM,YAAY,UAgCxB,CAAC"}