@nahisaho/yata-scale 1.8.5

package/dist/index/BPlusTreeIndex.js

@@ -0,0 +1,310 @@
+/**
+ * @nahisaho/yata-scale - B+Tree Index
+ *
+ * B+Tree implementation for efficient range queries
+ */
+/**
+ * B+Tree index for efficient key-value storage with range queries
+ */
+export class BPlusTreeIndex {
+    root;
+    order;
+    entryCount = 0;
+    compare;
+    constructor(config) {
+        const fanout = config?.fanout ?? 128;
+        this.order = Math.floor(fanout / 2);
+        this.root = this.createLeafNode();
+        this.compare = (a, b) => {
+            if (typeof a === 'string' && typeof b === 'string') {
+                return a.localeCompare(b);
+            }
+            return a - b;
+        };
+    }
+    /**
+     * Create a new leaf node
+     */
+    createLeafNode() {
+        return {
+            keys: [],
+            children: [],
+            isLeaf: true,
+        };
+    }
+    /**
+     * Create a new internal node
+     */
+    createInternalNode() {
+        return {
+            keys: [],
+            children: [],
+            isLeaf: false,
+        };
+    }
+    /**
+     * Insert a key-value pair
+     */
+    insert(key, value) {
+        const result = this.insertInNode(this.root, key, value);
+        if (result) {
+            // Root was split, create new root
+            const newRoot = this.createInternalNode();
+            newRoot.keys.push(result.key);
+            newRoot.children.push(this.root, result.node);
+            this.root = newRoot;
+        }
+        this.entryCount++;
+    }
+    /**
+     * Insert into a node, return split result if node was split
+     */
+    insertInNode(node, key, value) {
+        if (node.isLeaf) {
+            return this.insertInLeaf(node, key, value);
+        }
+        // Find child to insert into
+        let childIndex = this.findChildIndex(node, key);
+        const child = node.children[childIndex];
+        const result = this.insertInNode(child, key, value);
+        if (!result) {
+            return null;
+        }
+        // Child was split, insert new key/child
+        return this.insertInInternal(node, result.key, result.node, childIndex);
+    }
+    /**
+     * Insert into a leaf node
+     */
+    insertInLeaf(node, key, value) {
+        // Find insertion position
+        let pos = 0;
+        while (pos < node.keys.length && this.compare(node.keys[pos], key) < 0) {
+            pos++;
+        }
+        // Check for duplicate key - update value
+        if (pos < node.keys.length && this.compare(node.keys[pos], key) === 0) {
+            node.children[pos][0] = value;
+            this.entryCount--; // Compensate for the increment in insert()
+            return null;
+        }
+        // Insert key and value
+        node.keys.splice(pos, 0, key);
+        node.children.splice(pos, 0, [value]);
+        // Check if split needed
+        if (node.keys.length > this.order * 2) {
+            return this.splitLeaf(node);
+        }
+        return null;
+    }
+    /**
+     * Insert into an internal node
+     */
+    insertInInternal(node, key, child, afterIndex) {
+        // Insert key and child
+        node.keys.splice(afterIndex, 0, key);
+        node.children.splice(afterIndex + 1, 0, child);
+        // Check if split needed
+        if (node.keys.length > this.order * 2) {
+            return this.splitInternal(node);
+        }
+        return null;
+    }
+    /**
+     * Split a leaf node
+     */
+    splitLeaf(node) {
+        const midIndex = Math.floor(node.keys.length / 2);
+        const newNode = this.createLeafNode();
+        newNode.keys = node.keys.splice(midIndex);
+        newNode.children = node.children.splice(midIndex);
+        // Link leaves
+        newNode.next = node.next;
+        node.next = newNode;
+        return {
+            key: newNode.keys[0],
+            node: newNode,
+        };
+    }
+    /**
+     * Split an internal node
+     */
+    splitInternal(node) {
+        const midIndex = Math.floor(node.keys.length / 2);
+        const midKey = node.keys[midIndex];
+        const newNode = this.createInternalNode();
+        newNode.keys = node.keys.splice(midIndex + 1);
+        newNode.children = node.children.splice(midIndex + 1);
+        node.keys.pop(); // Remove the promoted key
+        return {
+            key: midKey,
+            node: newNode,
+        };
+    }
+    /**
+     * Find child index for a key
+     */
+    findChildIndex(node, key) {
+        let i = 0;
+        while (i < node.keys.length && this.compare(key, node.keys[i]) >= 0) {
+            i++;
+        }
+        return i;
+    }
+    /**
+     * Get a value by key
+     */
+    get(key) {
+        const leaf = this.findLeaf(key);
+        const index = leaf.keys.findIndex((k) => this.compare(k, key) === 0);
+        if (index === -1) {
+            return undefined;
+        }
+        return leaf.children[index][0];
+    }
+    /**
+     * Delete a key
+     */
+    delete(key) {
+        const leaf = this.findLeaf(key);
+        const index = leaf.keys.findIndex((k) => this.compare(k, key) === 0);
+        if (index === -1) {
+            return false;
+        }
+        leaf.keys.splice(index, 1);
+        leaf.children.splice(index, 1);
+        this.entryCount--;
+        // Note: Full B+Tree deletion with rebalancing is complex
+        // This simplified version doesn't rebalance
+        return true;
+    }
+    /**
+     * Find the leaf node for a key
+     */
+    findLeaf(key) {
+        let node = this.root;
+        while (!node.isLeaf) {
+            const childIndex = this.findChildIndex(node, key);
+            node = node.children[childIndex];
+        }
+        return node;
+    }
+    /**
+     * Range query
+     */
+    *range(start, end, options) {
+        const inclusive = options?.inclusive ?? true;
+        const limit = options?.limit;
+        const reverse = options?.reverse ?? false;
+        if (reverse) {
+            // Reverse iteration is more complex, collect and reverse
+            const results = [];
+            for (const entry of this.rangeForward(start, end, inclusive, limit)) {
+                results.push(entry);
+            }
+            for (let i = results.length - 1; i >= 0; i--) {
+                yield results[i];
+            }
+        }
+        else {
+            yield* this.rangeForward(start, end, inclusive, limit);
+        }
+    }
+    /**
+     * Forward range iteration
+     */
+    *rangeForward(start, end, inclusive, limit) {
+        let leaf = this.findLeaf(start);
+        let count = 0;
+        while (leaf) {
+            for (let i = 0; i < leaf.keys.length; i++) {
+                const key = leaf.keys[i];
+                // Skip keys before start
+                const startCmp = this.compare(key, start);
+                if (startCmp < 0 || (startCmp === 0 && !inclusive)) {
+                    continue;
+                }
+                // Stop at keys after end
+                const endCmp = this.compare(key, end);
+                if (endCmp > 0 || (endCmp === 0 && !inclusive)) {
+                    return;
+                }
+                yield [key, leaf.children[i][0]];
+                count++;
+                if (limit !== undefined && count >= limit) {
+                    return;
+                }
+            }
+            leaf = leaf.next;
+        }
+    }
+    /**
+     * Get all entries
+     */
+    *entries() {
+        let leaf = this.root;
+        // Find leftmost leaf
+        while (!leaf.isLeaf) {
+            leaf = leaf.children[0];
+        }
+        while (leaf) {
+            for (let i = 0; i < leaf.keys.length; i++) {
+                yield [leaf.keys[i], leaf.children[i][0]];
+            }
+            leaf = leaf.next;
+        }
+    }
+    /**
+     * Clear all entries
+     */
+    clear() {
+        this.root = this.createLeafNode();
+        this.entryCount = 0;
+    }
+    /**
+     * Get entry count
+     */
+    get size() {
+        return this.entryCount;
+    }
+    /**
+     * Check if empty
+     */
+    get isEmpty() {
+        return this.entryCount === 0;
+    }
+    /**
+     * Get index statistics
+     */
+    getStats() {
+        return {
+            name: 'btree',
+            type: 'btree',
+            entryCount: this.entryCount,
+            sizeBytes: this.estimateSize(),
+            depth: this.getDepth(),
+            hitRate: 0, // Would need to track hits/misses
+            lastUpdated: new Date(),
+        };
+    }
+    /**
+     * Estimate memory size
+     */
+    estimateSize() {
+        // Rough estimate: 100 bytes per entry
+        return this.entryCount * 100;
+    }
+    /**
+     * Get tree depth
+     */
+    getDepth() {
+        let depth = 0;
+        let node = this.root;
+        while (!node.isLeaf) {
+            depth++;
+            node = node.children[0];
+        }
+        return depth + 1;
+    }
+}
+//# sourceMappingURL=BPlusTreeIndex.js.map

package/dist/index/BPlusTreeIndex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BPlusTreeIndex.js","sourceRoot":"","sources":["../../src/index/BPlusTreeIndex.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAcH;;GAEG;AACH,MAAM,OAAO,cAAc;IACjB,IAAI,CAAsB;IACjB,KAAK,CAAS;IACvB,UAAU,GAAW,CAAC,CAAC;IACd,OAAO,CAAyB;IAEjD,YAAY,MAAiC;QAC3C,MAAM,MAAM,GAAG,MAAM,EAAE,MAAM,IAAI,GAAG,CAAC;QACrC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAClC,IAAI,CAAC,OAAO,GAAG,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE;YAC5B,IAAI,OAAO,CAAC,KAAK,QAAQ,IAAI,OAAO,CAAC,KAAK,QAAQ,EAAE,CAAC;gBACnD,OAAO,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;YAC5B,CAAC;YACD,OAAQ,CAAY,GAAI,CAAY,CAAC;QACvC,CAAC,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,OAAO;YACL,IAAI,EAAE,EAAE;YACR,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,IAAI;SACb,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,OAAO;YACL,IAAI,EAAE,EAAE;YACR,QAAQ,EAAE,EAAE;YACZ,MAAM,EAAE,KAAK;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAM,EAAE,KAAQ;QACrB,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAExD,IAAI,MAAM,EAAE,CAAC;YACX,kCAAkC;YAClC,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;YAC1C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC9B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACtB,CAAC;QAED,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,IAAyB,EACzB,GAAM,EACN,KAAQ;QAER,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,OAAO,IAAI,CAAC,YAAY,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,CAAC;QAED,4BAA4B;QAC5B,IAAI,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAChD,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAwB,CAAC;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAEpD,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC;QACd,CAAC;QAED,wCAAwC;QACxC,OAAO,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;IAC1E,CAAC;IAED;;OAEG;IACK,YAAY,CAClB,IAAyB,EACzB,GAAM,EACN,KAAQ;QAER,0BAA0B;QAC1B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,OAAO,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACvE,GAAG,EAAE,CAAC;QACR,CAAC;QAED,yCAAyC;QACzC,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YACrE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAS,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACvC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,2CAA2C;YAC9D,OAAO,IAAI,CAAC;QACd,CAAC;QAED,uBAAuB;QACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAEtC,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,IAAyB,EACzB,GAAM,EACN,KAA0B,EAC1B,UAAkB;QAElB,uBAAuB;QACvB,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAE/C,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACtC,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC;QAClC,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,SAAS,CACf,IAAyB;QAEzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAElD,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACtC,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC1C,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAElD,cAAc;QACd,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACzB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAEpB,OAAO;YACL,GAAG,EAAE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YACpB,IAAI,EAAE,OAAO;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,IAAyB;QAEzB,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAEnC,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAC1C,OAAO,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QAC9C,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,0BAA0B;QAE3C,OAAO;YACL,GAAG,EAAE,MAAM;YACX,IAAI,EAAE,OAAO;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,cAAc,CAAC,IAAyB,EAAE,GAAM;QACtD,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACpE,CAAC,EAAE,CAAC;QACN,CAAC;QACD,OAAO,CAAC,CAAC;IACX,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,GAAM;QACR,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAErE,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,OAAQ,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAS,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,GAAM;QACX,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAErE,IAAI,KAAK,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAC/B,IAAI,CAAC,UAAU,EAAE,CAAC;QAElB,yDAAyD;QACzD,4CAA4C;QAE5C,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,QAAQ,CAAC,GAAM;QACrB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAErB,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAClD,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,UAAU,CAAwB,CAAC;QAC1D,CAAC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,CAAC,KAAK,CAAC,KAAQ,EAAE,GAAM,EAAE,OAAsB;QAC7C,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC;QAC7C,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,CAAC;QAC7B,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,KAAK,CAAC;QAE1C,IAAI,OAAO,EAAE,CAAC;YACZ,yDAAyD;YACzD,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,EAAE,CAAC;gBACpE,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,OAAO,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;aAAM,CAAC;YACN,KAAK,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;IAED;;OAEG;IACK,CAAC,YAAY,CACnB,KAAQ,EACR,GAAM,EACN,SAAkB,EAClB,KAAc;QAEd,IAAI,IAAI,GAAoC,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACjE,IAAI,KAAK,GAAG,CAAC,CAAC;QAEd,OAAO,IAAI,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEzB,yBAAyB;gBACzB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;gBAC1C,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;oBACnD,SAAS;gBACX,CAAC;gBAED,yBAAyB;gBACzB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;gBACtC,IAAI,MAAM,GAAG,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC;oBAC/C,OAAO;gBACT,CAAC;gBAED,MAAM,CAAC,GAAG,EAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC1C,KAAK,EAAE,CAAC;gBAER,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;oBAC1C,OAAO;gBACT,CAAC;YACH,CAAC;YAED,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,CAAC,OAAO;QACN,IAAI,IAAI,GAAoC,IAAI,CAAC,IAAI,CAAC;QAEtD,qBAAqB;QACrB,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACpB,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAwB,CAAC;QACjD,CAAC;QAED,OAAO,IAAI,EAAE,CAAC;YACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAS,CAAC,CAAC,CAAC,CAAC,CAAC;YACrD,CAAC;YACD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QAClC,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;OAEG;IACH,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,UAAU,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,OAAO;YACb,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,SAAS,EAAE,IAAI,CAAC,YAAY,EAAE;YAC9B,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE;YACtB,OAAO,EAAE,CAAC,EAAE,kCAAkC;YAC9C,WAAW,EAAE,IAAI,IAAI,EAAE;SACxB,CAAC;IACJ,CAAC;IAED;;OAEG;IACK,YAAY;QAClB,sCAAsC;QACtC,OAAO,IAAI,CAAC,UAAU,GAAG,GAAG,CAAC;IAC/B,CAAC;IAED;;OAEG;IACK,QAAQ;QACd,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAErB,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACpB,KAAK,EAAE,CAAC;YACR,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAwB,CAAC;QACjD,CAAC;QAED,OAAO,KAAK,GAAG,CAAC,CAAC;IACnB,CAAC;CACF"}

package/dist/index/BloomFilter.d.ts

@@ -0,0 +1,85 @@
+/**
+ * @nahisaho/yata-scale - Bloom Filter
+ *
+ * Space-efficient probabilistic data structure for membership testing
+ */
+import type { BloomFilterConfig, IndexStats } from '../types.js';
+/**
+ * Bloom filter for efficient membership testing
+ */
+export declare class BloomFilter {
+    private bitArray;
+    private readonly size;
+    private readonly hashCount;
+    private itemCount;
+    constructor(config: BloomFilterConfig);
+    /**
+     * Calculate optimal bit array size
+     */
+    private calculateSize;
+    /**
+     * Calculate optimal number of hash functions
+     */
+    private calculateHashCount;
+    /**
+     * Add an item to the filter
+     */
+    add(item: string): void;
+    /**
+     * Check if an item might be in the filter
+     */
+    mightContain(item: string): boolean;
+    /**
+     * Hash function using MurmurHash3-like algorithm with seed
+     */
+    private hash;
+    /**
+     * Set a bit in the array
+     */
+    private setBit;
+    /**
+     * Get a bit from the array
+     */
+    private getBit;
+    /**
+     * Clear the filter
+     */
+    clear(): void;
+    /**
+     * Get current false positive rate estimate
+     */
+    getFalsePositiveRate(): number;
+    /**
+     * Get fill ratio (percentage of bits set)
+     */
+    getFillRatio(): number;
+    /**
+     * Merge another bloom filter into this one
+     */
+    merge(other: BloomFilter): void;
+    /**
+     * Create a copy of this filter
+     */
+    clone(): BloomFilter;
+    /**
+     * Serialize to buffer
+     */
+    serialize(): Uint8Array;
+    /**
+     * Deserialize from buffer
+     */
+    static deserialize(buffer: Uint8Array): BloomFilter;
+    /**
+     * Get item count
+     */
+    get count(): number;
+    /**
+     * Get bit array size in bytes
+     */
+    get sizeBytes(): number;
+    /**
+     * Get index statistics
+     */
+    getStats(): IndexStats;
+}
+//# sourceMappingURL=BloomFilter.d.ts.map

package/dist/index/BloomFilter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"BloomFilter.d.ts","sourceRoot":"","sources":["../../src/index/BloomFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,KAAK,EAAE,iBAAiB,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAEjE;;GAEG;AACH,qBAAa,WAAW;IACtB,OAAO,CAAC,QAAQ,CAAa;IAC7B,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAS;IAC9B,OAAO,CAAC,QAAQ,CAAC,SAAS,CAAS;IACnC,OAAO,CAAC,SAAS,CAAa;gBAElB,MAAM,EAAE,iBAAiB;IAMrC;;OAEG;IACH,OAAO,CAAC,aAAa;IAKrB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAK1B;;OAEG;IACH,GAAG,CAAC,IAAI,EAAE,MAAM,GAAG,IAAI;IASvB;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO;IAWnC;;OAEG;IACH,OAAO,CAAC,IAAI;IA2BZ;;OAEG;IACH,OAAO,CAAC,MAAM;IAMd;;OAEG;IACH,OAAO,CAAC,MAAM;IAMd;;OAEG;IACH,KAAK,IAAI,IAAI;IAKb;;OAEG;IACH,oBAAoB,IAAI,MAAM;IAM9B;;OAEG;IACH,YAAY,IAAI,MAAM;IAYtB;;OAEG;IACH,KAAK,CAAC,KAAK,EAAE,WAAW,GAAG,IAAI;IAa/B;;OAEG;IACH,KAAK,IAAI,WAAW;IAepB;;OAEG;IACH,SAAS,IAAI,UAAU;IAgBvB;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,MAAM,EAAE,UAAU,GAAG,WAAW;IAoBnD;;OAEG;IACH,IAAI,KAAK,IAAI,MAAM,CAElB;IAED;;OAEG;IACH,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED;;OAEG;IACH,QAAQ,IAAI,UAAU;CAUvB"}

package/dist/index/BloomFilter.js

@@ -0,0 +1,215 @@
+/**
+ * @nahisaho/yata-scale - Bloom Filter
+ *
+ * Space-efficient probabilistic data structure for membership testing
+ */
+/**
+ * Bloom filter for efficient membership testing
+ */
+export class BloomFilter {
+    bitArray;
+    size;
+    hashCount;
+    itemCount = 0;
+    constructor(config) {
+        this.size = this.calculateSize(config.expectedItems, config.falsePositiveRate);
+        this.hashCount = this.calculateHashCount(this.size, config.expectedItems);
+        this.bitArray = new Uint8Array(Math.ceil(this.size / 8));
+    }
+    /**
+     * Calculate optimal bit array size
+     */
+    calculateSize(n, p) {
+        // m = -n * ln(p) / (ln(2)^2)
+        return Math.ceil((-n * Math.log(p)) / (Math.log(2) ** 2));
+    }
+    /**
+     * Calculate optimal number of hash functions
+     */
+    calculateHashCount(m, n) {
+        // k = (m/n) * ln(2)
+        return Math.ceil((m / n) * Math.log(2));
+    }
+    /**
+     * Add an item to the filter
+     */
+    add(item) {
+        for (let i = 0; i < this.hashCount; i++) {
+            const hash = this.hash(item, i);
+            const index = hash % this.size;
+            this.setBit(index);
+        }
+        this.itemCount++;
+    }
+    /**
+     * Check if an item might be in the filter
+     */
+    mightContain(item) {
+        for (let i = 0; i < this.hashCount; i++) {
+            const hash = this.hash(item, i);
+            const index = hash % this.size;
+            if (!this.getBit(index)) {
+                return false;
+            }
+        }
+        return true;
+    }
+    /**
+     * Hash function using MurmurHash3-like algorithm with seed
+     */
+    hash(item, seed) {
+        let h1 = seed;
+        const c1 = 0xcc9e2d51;
+        const c2 = 0x1b873593;
+        for (let i = 0; i < item.length; i++) {
+            let k1 = item.charCodeAt(i);
+            k1 = Math.imul(k1, c1);
+            k1 = (k1 << 15) | (k1 >>> 17);
+            k1 = Math.imul(k1, c2);
+            h1 ^= k1;
+            h1 = (h1 << 13) | (h1 >>> 19);
+            h1 = Math.imul(h1, 5) + 0xe6546b64;
+        }
+        h1 ^= item.length;
+        h1 ^= h1 >>> 16;
+        h1 = Math.imul(h1, 0x85ebca6b);
+        h1 ^= h1 >>> 13;
+        h1 = Math.imul(h1, 0xc2b2ae35);
+        h1 ^= h1 >>> 16;
+        return h1 >>> 0;
+    }
+    /**
+     * Set a bit in the array
+     */
+    setBit(index) {
+        const byteIndex = Math.floor(index / 8);
+        const bitIndex = index % 8;
+        this.bitArray[byteIndex] |= 1 << bitIndex;
+    }
+    /**
+     * Get a bit from the array
+     */
+    getBit(index) {
+        const byteIndex = Math.floor(index / 8);
+        const bitIndex = index % 8;
+        return (this.bitArray[byteIndex] & (1 << bitIndex)) !== 0;
+    }
+    /**
+     * Clear the filter
+     */
+    clear() {
+        this.bitArray.fill(0);
+        this.itemCount = 0;
+    }
+    /**
+     * Get current false positive rate estimate
+     */
+    getFalsePositiveRate() {
+        // p = (1 - e^(-kn/m))^k
+        const exponent = (-this.hashCount * this.itemCount) / this.size;
+        return Math.pow(1 - Math.exp(exponent), this.hashCount);
+    }
+    /**
+     * Get fill ratio (percentage of bits set)
+     */
+    getFillRatio() {
+        let setBits = 0;
+        for (let i = 0; i < this.bitArray.length; i++) {
+            let byte = this.bitArray[i];
+            while (byte) {
+                setBits += byte & 1;
+                byte >>>= 1;
+            }
+        }
+        return setBits / this.size;
+    }
+    /**
+     * Merge another bloom filter into this one
+     */
+    merge(other) {
+        if (other.size !== this.size) {
+            throw new Error('Cannot merge bloom filters of different sizes');
+        }
+        for (let i = 0; i < this.bitArray.length; i++) {
+            this.bitArray[i] |= other.bitArray[i];
+        }
+        // Item count is approximate after merge
+        this.itemCount += other.itemCount;
+    }
+    /**
+     * Create a copy of this filter
+     */
+    clone() {
+        const copy = new BloomFilter({
+            expectedItems: this.itemCount || 1000,
+            falsePositiveRate: 0.01,
+        });
+        // Replace internals
+        copy.size = this.size;
+        copy.hashCount = this.hashCount;
+        copy.bitArray = new Uint8Array(this.bitArray);
+        copy.itemCount = this.itemCount;
+        return copy;
+    }
+    /**
+     * Serialize to buffer
+     */
+    serialize() {
+        // Header: size (4 bytes) + hashCount (4 bytes) + itemCount (4 bytes)
+        const header = new ArrayBuffer(12);
+        const headerView = new DataView(header);
+        headerView.setUint32(0, this.size, true);
+        headerView.setUint32(4, this.hashCount, true);
+        headerView.setUint32(8, this.itemCount, true);
+        // Combine header and bit array
+        const result = new Uint8Array(12 + this.bitArray.length);
+        result.set(new Uint8Array(header), 0);
+        result.set(this.bitArray, 12);
+        return result;
+    }
+    /**
+     * Deserialize from buffer
+     */
+    static deserialize(buffer) {
+        const headerView = new DataView(buffer.buffer, buffer.byteOffset, 12);
+        const size = headerView.getUint32(0, true);
+        const hashCount = headerView.getUint32(4, true);
+        const itemCount = headerView.getUint32(8, true);
+        const filter = new BloomFilter({
+            expectedItems: 1000,
+            falsePositiveRate: 0.01,
+        });
+        // Replace internals
+        filter.size = size;
+        filter.hashCount = hashCount;
+        filter.itemCount = itemCount;
+        filter.bitArray = buffer.slice(12);
+        return filter;
+    }
+    /**
+     * Get item count
+     */
+    get count() {
+        return this.itemCount;
+    }
+    /**
+     * Get bit array size in bytes
+     */
+    get sizeBytes() {
+        return this.bitArray.length;
+    }
+    /**
+     * Get index statistics
+     */
+    getStats() {
+        return {
+            name: 'bloom',
+            type: 'bloom',
+            entryCount: this.itemCount,
+            sizeBytes: this.bitArray.length,
+            hitRate: 1 - this.getFalsePositiveRate(),
+            lastUpdated: new Date(),
+        };
+    }
+}
+//# sourceMappingURL=BloomFilter.js.map

package/dist/index/BloomFilter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"BloomFilter.js","sourceRoot":"","sources":["../../src/index/BloomFilter.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;GAEG;AACH,MAAM,OAAO,WAAW;IACd,QAAQ,CAAa;IACZ,IAAI,CAAS;IACb,SAAS,CAAS;IAC3B,SAAS,GAAW,CAAC,CAAC;IAE9B,YAAY,MAAyB;QACnC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,aAAa,EAAE,MAAM,CAAC,iBAAiB,CAAC,CAAC;QAC/E,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,aAAa,CAAC,CAAC;QAC1E,IAAI,CAAC,QAAQ,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACK,aAAa,CAAC,CAAS,EAAE,CAAS;QACxC,6BAA6B;QAC7B,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACK,kBAAkB,CAAC,CAAS,EAAE,CAAS;QAC7C,oBAAoB;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,GAAG,CAAC,IAAY;QACd,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,SAAS,EAAE,CAAC;IACnB,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,IAAY;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;gBACxB,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,IAAI,CAAC,IAAY,EAAE,IAAY;QACrC,IAAI,EAAE,GAAG,IAAI,CAAC;QACd,MAAM,EAAE,GAAG,UAAU,CAAC;QACtB,MAAM,EAAE,GAAG,UAAU,CAAC;QAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACrC,IAAI,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;YAE5B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YACvB,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAEvB,EAAE,IAAI,EAAE,CAAC;YACT,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YAC9B,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,UAAU,CAAC;QACrC,CAAC;QAED,EAAE,IAAI,IAAI,CAAC,MAAM,CAAC;QAClB,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAChB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC/B,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAChB,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC/B,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QAEhB,OAAO,EAAE,KAAK,CAAC,CAAC;IAClB,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,KAAa;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC;IAC5C,CAAC;IAED;;OAEG;IACK,MAAM,CAAC,KAAa;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,KAAK,GAAG,CAAC,CAAC;QAC3B,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,KAAK,CAAC,CAAC;IAC5D,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,oBAAoB;QAClB,wBAAwB;QACxB,MAAM,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC;QAChE,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1D,CAAC;IAED;;OAEG;IACH,YAAY;QACV,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YAC5B,OAAO,IAAI,EAAE,CAAC;gBACZ,OAAO,IAAI,IAAI,GAAG,CAAC,CAAC;gBACpB,IAAI,MAAM,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QACD,OAAO,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC;IAC7B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAkB;QACtB,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC;YAC7B,MAAM,IAAI,KAAK,CAAC,+CAA+C,CAAC,CAAC;QACnE,CAAC;QAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC9C,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QAED,wCAAwC;QACxC,IAAI,CAAC,SAAS,IAAI,KAAK,CAAC,SAAS,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC;YAC3B,aAAa,EAAE,IAAI,CAAC,SAAS,IAAI,IAAI;YACrC,iBAAiB,EAAE,IAAI;SACxB,CAAC,CAAC;QAEH,oBAAoB;QACnB,IAAY,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QAC9B,IAAY,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QACxC,IAAY,CAAC,QAAQ,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtD,IAAY,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC;QAEzC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,SAAS;QACP,qEAAqE;QACrE,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,UAAU,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxC,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACzC,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAC9C,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QAE9C,+BAA+B;QAC/B,MAAM,MAAM,GAAG,IAAI,UAAU,CAAC,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,CAAC,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QAE9B,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,MAAM,CAAC,WAAW,CAAC,MAAkB;QACnC,MAAM,UAAU,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;QACtE,MAAM,IAAI,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAC3C,MAAM,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAChD,MAAM,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;QAEhD,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC;YAC7B,aAAa,EAAE,IAAI;YACnB,iBAAiB,EAAE,IAAI;SACxB,CAAC,CAAC;QAEH,oBAAoB;QACnB,MAAc,CAAC,IAAI,GAAG,IAAI,CAAC;QAC3B,MAAc,CAAC,SAAS,GAAG,SAAS,CAAC;QACrC,MAAc,CAAC,SAAS,GAAG,SAAS,CAAC;QACrC,MAAc,CAAC,QAAQ,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAE5C,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,SAAS,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO;YACL,IAAI,EAAE,OAAO;YACb,IAAI,EAAE,OAAO;YACb,UAAU,EAAE,IAAI,CAAC,SAAS;YAC1B,SAAS,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;YAC/B,OAAO,EAAE,CAAC,GAAG,IAAI,CAAC,oBAAoB,EAAE;YACxC,WAAW,EAAE,IAAI,IAAI,EAAE;SACxB,CAAC;IACJ,CAAC;CACF"}