@hivehub/rulebook 5.5.2 → 5.8.0

package/dist/memory/hnsw-index.js

@@ -1,544 +0,0 @@
-/**
- * Pure TypeScript HNSW (Hierarchical Navigable Small World) Index
- *
- * Approximate nearest neighbor search using cosine distance.
- * Zero native dependencies. Designed for <50K vectors.
- */
-/**
- * Min-heap (priority queue) for efficient nearest-neighbor search.
- * Replaces Array.sort() in the inner HNSW search loop:
- * O(log n) insert/extract vs O(n log n) full sort per iteration.
- */
-class MinHeap {
-    heap = [];
-    get size() {
-        return this.heap.length;
-    }
-    peek() {
-        return this.heap[0];
-    }
-    push(item) {
-        this.heap.push(item);
-        this.siftUp(this.heap.length - 1);
-    }
-    pop() {
-        if (this.heap.length === 0)
-            return undefined;
-        const top = this.heap[0];
-        const last = this.heap.pop();
-        if (this.heap.length > 0) {
-            this.heap[0] = last;
-            this.siftDown(0);
-        }
-        return top;
-    }
-    toSorted() {
-        return [...this.heap].sort((a, b) => a.distance - b.distance);
-    }
-    siftUp(i) {
-        while (i > 0) {
-            const parent = (i - 1) >> 1;
-            if (this.heap[i].distance < this.heap[parent].distance) {
-                [this.heap[i], this.heap[parent]] = [this.heap[parent], this.heap[i]];
-                i = parent;
-            }
-            else
-                break;
-        }
-    }
-    siftDown(i) {
-        const n = this.heap.length;
-        while (true) {
-            let smallest = i;
-            const left = 2 * i + 1;
-            const right = 2 * i + 2;
-            if (left < n && this.heap[left].distance < this.heap[smallest].distance)
-                smallest = left;
-            if (right < n && this.heap[right].distance < this.heap[smallest].distance)
-                smallest = right;
-            if (smallest === i)
-                break;
-            [this.heap[i], this.heap[smallest]] = [this.heap[smallest], this.heap[i]];
-            i = smallest;
-        }
-    }
-}
-/**
- * Max-heap for maintaining the k-farthest boundary in HNSW search results.
- */
-class MaxHeap {
-    heap = [];
-    get size() {
-        return this.heap.length;
-    }
-    peek() {
-        return this.heap[0];
-    }
-    push(item) {
-        this.heap.push(item);
-        this.siftUp(this.heap.length - 1);
-    }
-    popMax() {
-        if (this.heap.length === 0)
-            return undefined;
-        const top = this.heap[0];
-        const last = this.heap.pop();
-        if (this.heap.length > 0) {
-            this.heap[0] = last;
-            this.siftDown(0);
-        }
-        return top;
-    }
-    toSorted() {
-        return [...this.heap].sort((a, b) => a.distance - b.distance);
-    }
-    siftUp(i) {
-        while (i > 0) {
-            const parent = (i - 1) >> 1;
-            if (this.heap[i].distance > this.heap[parent].distance) {
-                [this.heap[i], this.heap[parent]] = [this.heap[parent], this.heap[i]];
-                i = parent;
-            }
-            else
-                break;
-        }
-    }
-    siftDown(i) {
-        const n = this.heap.length;
-        while (true) {
-            let largest = i;
-            const left = 2 * i + 1;
-            const right = 2 * i + 2;
-            if (left < n && this.heap[left].distance > this.heap[largest].distance)
-                largest = left;
-            if (right < n && this.heap[right].distance > this.heap[largest].distance)
-                largest = right;
-            if (largest === i)
-                break;
-            [this.heap[i], this.heap[largest]] = [this.heap[largest], this.heap[i]];
-            i = largest;
-        }
-    }
-}
-const MAGIC_NUMBER = 0x484e5357; // 'HNSW'
-const FORMAT_VERSION = 1;
-export class HNSWIndex {
-    M;
-    efConstruction;
-    dimensions;
-    maxNodes;
-    mL; // normalization factor for layer assignment
-    nodes = new Map();
-    insertionOrder = []; // tracks insertion order for FIFO eviction
-    entryPoint = null;
-    maxLayer = 0;
-    constructor(config) {
-        this.M = config.M ?? 16;
-        this.efConstruction = config.efConstruction ?? 200;
-        this.dimensions = config.dimensions;
-        this.maxNodes = config.maxNodes ?? 50_000;
-        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.
-     * Uses min-heap for candidates and max-heap for results to avoid
-     * O(n log n) array sorts on every iteration (now O(log n) per operation).
-     */
-    searchLayer(query, entryLabel, ef, layer) {
-        const visited = new Set();
-        const candidates = new MinHeap(); // closest-first extraction
-        const results = new MaxHeap(); // farthest-first for boundary check
-        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.size > 0) {
-            const current = candidates.pop();
-            const farthest = results.peek();
-            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);
-                const currentFarthest = results.peek();
-                if (results.size < ef || dist < currentFarthest.distance) {
-                    candidates.push({ label: neighborLabel, distance: dist });
-                    results.push({ label: neighborLabel, distance: dist });
-                    if (results.size > ef) {
-                        results.popMax();
-                    }
-                }
-            }
-        }
-        return results.toSorted();
-    }
-    /**
-     * 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);
-        }
-        // Evict oldest nodes when at capacity to prevent unbounded memory growth
-        while (this.nodes.size >= this.maxNodes && this.insertionOrder.length > 0) {
-            const oldest = this.insertionOrder.shift();
-            if (this.nodes.has(oldest)) {
-                this.remove(oldest);
-            }
-        }
-        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);
-        this.insertionOrder.push(label);
-        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);
-            index.insertionOrder.push(data.label);
-        }
-        if (entryPointIndex >= 0 && entryPointIndex < labels.length) {
-            index.entryPoint = labels[entryPointIndex];
-        }
-        return index;
-    }
-}
-//# sourceMappingURL=hnsw-index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"hnsw-index.js","sourceRoot":"","sources":["../../src/memory/hnsw-index.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAcH;;;;GAIG;AACH,MAAM,OAAO;IACH,IAAI,GAAsB,EAAE,CAAC;IAErC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,CAAC,IAAqB;QACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpC,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,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChE,CAAC;IAEO,MAAM,CAAC,CAAS;QACtB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACvD,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;;gBAAM,MAAM;QACf,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,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ;gBAAE,QAAQ,GAAG,IAAI,CAAC;YACzF,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ;gBAAE,QAAQ,GAAG,KAAK,CAAC;YAC5F,IAAI,QAAQ,KAAK,CAAC;gBAAE,MAAM;YAC1B,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;YAC1E,CAAC,GAAG,QAAQ,CAAC;QACf,CAAC;IACH,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO;IACH,IAAI,GAAsB,EAAE,CAAC;IAErC,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC1B,CAAC;IAED,IAAI;QACF,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,IAAI,CAAC,IAAqB;QACxB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAED,MAAM;QACJ,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,QAAQ;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC;IAChE,CAAC;IAEO,MAAM,CAAC,CAAS;QACtB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;gBACvD,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;;gBAAM,MAAM;QACf,CAAC;IACH,CAAC;IAEO,QAAQ,CAAC,CAAS;QACxB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,OAAO,IAAI,EAAE,CAAC;YACZ,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,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,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ;gBAAE,OAAO,GAAG,IAAI,CAAC;YACvF,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,QAAQ;gBAAE,OAAO,GAAG,KAAK,CAAC;YAC1F,IAAI,OAAO,KAAK,CAAC;gBAAE,MAAM;YACzB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACxE,CAAC,GAAG,OAAO,CAAC;QACd,CAAC;IACH,CAAC;CACF;AASD,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,QAAQ,CAAS;IACjB,EAAE,CAAS,CAAC,4CAA4C;IACjE,KAAK,GAA0B,IAAI,GAAG,EAAE,CAAC;IACzC,cAAc,GAAa,EAAE,CAAC,CAAC,2CAA2C;IAC1E,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,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC;QAC1C,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;;;;OAIG;IACK,WAAW,CACjB,KAAmB,EACnB,UAAkB,EAClB,EAAU,EACV,KAAa;QAEb,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,OAAO,EAAE,CAAC,CAAC,2BAA2B;QAC7D,MAAM,OAAO,GAAG,IAAI,OAAO,EAAE,CAAC,CAAC,oCAAoC;QAEnE,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,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,EAAG,CAAC;YAClC,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,EAAG,CAAC;YAEjC,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;gBAC7D,MAAM,eAAe,GAAG,OAAO,CAAC,IAAI,EAAG,CAAC;gBAExC,IAAI,OAAO,CAAC,IAAI,GAAG,EAAE,IAAI,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,CAAC;oBACzD,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,IAAI,GAAG,EAAE,EAAE,CAAC;wBACtB,OAAO,CAAC,MAAM,EAAE,CAAC;oBACnB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,UAA6B,EAAE,CAAS;QAC9D,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,yEAAyE;QACzE,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1E,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,KAAK,EAAG,CAAC;YAC5C,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACtB,CAAC;QACH,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;QAC5B,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAEhC,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,CAAC,MAAM,EAAE,YAAY,EAAE,IAAI,CAAC,cAAc,EAAE,CAAC,CAAC,CAAC;YAElF,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,CAAC,KAAmB,EAAE,CAAS,EAAE,EAAW;QAChD,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;QAC3C,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;QACtC,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QACrC,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACjD,MAAM,IAAI,CAAC,CAAC;QACZ,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;QACvF,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC5C,MAAM,IAAI,CAAC,CAAC;QAEZ,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;YAChD,MAAM,IAAI,CAAC,CAAC;YACZ,IAAI,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YAClE,MAAM,IAAI,UAAU,CAAC,MAAM,CAAC;YAE5B,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;gBAC9C,MAAM,IAAI,CAAC,CAAC;YACd,CAAC;YAED,QAAQ;YACR,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YACzC,MAAM,IAAI,CAAC,CAAC;YAEZ,cAAc;YACd,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC;YACzC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;YACzC,MAAM,IAAI,CAAC,CAAC;YACZ,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;gBACpC,MAAM,IAAI,CAAC,CAAC;gBACZ,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;gBAC/C,MAAM,IAAI,CAAC,CAAC;gBACZ,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;oBACvC,MAAM,IAAI,CAAC,CAAC;gBACd,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;QAC3C,MAAM,IAAI,CAAC,CAAC;QACZ,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;QACtC,MAAM,IAAI,CAAC,CAAC;QACZ,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;QAChD,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC/C,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACpD,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC9C,MAAM,IAAI,CAAC,CAAC;QAEZ,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;YAC9C,MAAM,IAAI,CAAC,CAAC;YACZ,MAAM,UAAU,GAAG,IAAI,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC5D,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACzC,MAAM,IAAI,QAAQ,CAAC;YACnB,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;gBAC1C,MAAM,IAAI,CAAC,CAAC;YACd,CAAC;YAED,MAAM,KAAK,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAC3C,MAAM,IAAI,CAAC,CAAC;YACZ,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAChD,MAAM,IAAI,CAAC,CAAC;YACZ,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;gBAC/C,MAAM,IAAI,CAAC,CAAC;gBACZ,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;gBAC/C,MAAM,IAAI,CAAC,CAAC;gBACZ,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;oBACnD,MAAM,IAAI,CAAC,CAAC;gBACd,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;YAClC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACxC,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

@@ -1,33 +0,0 @@
-/**
- * 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

@@ -1 +0,0 @@
-{"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;IA8BpD,OAAO,CAAC,KAAK;CAoBd"}