@hivehub/rulebook 2.0.0 → 3.0.0

package/dist/memory/hnsw-index.js

@@ -0,0 +1,421 @@
+/**
+ * Pure TypeScript HNSW (Hierarchical Navigable Small World) Index
+ *
+ * Approximate nearest neighbor search using cosine distance.
+ * Zero native dependencies. Designed for <50K vectors.
+ */
+const MAGIC_NUMBER = 0x484e5357; // 'HNSW'
+const FORMAT_VERSION = 1;
+export class HNSWIndex {
+    M;
+    efConstruction;
+    dimensions;
+    mL; // normalization factor for layer assignment
+    nodes = new Map();
+    entryPoint = null;
+    maxLayer = 0;
+    constructor(config) {
+        this.M = config.M ?? 16;
+        this.efConstruction = config.efConstruction ?? 200;
+        this.dimensions = config.dimensions;
+        this.mL = 1 / Math.log(this.M);
+    }
+    get size() {
+        return this.nodes.size;
+    }
+    /**
+     * Cosine distance: 1 - cosine_similarity (0 = identical, 2 = opposite)
+     */
+    cosineDistance(a, b) {
+        let dot = 0;
+        let magA = 0;
+        let magB = 0;
+        for (let i = 0; i < a.length; i++) {
+            dot += a[i] * b[i];
+            magA += a[i] * a[i];
+            magB += b[i] * b[i];
+        }
+        const denom = Math.sqrt(magA) * Math.sqrt(magB);
+        if (denom === 0)
+            return 1;
+        return 1 - dot / denom;
+    }
+    /**
+     * Assign a random layer for a new node
+     */
+    randomLayer() {
+        return Math.floor(-Math.log(Math.random()) * this.mL);
+    }
+    /**
+     * Greedy search at a single layer, returning ef nearest candidates
+     */
+    searchLayer(query, entryLabel, ef, layer) {
+        const visited = new Set();
+        const candidates = [];
+        const results = [];
+        const entryNode = this.nodes.get(entryLabel);
+        if (!entryNode)
+            return [];
+        const entryDist = this.cosineDistance(query, entryNode.vector);
+        candidates.push({ label: entryLabel, distance: entryDist });
+        results.push({ label: entryLabel, distance: entryDist });
+        visited.add(entryLabel);
+        while (candidates.length > 0) {
+            // Get closest candidate
+            candidates.sort((a, b) => a.distance - b.distance);
+            const current = candidates.shift();
+            // Get farthest result
+            results.sort((a, b) => a.distance - b.distance);
+            const farthest = results[results.length - 1];
+            if (current.distance > farthest.distance)
+                break;
+            const currentNode = this.nodes.get(current.label);
+            if (!currentNode)
+                continue;
+            const connections = currentNode.connections.get(layer);
+            if (!connections)
+                continue;
+            for (const neighborLabel of connections) {
+                if (visited.has(neighborLabel))
+                    continue;
+                visited.add(neighborLabel);
+                const neighborNode = this.nodes.get(neighborLabel);
+                if (!neighborNode)
+                    continue;
+                const dist = this.cosineDistance(query, neighborNode.vector);
+                results.sort((a, b) => a.distance - b.distance);
+                const currentFarthest = results[results.length - 1];
+                if (results.length < ef || dist < currentFarthest.distance) {
+                    candidates.push({ label: neighborLabel, distance: dist });
+                    results.push({ label: neighborLabel, distance: dist });
+                    if (results.length > ef) {
+                        results.sort((a, b) => a.distance - b.distance);
+                        results.pop();
+                    }
+                }
+            }
+        }
+        results.sort((a, b) => a.distance - b.distance);
+        return results;
+    }
+    /**
+     * Select M nearest neighbors from candidates, pruning for diversity
+     */
+    selectNeighbors(candidates, M) {
+        candidates.sort((a, b) => a.distance - b.distance);
+        return candidates.slice(0, M);
+    }
+    /**
+     * Add a vector to the index
+     */
+    add(label, vector) {
+        if (vector.length !== this.dimensions) {
+            throw new Error(`Vector dimensions mismatch: expected ${this.dimensions}, got ${vector.length}`);
+        }
+        // If label already exists, remove first
+        if (this.nodes.has(label)) {
+            this.remove(label);
+        }
+        const nodeLayer = this.randomLayer();
+        const node = {
+            label,
+            vector: new Float32Array(vector),
+            connections: new Map(),
+            layer: nodeLayer,
+        };
+        // Initialize connection sets for all layers
+        for (let l = 0; l <= nodeLayer; l++) {
+            node.connections.set(l, new Set());
+        }
+        this.nodes.set(label, node);
+        if (this.entryPoint === null) {
+            this.entryPoint = label;
+            this.maxLayer = nodeLayer;
+            return;
+        }
+        let currentLabel = this.entryPoint;
+        // Traverse from top layer to nodeLayer + 1 (greedy, single nearest)
+        for (let l = this.maxLayer; l > nodeLayer; l--) {
+            const results = this.searchLayer(vector, currentLabel, 1, l);
+            if (results.length > 0) {
+                currentLabel = results[0].label;
+            }
+        }
+        // Insert at layers nodeLayer down to 0
+        for (let l = Math.min(nodeLayer, this.maxLayer); l >= 0; l--) {
+            const candidates = this.searchLayer(vector, currentLabel, this.efConstruction, l);
+            const neighbors = this.selectNeighbors(candidates, this.M);
+            for (const neighbor of neighbors) {
+                // Bidirectional connections
+                node.connections.get(l).add(neighbor.label);
+                const neighborNode = this.nodes.get(neighbor.label);
+                if (neighborNode) {
+                    if (!neighborNode.connections.has(l)) {
+                        neighborNode.connections.set(l, new Set());
+                    }
+                    neighborNode.connections.get(l).add(label);
+                    // Prune neighbor connections if exceeding M
+                    const neighborConns = neighborNode.connections.get(l);
+                    if (neighborConns.size > this.M * 2) {
+                        const allCandidates = [];
+                        for (const connLabel of neighborConns) {
+                            if (connLabel === label)
+                                continue;
+                            const connNode = this.nodes.get(connLabel);
+                            if (connNode) {
+                                allCandidates.push({
+                                    label: connLabel,
+                                    distance: this.cosineDistance(neighborNode.vector, connNode.vector),
+                                });
+                            }
+                        }
+                        const kept = this.selectNeighbors(allCandidates, this.M * 2);
+                        neighborConns.clear();
+                        neighborConns.add(label); // always keep the new connection
+                        for (const k of kept) {
+                            neighborConns.add(k.label);
+                        }
+                    }
+                }
+            }
+            if (candidates.length > 0) {
+                currentLabel = candidates[0].label;
+            }
+        }
+        // Update entry point if new node has higher layer
+        if (nodeLayer > this.maxLayer) {
+            this.entryPoint = label;
+            this.maxLayer = nodeLayer;
+        }
+    }
+    /**
+     * Search k nearest neighbors
+     */
+    search(query, k, ef) {
+        if (this.entryPoint === null || this.nodes.size === 0) {
+            return [];
+        }
+        if (query.length !== this.dimensions) {
+            throw new Error(`Query dimensions mismatch: expected ${this.dimensions}, got ${query.length}`);
+        }
+        const searchEf = Math.max(ef ?? 50, k);
+        let currentLabel = this.entryPoint;
+        // Traverse from top layer to layer 1 (greedy, single nearest)
+        for (let l = this.maxLayer; l > 0; l--) {
+            const results = this.searchLayer(query, currentLabel, 1, l);
+            if (results.length > 0) {
+                currentLabel = results[0].label;
+            }
+        }
+        // Search at layer 0 with ef candidates
+        const candidates = this.searchLayer(query, currentLabel, searchEf, 0);
+        return candidates.slice(0, k);
+    }
+    /**
+     * Remove a vector from the index
+     */
+    remove(label) {
+        const node = this.nodes.get(label);
+        if (!node)
+            return;
+        // Remove all connections to this node
+        for (const [layer, connections] of node.connections) {
+            for (const neighborLabel of connections) {
+                const neighborNode = this.nodes.get(neighborLabel);
+                if (neighborNode) {
+                    const neighborConns = neighborNode.connections.get(layer);
+                    if (neighborConns) {
+                        neighborConns.delete(label);
+                    }
+                }
+            }
+        }
+        this.nodes.delete(label);
+        // Update entry point if needed
+        if (this.entryPoint === label) {
+            if (this.nodes.size === 0) {
+                this.entryPoint = null;
+                this.maxLayer = 0;
+            }
+            else {
+                // Find node with highest layer
+                let bestLabel = '';
+                let bestLayer = -1;
+                for (const [l, n] of this.nodes) {
+                    if (n.layer > bestLayer) {
+                        bestLayer = n.layer;
+                        bestLabel = l;
+                    }
+                }
+                this.entryPoint = bestLabel;
+                this.maxLayer = bestLayer;
+            }
+        }
+    }
+    /**
+     * Serialize the index to an ArrayBuffer for disk persistence
+     * Format: [magic:u32][version:u8][dimensions:u32][M:u16][nodeCount:u32][...nodes]
+     */
+    serialize() {
+        const nodeEntries = Array.from(this.nodes.entries());
+        const labelToIndex = new Map();
+        nodeEntries.forEach(([label], i) => labelToIndex.set(label, i));
+        // Calculate buffer size
+        let size = 4 + 1 + 4 + 2 + 4; // header
+        size += 4; // entryPointIndex
+        size += 4; // maxLayer
+        for (const [, node] of nodeEntries) {
+            const labelBytes = new TextEncoder().encode(node.label);
+            size += 2 + labelBytes.length; // label length + label
+            size += this.dimensions * 4; // vector (float32)
+            size += 4; // node layer
+            size += 4; // connection layer count
+            for (const [, connections] of node.connections) {
+                size += 4; // layer number
+                size += 4; // connection count
+                size += connections.size * 4; // neighbor indices (u32)
+            }
+        }
+        const buffer = new ArrayBuffer(size);
+        const view = new DataView(buffer);
+        let offset = 0;
+        // Header
+        view.setUint32(offset, MAGIC_NUMBER, true);
+        offset += 4;
+        view.setUint8(offset, FORMAT_VERSION);
+        offset += 1;
+        view.setUint32(offset, this.dimensions, true);
+        offset += 4;
+        view.setUint16(offset, this.M, true);
+        offset += 2;
+        view.setUint32(offset, nodeEntries.length, true);
+        offset += 4;
+        view.setInt32(offset, this.entryPoint ? labelToIndex.get(this.entryPoint) : -1, true);
+        offset += 4;
+        view.setUint32(offset, this.maxLayer, true);
+        offset += 4;
+        // Nodes
+        const encoder = new TextEncoder();
+        for (const [, node] of nodeEntries) {
+            const labelBytes = encoder.encode(node.label);
+            view.setUint16(offset, labelBytes.length, true);
+            offset += 2;
+            new Uint8Array(buffer, offset, labelBytes.length).set(labelBytes);
+            offset += labelBytes.length;
+            // Vector
+            for (let i = 0; i < this.dimensions; i++) {
+                view.setFloat32(offset, node.vector[i], true);
+                offset += 4;
+            }
+            // Layer
+            view.setUint32(offset, node.layer, true);
+            offset += 4;
+            // Connections
+            const layerCount = node.connections.size;
+            view.setUint32(offset, layerCount, true);
+            offset += 4;
+            for (const [layer, connections] of node.connections) {
+                view.setUint32(offset, layer, true);
+                offset += 4;
+                view.setUint32(offset, connections.size, true);
+                offset += 4;
+                for (const neighborLabel of connections) {
+                    const idx = labelToIndex.get(neighborLabel);
+                    view.setUint32(offset, idx ?? 0, true);
+                    offset += 4;
+                }
+            }
+        }
+        return buffer;
+    }
+    /**
+     * Deserialize an index from an ArrayBuffer
+     */
+    static deserialize(buffer) {
+        const view = new DataView(buffer);
+        let offset = 0;
+        const decoder = new TextDecoder();
+        // Header
+        const magic = view.getUint32(offset, true);
+        offset += 4;
+        if (magic !== MAGIC_NUMBER) {
+            throw new Error('Invalid HNSW index file');
+        }
+        const version = view.getUint8(offset);
+        offset += 1;
+        if (version !== FORMAT_VERSION) {
+            throw new Error(`Unsupported HNSW format version: ${version}`);
+        }
+        const dimensions = view.getUint32(offset, true);
+        offset += 4;
+        const M = view.getUint16(offset, true);
+        offset += 2;
+        const nodeCount = view.getUint32(offset, true);
+        offset += 4;
+        const entryPointIndex = view.getInt32(offset, true);
+        offset += 4;
+        const maxLayer = view.getUint32(offset, true);
+        offset += 4;
+        const index = new HNSWIndex({ dimensions, M });
+        index.maxLayer = maxLayer;
+        // Read all nodes first (labels + vectors + layers)
+        const labels = [];
+        const nodeData = [];
+        for (let n = 0; n < nodeCount; n++) {
+            const labelLen = view.getUint16(offset, true);
+            offset += 2;
+            const labelBytes = new Uint8Array(buffer, offset, labelLen);
+            const label = decoder.decode(labelBytes);
+            offset += labelLen;
+            labels.push(label);
+            const vector = new Float32Array(dimensions);
+            for (let i = 0; i < dimensions; i++) {
+                vector[i] = view.getFloat32(offset, true);
+                offset += 4;
+            }
+            const layer = view.getUint32(offset, true);
+            offset += 4;
+            const layerCount = view.getUint32(offset, true);
+            offset += 4;
+            const connectionLayers = [];
+            for (let lc = 0; lc < layerCount; lc++) {
+                const connLayer = view.getUint32(offset, true);
+                offset += 4;
+                const connCount = view.getUint32(offset, true);
+                offset += 4;
+                const neighborIndices = [];
+                for (let c = 0; c < connCount; c++) {
+                    neighborIndices.push(view.getUint32(offset, true));
+                    offset += 4;
+                }
+                connectionLayers.push({ layer: connLayer, neighborIndices });
+            }
+            nodeData.push({ label, vector, layer, connectionLayers });
+        }
+        // Reconstruct nodes with proper connections
+        for (const data of nodeData) {
+            const connections = new Map();
+            for (const cl of data.connectionLayers) {
+                const neighbors = new Set();
+                for (const idx of cl.neighborIndices) {
+                    if (idx < labels.length) {
+                        neighbors.add(labels[idx]);
+                    }
+                }
+                connections.set(cl.layer, neighbors);
+            }
+            const node = {
+                label: data.label,
+                vector: data.vector,
+                connections,
+                layer: data.layer,
+            };
+            index.nodes.set(data.label, node);
+        }
+        if (entryPointIndex >= 0 && entryPointIndex < labels.length) {
+            index.entryPoint = labels[entryPointIndex];
+        }
+        return index;
+    }
+}
+//# sourceMappingURL=hnsw-index.js.map

package/dist/memory/hnsw-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"hnsw-index.js","sourceRoot":"","sources":["../../src/memory/hnsw-index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAoBH,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,SAAS;AAC1C,MAAM,cAAc,GAAG,CAAC,CAAC;AAEzB,MAAM,OAAO,SAAS;IACH,CAAC,CAAS;IACV,cAAc,CAAS;IACvB,UAAU,CAAS;IACnB,EAAE,CAAS,CAAC,4CAA4C;IACjE,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;IACzC,UAAU,GAAkB,IAAI,CAAC;IACjC,QAAQ,GAAG,CAAC,CAAC;IAErB,YAAY,MAAkB;QAC5B,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,cAAc,GAAG,MAAM,CAAC,cAAc,IAAI,GAAG,CAAC;QACnD,IAAI,CAAC,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC;QACpC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,CAAe,EAAE,CAAe;QACrD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACnB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtB,CAAC;QAED,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAE1B,OAAO,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,WAAW;QACjB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC;IACxD,CAAC;IAED;;OAEG;IACK,WAAW,CACjB,KAAmB,EACnB,UAAkB,EAClB,EAAU,EACV,KAAa;QAEb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,UAAU,GAAsB,EAAE,CAAC;QACzC,MAAM,OAAO,GAAsB,EAAE,CAAC;QAEtC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC7C,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,CAAC;QAE1B,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAC/D,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC;QAC5D,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,SAAS,EAAE,CAAC,CAAC;QACzD,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAExB,OAAO,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,wBAAwB;YACxB,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAG,CAAC;YAEpC,sBAAsB;YACtB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;YAChD,MAAM,QAAQ,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;YAE7C,IAAI,OAAO,CAAC,QAAQ,GAAG,QAAQ,CAAC,QAAQ;gBAAE,MAAM;YAEhD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;YAClD,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,MAAM,WAAW,GAAG,WAAW,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YACvD,IAAI,CAAC,WAAW;gBAAE,SAAS;YAE3B,KAAK,MAAM,aAAa,IAAI,WAAW,EAAE,CAAC;gBACxC,IAAI,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC;oBAAE,SAAS;gBACzC,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBAE3B,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBACnD,IAAI,CAAC,YAAY;oBAAE,SAAS;gBAE5B,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAE,YAAY,CAAC,MAAM,CAAC,CAAC;gBAE7D,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;gBAChD,MAAM,eAAe,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAEpD,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,IAAI,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,CAAC;oBAC3D,UAAU,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;oBAC1D,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC;oBAEvD,IAAI,OAAO,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC;wBACxB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;wBAChD,OAAO,CAAC,GAAG,EAAE,CAAC;oBAChB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QAChD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,eAAe,CACrB,UAA6B,EAC7B,CAAS;QAET,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;QACnD,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,KAAa,EAAE,MAAoB;QACrC,IAAI,MAAM,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CACb,wCAAwC,IAAI,CAAC,UAAU,SAAS,MAAM,CAAC,MAAM,EAAE,CAChF,CAAC;QACJ,CAAC;QAED,wCAAwC;QACxC,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,MAAM,IAAI,GAAa;YACrB,KAAK;YACL,MAAM,EAAE,IAAI,YAAY,CAAC,MAAM,CAAC;YAChC,WAAW,EAAE,IAAI,GAAG,EAAE;YACtB,KAAK,EAAE,SAAS;SACjB,CAAC;QAEF,4CAA4C;QAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACpC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE5B,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7B,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC1B,OAAO;QACT,CAAC;QAED,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,oEAAoE;QACpE,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/C,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAClC,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CACjC,MAAM,EACN,YAAY,EACZ,IAAI,CAAC,cAAc,EACnB,CAAC,CACF,CAAC;YAEF,MAAM,SAAS,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YAE3D,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,4BAA4B;gBAC5B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAE7C,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBACpD,IAAI,YAAY,EAAE,CAAC;oBACjB,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBACrC,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;oBAC7C,CAAC;oBACD,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAE5C,4CAA4C;oBAC5C,MAAM,aAAa,GAAG,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;oBACvD,IAAI,aAAa,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC;wBACpC,MAAM,aAAa,GAAsB,EAAE,CAAC;wBAC5C,KAAK,MAAM,SAAS,IAAI,aAAa,EAAE,CAAC;4BACtC,IAAI,SAAS,KAAK,KAAK;gCAAE,SAAS;4BAClC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;4BAC3C,IAAI,QAAQ,EAAE,CAAC;gCACb,aAAa,CAAC,IAAI,CAAC;oCACjB,KAAK,EAAE,SAAS;oCAChB,QAAQ,EAAE,IAAI,CAAC,cAAc,CAAC,YAAY,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC;iCACpE,CAAC,CAAC;4BACL,CAAC;wBACH,CAAC;wBACD,MAAM,IAAI,GAAG,IAAI,CAAC,eAAe,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;wBAC7D,aAAa,CAAC,KAAK,EAAE,CAAC;wBACtB,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,iCAAiC;wBAC3D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;4BACrB,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;wBAC7B,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1B,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YACrC,CAAC;QACH,CAAC;QAED,kDAAkD;QAClD,IAAI,SAAS,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;QAC5B,CAAC;IACH,CAAC;IAED;;OAEG;IACH,MAAM,CACJ,KAAmB,EACnB,CAAS,EACT,EAAW;QAEX,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YACtD,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,KAAK,CAAC,MAAM,KAAK,IAAI,CAAC,UAAU,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CACb,uCAAuC,IAAI,CAAC,UAAU,SAAS,KAAK,CAAC,MAAM,EAAE,CAC9E,CAAC;QACJ,CAAC;QAED,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;QACvC,IAAI,YAAY,GAAG,IAAI,CAAC,UAAU,CAAC;QAEnC,8DAA8D;QAC9D,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YAC5D,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,YAAY,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;YAClC,CAAC;QACH,CAAC;QAED,uCAAuC;QACvC,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAEtE,OAAO,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,KAAa;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,CAAC,IAAI;YAAE,OAAO;QAElB,sCAAsC;QACtC,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;YACpD,KAAK,MAAM,aAAa,IAAI,WAAW,EAAE,CAAC;gBACxC,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;gBACnD,IAAI,YAAY,EAAE,CAAC;oBACjB,MAAM,aAAa,GAAG,YAAY,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;oBAC1D,IAAI,aAAa,EAAE,CAAC;wBAClB,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;oBAC9B,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEzB,+BAA+B;QAC/B,IAAI,IAAI,CAAC,UAAU,KAAK,KAAK,EAAE,CAAC;YAC9B,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC1B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;gBACvB,IAAI,CAAC,QAAQ,GAAG,CAAC,CAAC;YACpB,CAAC;iBAAM,CAAC;gBACN,+BAA+B;gBAC/B,IAAI,SAAS,GAAG,EAAE,CAAC;gBACnB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;gBACnB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;oBAChC,IAAI,CAAC,CAAC,KAAK,GAAG,SAAS,EAAE,CAAC;wBACxB,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC;wBACpB,SAAS,GAAG,CAAC,CAAC;oBAChB,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;gBAC5B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,SAAS;QACP,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC;QACrD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;QAC/C,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QAEhE,wBAAwB;QACxB,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS;QACvC,IAAI,IAAI,CAAC,CAAC,CAAC,kBAAkB;QAC7B,IAAI,IAAI,CAAC,CAAC,CAAC,WAAW;QAEtB,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,IAAI,WAAW,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxD,IAAI,IAAI,CAAC,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,uBAAuB;YACtD,IAAI,IAAI,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAChD,IAAI,IAAI,CAAC,CAAC,CAAC,aAAa;YACxB,IAAI,IAAI,CAAC,CAAC,CAAC,yBAAyB;YACpC,KAAK,MAAM,CAAC,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBAC/C,IAAI,IAAI,CAAC,CAAC,CAAC,eAAe;gBAC1B,IAAI,IAAI,CAAC,CAAC,CAAC,mBAAmB;gBAC9B,IAAI,IAAI,WAAW,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,yBAAyB;YACzD,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,SAAS;QACT,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAC3D,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAClD,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAC9D,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACpG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAEzD,QAAQ;QACR,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAClC,KAAK,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;YACnC,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9C,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAAC,MAAM,IAAI,CAAC,CAAC;YAC7D,IAAI,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAAC,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC;YAE/F,SAAS;YACT,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAM,IAAI,CAAC,CAAC;YAC7D,CAAC;YAED,QAAQ;YACR,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAAC,MAAM,IAAI,CAAC,CAAC;YAEtD,cAAc;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;YACzC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YAAC,MAAM,IAAI,CAAC,CAAC;YACtD,KAAK,MAAM,CAAC,KAAK,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;gBACpD,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAM,IAAI,CAAC,CAAC;gBACjD,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAM,IAAI,CAAC,CAAC;gBAC5D,KAAK,MAAM,aAAa,IAAI,WAAW,EAAE,CAAC;oBACxC,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;oBAC5C,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;oBAAC,MAAM,IAAI,CAAC,CAAC;gBACtD,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,MAAmB;QACpC,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,OAAO,GAAG,IAAI,WAAW,EAAE,CAAC;QAElC,SAAS;QACT,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACxD,IAAI,KAAK,KAAK,YAAY,EAAE,CAAC;YAC3B,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;QAC7C,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACnD,IAAI,OAAO,KAAK,cAAc,EAAE,CAAC;YAC/B,MAAM,IAAI,KAAK,CAAC,oCAAoC,OAAO,EAAE,CAAC,CAAC;QACjE,CAAC;QACD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAC7D,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACpD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAC5D,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QACjE,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAAC,MAAM,IAAI,CAAC,CAAC;QAE3D,MAAM,KAAK,GAAG,IAAI,SAAS,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,CAAC;QAC/C,KAAK,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAE1B,mDAAmD;QACnD,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAKT,EAAE,CAAC;QAER,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAAC,MAAM,IAAI,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC5D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAAC,MAAM,IAAI,QAAQ,CAAC;YAC7D,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAEnB,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,UAAU,CAAC,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;gBACpC,MAAM,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAM,IAAI,CAAC,CAAC;YACzD,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAAC,MAAM,IAAI,CAAC,CAAC;YACxD,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAAC,MAAM,IAAI,CAAC,CAAC;YAC7D,MAAM,gBAAgB,GAGjB,EAAE,CAAC;YAER,KAAK,IAAI,EAAE,GAAG,CAAC,EAAE,EAAE,GAAG,UAAU,EAAE,EAAE,EAAE,EAAE,CAAC;gBACvC,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAM,IAAI,CAAC,CAAC;gBAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAAC,MAAM,IAAI,CAAC,CAAC;gBAC5D,MAAM,eAAe,GAAa,EAAE,CAAC;gBACrC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;oBACnC,eAAe,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;oBAAC,MAAM,IAAI,CAAC,CAAC;gBAClE,CAAC;gBACD,gBAAgB,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,eAAe,EAAE,CAAC,CAAC;YAC/D,CAAC;YAED,QAAQ,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;QAC5D,CAAC;QAED,4CAA4C;QAC5C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;YACnD,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,gBAAgB,EAAE,CAAC;gBACvC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;gBACpC,KAAK,MAAM,GAAG,IAAI,EAAE,CAAC,eAAe,EAAE,CAAC;oBACrC,IAAI,GAAG,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;wBACxB,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;oBAC7B,CAAC;gBACH,CAAC;gBACD,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;YACvC,CAAC;YAED,MAAM,IAAI,GAAa;gBACrB,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,WAAW;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;aAClB,CAAC;YACF,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACpC,CAAC;QAED,IAAI,eAAe,IAAI,CAAC,IAAI,eAAe,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC;YAC5D,KAAK,CAAC,UAAU,GAAG,MAAM,CAAC,eAAe,CAAC,CAAC;QAC7C,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/memory/memory-cache.d.ts

@@ -0,0 +1,33 @@
+/**
+ * Cache Size Limiter with LRU Eviction
+ *
+ * Enforces configurable max database size (default 500MB)
+ * using LRU-based eviction to protect the SSD.
+ */
+import type { MemoryStore } from './memory-store.js';
+import type { HNSWIndex } from './hnsw-index.js';
+export interface EvictionResult {
+    evictedCount: number;
+    freedBytes: number;
+}
+export declare class MemoryCache {
+    private store;
+    private index;
+    private maxSizeBytes;
+    constructor(store: MemoryStore, index: HNSWIndex, maxSizeBytes?: number);
+    getCurrentSize(): number;
+    getUsagePercent(): number;
+    isOverLimit(): boolean;
+    /**
+     * Check and evict if over limit
+     * Returns number of evicted memories and freed bytes
+     */
+    checkAndEvict(activeSessionId?: string): EvictionResult;
+    /**
+     * Force eviction regardless of current size.
+     * Evicts at least one batch of candidates.
+     */
+    forceEvict(activeSessionId?: string): EvictionResult;
+    private evict;
+}
+//# sourceMappingURL=memory-cache.d.ts.map

package/dist/memory/memory-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-cache.d.ts","sourceRoot":"","sources":["../../src/memory/memory-cache.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC;AACrD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAMjD,MAAM,WAAW,cAAc;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,WAAW;IAIpB,OAAO,CAAC,KAAK;IACb,OAAO,CAAC,KAAK;IAJf,OAAO,CAAC,YAAY,CAAS;gBAGnB,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,SAAS,EACxB,YAAY,CAAC,EAAE,MAAM;IAKvB,cAAc,IAAI,MAAM;IAIxB,eAAe,IAAI,MAAM;IAIzB,WAAW,IAAI,OAAO;IAItB;;;OAGG;IACH,aAAa,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,cAAc;IAQvD;;;OAGG;IACH,UAAU,CAAC,eAAe,CAAC,EAAE,MAAM,GAAG,cAAc;IAoCpD,OAAO,CAAC,KAAK;CAuBd"}

package/dist/memory/memory-cache.js

@@ -0,0 +1,85 @@
+/**
+ * Cache Size Limiter with LRU Eviction
+ *
+ * Enforces configurable max database size (default 500MB)
+ * using LRU-based eviction to protect the SSD.
+ */
+const DEFAULT_MAX_SIZE = 524288000; // 500MB
+const EVICTION_BATCH_SIZE = 100;
+const TARGET_USAGE = 0.85; // 85% — evict until 15% headroom
+export class MemoryCache {
+    store;
+    index;
+    maxSizeBytes;
+    constructor(store, index, maxSizeBytes) {
+        this.store = store;
+        this.index = index;
+        this.maxSizeBytes = maxSizeBytes ?? DEFAULT_MAX_SIZE;
+    }
+    getCurrentSize() {
+        return this.store.getDbSizeBytes();
+    }
+    getUsagePercent() {
+        return (this.getCurrentSize() / this.maxSizeBytes) * 100;
+    }
+    isOverLimit() {
+        return this.getCurrentSize() > this.maxSizeBytes;
+    }
+    /**
+     * Check and evict if over limit
+     * Returns number of evicted memories and freed bytes
+     */
+    checkAndEvict(activeSessionId) {
+        if (!this.isOverLimit()) {
+            return { evictedCount: 0, freedBytes: 0 };
+        }
+        return this.evict(activeSessionId);
+    }
+    /**
+     * Force eviction regardless of current size.
+     * Evicts at least one batch of candidates.
+     */
+    forceEvict(activeSessionId) {
+        const sizeBefore = this.getCurrentSize();
+        let evictedCount = 0;
+        // Always run at least one batch
+        const candidates = this.store.getEvictionCandidates(EVICTION_BATCH_SIZE, activeSessionId);
+        for (const candidate of candidates) {
+            this.store.deleteMemory(candidate.id);
+            this.index.remove(candidate.id);
+            evictedCount++;
+        }
+        // If still over target, keep evicting
+        const targetSize = this.maxSizeBytes * TARGET_USAGE;
+        while (this.getCurrentSize() > targetSize) {
+            const moreCandidates = this.store.getEvictionCandidates(EVICTION_BATCH_SIZE, activeSessionId);
+            if (moreCandidates.length === 0)
+                break;
+            for (const candidate of moreCandidates) {
+                this.store.deleteMemory(candidate.id);
+                this.index.remove(candidate.id);
+                evictedCount++;
+            }
+        }
+        const freedBytes = sizeBefore - this.getCurrentSize();
+        return { evictedCount, freedBytes: Math.max(0, freedBytes) };
+    }
+    evict(activeSessionId) {
+        const sizeBefore = this.getCurrentSize();
+        const targetSize = this.maxSizeBytes * TARGET_USAGE;
+        let evictedCount = 0;
+        while (this.getCurrentSize() > targetSize) {
+            const candidates = this.store.getEvictionCandidates(EVICTION_BATCH_SIZE, activeSessionId);
+            if (candidates.length === 0)
+                break;
+            for (const candidate of candidates) {
+                this.store.deleteMemory(candidate.id);
+                this.index.remove(candidate.id);
+                evictedCount++;
+            }
+        }
+        const freedBytes = sizeBefore - this.getCurrentSize();
+        return { evictedCount, freedBytes: Math.max(0, freedBytes) };
+    }
+}
+//# sourceMappingURL=memory-cache.js.map

package/dist/memory/memory-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-cache.js","sourceRoot":"","sources":["../../src/memory/memory-cache.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAKH,MAAM,gBAAgB,GAAG,SAAS,CAAC,CAAC,QAAQ;AAC5C,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAChC,MAAM,YAAY,GAAG,IAAI,CAAC,CAAC,iCAAiC;AAO5D,MAAM,OAAO,WAAW;IAIZ;IACA;IAJF,YAAY,CAAS;IAE7B,YACU,KAAkB,EAClB,KAAgB,EACxB,YAAqB;QAFb,UAAK,GAAL,KAAK,CAAa;QAClB,UAAK,GAAL,KAAK,CAAW;QAGxB,IAAI,CAAC,YAAY,GAAG,YAAY,IAAI,gBAAgB,CAAC;IACvD,CAAC;IAED,cAAc;QACZ,OAAO,IAAI,CAAC,KAAK,CAAC,cAAc,EAAE,CAAC;IACrC,CAAC;IAED,eAAe;QACb,OAAO,CAAC,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,GAAG,CAAC;IAC3D,CAAC;IAED,WAAW;QACT,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,IAAI,CAAC,YAAY,CAAC;IACnD,CAAC;IAED;;;OAGG;IACH,aAAa,CAAC,eAAwB;QACpC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;YACxB,OAAO,EAAE,YAAY,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAC5C,CAAC;QAED,OAAO,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IACrC,CAAC;IAED;;;OAGG;IACH,UAAU,CAAC,eAAwB;QACjC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACzC,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,gCAAgC;QAChC,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CACjD,mBAAmB,EACnB,eAAe,CAChB,CAAC;QAEF,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;YAChC,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,sCAAsC;QACtC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACpD,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,UAAU,EAAE,CAAC;YAC1C,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CACrD,mBAAmB,EACnB,eAAe,CAChB,CAAC;YACF,IAAI,cAAc,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAEvC,KAAK,MAAM,SAAS,IAAI,cAAc,EAAE,CAAC;gBACvC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAChC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACtD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC;IAC/D,CAAC;IAEO,KAAK,CAAC,eAAwB;QACpC,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACzC,MAAM,UAAU,GAAG,IAAI,CAAC,YAAY,GAAG,YAAY,CAAC;QACpD,IAAI,YAAY,GAAG,CAAC,CAAC;QAErB,OAAO,IAAI,CAAC,cAAc,EAAE,GAAG,UAAU,EAAE,CAAC;YAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,qBAAqB,CACjD,mBAAmB,EACnB,eAAe,CAChB,CAAC;YAEF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;gBAAE,MAAM;YAEnC,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;gBACnC,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBACtC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;gBAChC,YAAY,EAAE,CAAC;YACjB,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,UAAU,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACtD,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,EAAE,CAAC;IAC/D,CAAC;CACF"}

package/dist/memory/memory-hooks.d.ts

@@ -0,0 +1,42 @@
+/**
+ * Agent Capture Hooks
+ *
+ * Auto-classification heuristics and capture adapters
+ * for Claude Code, Cursor, and Gemini agent output.
+ *
+ * Also provides MCP auto-capture: intercepts tool calls
+ * and automatically saves significant interactions to memory.
+ */
+import type { MemoryType } from './memory-types.js';
+export interface CapturedMemory {
+    type: MemoryType;
+    title: string;
+    content: string;
+    tags?: string[];
+}
+/**
+ * Classify memory content by type using keyword heuristics
+ */
+export declare function classifyMemory(content: string): MemoryType;
+/**
+ * Extract a short title from content (first meaningful line, truncated)
+ */
+export declare function extractTitle(content: string, maxLength?: number): string;
+/**
+ * Capture memories from Claude Code agent output
+ */
+export declare function captureFromClaudeCode(output: string, _sessionId: string): CapturedMemory[];
+/**
+ * Capture memories from Cursor agent output
+ */
+export declare function captureFromCursor(output: string, _sessionId: string): CapturedMemory[];
+/**
+ * Capture memories from Gemini agent output
+ */
+export declare function captureFromGemini(output: string, _sessionId: string): CapturedMemory[];
+/**
+ * Build a memory from an MCP tool call and its result.
+ * Returns null if the interaction is not worth capturing.
+ */
+export declare function captureFromToolCall(toolName: string, args: Record<string, unknown>, result: string): CapturedMemory | null;
+//# sourceMappingURL=memory-hooks.d.ts.map

package/dist/memory/memory-hooks.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-hooks.d.ts","sourceRoot":"","sources":["../../src/memory/memory-hooks.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AAEpD,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,UAAU,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC;CACjB;AAWD;;GAEG;AACH,wBAAgB,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,UAAU,CAO1D;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,EAAE,SAAS,GAAE,MAAW,GAAG,MAAM,CAY5E;AAmBD;;GAEG;AACH,wBAAgB,qBAAqB,CACnC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,GACjB,cAAc,EAAE,CAOlB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,GACjB,cAAc,EAAE,CAOlB;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAC/B,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,MAAM,GACjB,cAAc,EAAE,CAOlB;AAyCD;;;GAGG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,MAAM,EAChB,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EAC7B,MAAM,EAAE,MAAM,GACb,cAAc,GAAG,IAAI,CA+BvB"}