flatsql 0.2.0

package/dist/btree/btree.d.ts

@@ -0,0 +1,34 @@
+import { BTreeConfig, BTreeNode, BTreeStats, IndexEntry } from './types.js';
+export declare class BTree {
+    private config;
+    private nodes;
+    private rootId;
+    private nextNodeId;
+    private entryCount;
+    constructor(config: BTreeConfig);
+    private createNode;
+    private getNode;
+    insert(key: IndexEntry['key'], dataOffset: bigint, dataLength: number, sequence: bigint): void;
+    private insertNonFull;
+    private splitChild;
+    search(key: IndexEntry['key']): IndexEntry[];
+    private searchNode;
+    range(minKey: IndexEntry['key'], maxKey: IndexEntry['key']): IndexEntry[];
+    private rangeSearch;
+    all(): IndexEntry[];
+    private collectAll;
+    getStats(): BTreeStats;
+    private getHeight;
+    serialize(): {
+        config: BTreeConfig;
+        rootId: bigint;
+        nodes: BTreeNode[];
+        stats: BTreeStats;
+    };
+    static deserialize(data: {
+        config: BTreeConfig;
+        rootId: bigint;
+        nodes: BTreeNode[];
+    }): BTree;
+}
+//# sourceMappingURL=btree.d.ts.map

package/dist/btree/btree.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"btree.d.ts","sourceRoot":"","sources":["../../src/btree/btree.ts"],"names":[],"mappings":"AAGA,OAAO,EACL,WAAW,EACX,SAAS,EACT,UAAU,EACV,UAAU,EAIX,MAAM,YAAY,CAAC;AAEpB,qBAAa,KAAK;IAChB,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,KAAK,CAAqC;IAClD,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,UAAU,CAAc;IAChC,OAAO,CAAC,UAAU,CAAc;gBAEpB,MAAM,EAAE,WAAW;IAM/B,OAAO,CAAC,UAAU;IAalB,OAAO,CAAC,OAAO;IASf,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,IAAI;IA+B9F,OAAO,CAAC,aAAa;IAmCrB,OAAO,CAAC,UAAU;IA6BlB,MAAM,CAAC,GAAG,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,EAAE;IAI5C,OAAO,CAAC,UAAU;IA4BlB,KAAK,CAAC,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,MAAM,EAAE,UAAU,CAAC,KAAK,CAAC,GAAG,UAAU,EAAE;IAMzE,OAAO,CAAC,WAAW;IAwCnB,GAAG,IAAI,UAAU,EAAE;IAMnB,OAAO,CAAC,UAAU;IAgBlB,QAAQ,IAAI,UAAU;IAQtB,OAAO,CAAC,SAAS;IASjB,SAAS,IAAI;QACX,MAAM,EAAE,WAAW,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,EAAE,SAAS,EAAE,CAAC;QACnB,KAAK,EAAE,UAAU,CAAC;KACnB;IAUD,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE;QACvB,MAAM,EAAE,WAAW,CAAC;QACpB,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,EAAE,SAAS,EAAE,CAAC;KACpB,GAAG,KAAK;CAuBV"}

package/dist/btree/btree.js

@@ -0,0 +1,235 @@
+// In-memory B-Tree implementation for FlatBuffers-SQLite
+// This indexes into offsets in the stacked FlatBuffer data file
+import { compareKeys, } from './types.js';
+export class BTree {
+    config;
+    nodes = new Map();
+    rootId = 0n;
+    nextNodeId = 1n;
+    entryCount = 0n;
+    constructor(config) {
+        this.config = config;
+        // Create initial empty root (leaf)
+        this.rootId = this.createNode(true, 0n);
+    }
+    createNode(isLeaf, parentId) {
+        const nodeId = this.nextNodeId++;
+        const node = {
+            nodeId,
+            isLeaf,
+            entries: [],
+            children: [],
+            parentId,
+        };
+        this.nodes.set(nodeId, node);
+        return nodeId;
+    }
+    getNode(nodeId) {
+        const node = this.nodes.get(nodeId);
+        if (!node) {
+            throw new Error(`Node ${nodeId} not found`);
+        }
+        return node;
+    }
+    // Insert a new entry into the B-tree
+    insert(key, dataOffset, dataLength, sequence) {
+        const entry = {
+            keyType: this.config.keyType,
+            key,
+            dataOffset,
+            dataLength,
+            sequence,
+        };
+        const root = this.getNode(this.rootId);
+        // If root is full, split it first
+        if (root.entries.length >= this.config.order - 1) {
+            // Create new root
+            const newRootId = this.createNode(false, 0n);
+            const newRoot = this.getNode(newRootId);
+            newRoot.children.push(this.rootId);
+            // Update old root's parent
+            root.parentId = newRootId;
+            // Split the old root
+            this.splitChild(newRootId, 0);
+            this.rootId = newRootId;
+        }
+        this.insertNonFull(this.rootId, entry);
+        this.entryCount++;
+    }
+    insertNonFull(nodeId, entry) {
+        const node = this.getNode(nodeId);
+        if (node.isLeaf) {
+            // Find position to insert
+            let i = node.entries.length - 1;
+            while (i >= 0 && compareKeys(entry.key, node.entries[i].key, this.config.keyType) < 0) {
+                i--;
+            }
+            // Insert at position i + 1
+            node.entries.splice(i + 1, 0, entry);
+        }
+        else {
+            // Find child to descend into
+            let i = node.entries.length - 1;
+            while (i >= 0 && compareKeys(entry.key, node.entries[i].key, this.config.keyType) < 0) {
+                i--;
+            }
+            i++;
+            const childId = node.children[i];
+            const child = this.getNode(childId);
+            // If child is full, split it
+            if (child.entries.length >= this.config.order - 1) {
+                this.splitChild(nodeId, i);
+                // After split, determine which child to use
+                if (compareKeys(entry.key, node.entries[i].key, this.config.keyType) > 0) {
+                    i++;
+                }
+            }
+            this.insertNonFull(node.children[i], entry);
+        }
+    }
+    splitChild(parentId, childIndex) {
+        const parent = this.getNode(parentId);
+        const child = this.getNode(parent.children[childIndex]);
+        const mid = Math.floor((this.config.order - 1) / 2);
+        // Create new sibling node
+        const siblingId = this.createNode(child.isLeaf, parentId);
+        const sibling = this.getNode(siblingId);
+        // Move second half of entries to sibling
+        sibling.entries = child.entries.splice(mid + 1);
+        const midEntry = child.entries.pop();
+        // If not leaf, move children too
+        if (!child.isLeaf) {
+            sibling.children = child.children.splice(mid + 1);
+            // Update parent references for moved children
+            for (const sibChildId of sibling.children) {
+                const sibChild = this.getNode(sibChildId);
+                sibChild.parentId = siblingId;
+            }
+        }
+        // Insert mid entry and sibling into parent
+        parent.entries.splice(childIndex, 0, midEntry);
+        parent.children.splice(childIndex + 1, 0, siblingId);
+    }
+    // Search for entries matching a key
+    search(key) {
+        return this.searchNode(this.rootId, key);
+    }
+    searchNode(nodeId, key) {
+        const node = this.getNode(nodeId);
+        const results = [];
+        let i = 0;
+        while (i < node.entries.length && compareKeys(key, node.entries[i].key, this.config.keyType) > 0) {
+            i++;
+        }
+        // Collect all matching entries (handles duplicates)
+        while (i < node.entries.length && compareKeys(key, node.entries[i].key, this.config.keyType) === 0) {
+            results.push(node.entries[i]);
+            i++;
+        }
+        if (!node.isLeaf) {
+            // Search appropriate child
+            let childIdx = 0;
+            while (childIdx < node.entries.length && compareKeys(key, node.entries[childIdx].key, this.config.keyType) > 0) {
+                childIdx++;
+            }
+            results.push(...this.searchNode(node.children[childIdx], key));
+        }
+        return results;
+    }
+    // Range query: find all entries where minKey <= key <= maxKey
+    range(minKey, maxKey) {
+        const results = [];
+        this.rangeSearch(this.rootId, minKey, maxKey, results);
+        return results;
+    }
+    rangeSearch(nodeId, minKey, maxKey, results) {
+        const node = this.getNode(nodeId);
+        // Find first entry that might be in range
+        let i = 0;
+        while (i < node.entries.length) {
+            const entry = node.entries[i];
+            const cmpMin = compareKeys(entry.key, minKey, this.config.keyType);
+            const cmpMax = compareKeys(entry.key, maxKey, this.config.keyType);
+            // Visit left child if it might contain entries in range
+            if (!node.isLeaf && cmpMin >= 0) {
+                this.rangeSearch(node.children[i], minKey, maxKey, results);
+            }
+            // Add entry if in range
+            if (cmpMin >= 0 && cmpMax <= 0) {
+                results.push(entry);
+            }
+            // Stop if we're past maxKey
+            if (cmpMax > 0) {
+                break;
+            }
+            i++;
+        }
+        // Visit the rightmost child if we haven't stopped early
+        if (!node.isLeaf && i === node.entries.length && node.children.length > i) {
+            this.rangeSearch(node.children[i], minKey, maxKey, results);
+        }
+    }
+    // Get all entries (full scan)
+    all() {
+        const results = [];
+        this.collectAll(this.rootId, results);
+        return results;
+    }
+    collectAll(nodeId, results) {
+        const node = this.getNode(nodeId);
+        for (let i = 0; i < node.entries.length; i++) {
+            if (!node.isLeaf) {
+                this.collectAll(node.children[i], results);
+            }
+            results.push(node.entries[i]);
+        }
+        if (!node.isLeaf && node.children.length > node.entries.length) {
+            this.collectAll(node.children[node.children.length - 1], results);
+        }
+    }
+    // Get tree statistics
+    getStats() {
+        return {
+            entryCount: this.entryCount,
+            height: this.getHeight(this.rootId),
+            nodeCount: this.nodes.size,
+        };
+    }
+    getHeight(nodeId) {
+        const node = this.getNode(nodeId);
+        if (node.isLeaf) {
+            return 1;
+        }
+        return 1 + this.getHeight(node.children[0]);
+    }
+    // Serialize the B-tree to a format suitable for FlatBuffer storage
+    serialize() {
+        return {
+            config: this.config,
+            rootId: this.rootId,
+            nodes: Array.from(this.nodes.values()),
+            stats: this.getStats(),
+        };
+    }
+    // Restore a B-tree from serialized data
+    static deserialize(data) {
+        const tree = new BTree(data.config);
+        tree.nodes.clear();
+        tree.rootId = data.rootId;
+        let maxId = 0n;
+        let entryCount = 0n;
+        for (const node of data.nodes) {
+            tree.nodes.set(node.nodeId, node);
+            if (node.nodeId > maxId) {
+                maxId = node.nodeId;
+            }
+            if (node.isLeaf) {
+                entryCount += BigInt(node.entries.length);
+            }
+        }
+        tree.nextNodeId = maxId + 1n;
+        tree.entryCount = entryCount;
+        return tree;
+    }
+}
+//# sourceMappingURL=btree.js.map

package/dist/btree/btree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"btree.js","sourceRoot":"","sources":["../../src/btree/btree.ts"],"names":[],"mappings":"AAAA,yDAAyD;AACzD,gEAAgE;AAEhE,OAAO,EAML,WAAW,GAEZ,MAAM,YAAY,CAAC;AAEpB,MAAM,OAAO,KAAK;IACR,MAAM,CAAc;IACpB,KAAK,GAA2B,IAAI,GAAG,EAAE,CAAC;IAC1C,MAAM,GAAW,EAAE,CAAC;IACpB,UAAU,GAAW,EAAE,CAAC;IACxB,UAAU,GAAW,EAAE,CAAC;IAEhC,YAAY,MAAmB;QAC7B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,mCAAmC;QACnC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IAC1C,CAAC;IAEO,UAAU,CAAC,MAAe,EAAE,QAAgB;QAClD,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,EAAE,CAAC;QACjC,MAAM,IAAI,GAAc;YACtB,MAAM;YACN,MAAM;YACN,OAAO,EAAE,EAAE;YACX,QAAQ,EAAE,EAAE;YACZ,QAAQ;SACT,CAAC;QACF,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,OAAO,CAAC,MAAc;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,YAAY,CAAC,CAAC;QAC9C,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,qCAAqC;IACrC,MAAM,CAAC,GAAsB,EAAE,UAAkB,EAAE,UAAkB,EAAE,QAAgB;QACrF,MAAM,KAAK,GAAe;YACxB,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO;YAC5B,GAAG;YACH,UAAU;YACV,UAAU;YACV,QAAQ;SACT,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEvC,kCAAkC;QAClC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACjD,kBAAkB;YAClB,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC7C,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;YACxC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAEnC,2BAA2B;YAC3B,IAAI,CAAC,QAAQ,GAAG,SAAS,CAAC;YAE1B,qBAAqB;YACrB,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC;YAE9B,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC;QAC1B,CAAC;QAED,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACvC,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAEO,aAAa,CAAC,MAAc,EAAE,KAAiB;QACrD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAElC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,0BAA0B;YAC1B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAChC,OAAO,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtF,CAAC,EAAE,CAAC;YACN,CAAC;YACD,2BAA2B;YAC3B,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;aAAM,CAAC;YACN,6BAA6B;YAC7B,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;YAChC,OAAO,CAAC,IAAI,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtF,CAAC,EAAE,CAAC;YACN,CAAC;YACD,CAAC,EAAE,CAAC;YAEJ,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;YACjC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;YAEpC,6BAA6B;YAC7B,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;gBAClD,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;gBAC3B,4CAA4C;gBAC5C,IAAI,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzE,CAAC,EAAE,CAAC;gBACN,CAAC;YACH,CAAC;YAED,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAEO,UAAU,CAAC,QAAgB,EAAE,UAAkB;QACrD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,CAAC;QACxD,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAEpD,0BAA0B;QAC1B,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAC1D,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAExC,yCAAyC;QACzC,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;QAChD,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAG,CAAC;QAEtC,iCAAiC;QACjC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YAClB,OAAO,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;YAClD,8CAA8C;YAC9C,KAAK,MAAM,UAAU,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;gBAC1C,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;gBAC1C,QAAQ,CAAC,QAAQ,GAAG,SAAS,CAAC;YAChC,CAAC;QACH,CAAC;QAED,2CAA2C;QAC3C,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC/C,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IACvD,CAAC;IAED,oCAAoC;IACpC,MAAM,CAAC,GAAsB;QAC3B,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAC3C,CAAC;IAEO,UAAU,CAAC,MAAc,EAAE,GAAsB;QACvD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,OAAO,GAAiB,EAAE,CAAC;QAEjC,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;YACjG,CAAC,EAAE,CAAC;QACN,CAAC;QAED,oDAAoD;QACpD,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACnG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9B,CAAC,EAAE,CAAC;QACN,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,2BAA2B;YAC3B,IAAI,QAAQ,GAAG,CAAC,CAAC;YACjB,OAAO,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,WAAW,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/G,QAAQ,EAAE,CAAC;YACb,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACjE,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,8DAA8D;IAC9D,KAAK,CAAC,MAAyB,EAAE,MAAyB;QACxD,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QACvD,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,WAAW,CACjB,MAAc,EACd,MAAyB,EACzB,MAAyB,EACzB,OAAqB;QAErB,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAElC,0CAA0C;QAC1C,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YACnE,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAEnE,wDAAwD;YACxD,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;YAC9D,CAAC;YAED,wBAAwB;YACxB,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,CAAC,EAAE,CAAC;gBAC/B,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;YAED,4BAA4B;YAC5B,IAAI,MAAM,GAAG,CAAC,EAAE,CAAC;gBACf,MAAM;YACR,CAAC;YAED,CAAC,EAAE,CAAC;QACN,CAAC;QAED,wDAAwD;QACxD,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,GAAG;QACD,MAAM,OAAO,GAAiB,EAAE,CAAC;QACjC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACtC,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,UAAU,CAAC,MAAc,EAAE,OAAqB;QACtD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAElC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACjB,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC7C,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC/D,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;QACpE,CAAC;IACH,CAAC;IAED,sBAAsB;IACtB,QAAQ;QACN,OAAO;YACL,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC;YACnC,SAAS,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;SAC3B,CAAC;IACJ,CAAC;IAEO,SAAS,CAAC,MAAc;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAClC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChB,OAAO,CAAC,CAAC;QACX,CAAC;QACD,OAAO,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,mEAAmE;IACnE,SAAS;QAMP,OAAO;YACL,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACtC,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE;SACvB,CAAC;IACJ,CAAC;IAED,wCAAwC;IACxC,MAAM,CAAC,WAAW,CAAC,IAIlB;QACC,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;QAE1B,IAAI,KAAK,GAAG,EAAE,CAAC;QACf,IAAI,UAAU,GAAG,EAAE,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YAClC,IAAI,IAAI,CAAC,MAAM,GAAG,KAAK,EAAE,CAAC;gBACxB,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,CAAC;YACD,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;gBAChB,UAAU,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;QAED,IAAI,CAAC,UAAU,GAAG,KAAK,GAAG,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAE7B,OAAO,IAAI,CAAC;IACd,CAAC;CACF"}

package/dist/btree/index.d.ts

@@ -0,0 +1,3 @@
+export * from './types.js';
+export * from './btree.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/btree/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}

package/dist/btree/index.js

@@ -0,0 +1,3 @@
+export * from './types.js';
+export * from './btree.js';
+//# sourceMappingURL=index.js.map

package/dist/btree/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/btree/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}

package/dist/btree/types.d.ts

@@ -0,0 +1,36 @@
+export declare enum KeyType {
+    Null = 0,
+    Int = 1,
+    Float = 2,
+    String = 3,
+    Bytes = 4
+}
+export interface IndexEntry {
+    keyType: KeyType;
+    key: number | string | Uint8Array | null;
+    dataOffset: bigint;
+    dataLength: number;
+    sequence: bigint;
+}
+export interface BTreeNode {
+    nodeId: bigint;
+    isLeaf: boolean;
+    entries: IndexEntry[];
+    children: bigint[];
+    parentId: bigint;
+}
+export interface BTreeConfig {
+    name: string;
+    tableName: string;
+    columnName: string;
+    keyType: KeyType;
+    order: number;
+}
+export interface BTreeStats {
+    entryCount: bigint;
+    height: number;
+    nodeCount: number;
+}
+export type CompareResult = -1 | 0 | 1;
+export declare function compareKeys(a: IndexEntry['key'], b: IndexEntry['key'], keyType: KeyType): CompareResult;
+//# sourceMappingURL=types.d.ts.map

package/dist/btree/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/btree/types.ts"],"names":[],"mappings":"AAEA,oBAAY,OAAO;IACjB,IAAI,IAAI;IACR,GAAG,IAAI;IACP,KAAK,IAAI;IACT,MAAM,IAAI;IACV,KAAK,IAAI;CACV;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,OAAO,CAAC;IACjB,GAAG,EAAE,MAAM,GAAG,MAAM,GAAG,UAAU,GAAG,IAAI,CAAC;IACzC,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,SAAS;IACxB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,OAAO,CAAC;IAChB,OAAO,EAAE,UAAU,EAAE,CAAC;IACtB,QAAQ,EAAE,MAAM,EAAE,CAAC;IACnB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,WAAW;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,OAAO,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,MAAM,EAAE,MAAM,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;CACnB;AAGD,MAAM,MAAM,aAAa,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAGvC,wBAAgB,WAAW,CAAC,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,EAAE,OAAO,EAAE,OAAO,GAAG,aAAa,CAoCvG"}

package/dist/btree/types.js

@@ -0,0 +1,55 @@
+// B-Tree types for FlatBuffers-SQLite
+export var KeyType;
+(function (KeyType) {
+    KeyType[KeyType["Null"] = 0] = "Null";
+    KeyType[KeyType["Int"] = 1] = "Int";
+    KeyType[KeyType["Float"] = 2] = "Float";
+    KeyType[KeyType["String"] = 3] = "String";
+    KeyType[KeyType["Bytes"] = 4] = "Bytes";
+})(KeyType || (KeyType = {}));
+// Compare two keys of the same type
+export function compareKeys(a, b, keyType) {
+    if (a === null && b === null)
+        return 0;
+    if (a === null)
+        return -1;
+    if (b === null)
+        return 1;
+    switch (keyType) {
+        case KeyType.Int:
+        case KeyType.Float:
+            const numA = a;
+            const numB = b;
+            if (numA < numB)
+                return -1;
+            if (numA > numB)
+                return 1;
+            return 0;
+        case KeyType.String:
+            const strA = a;
+            const strB = b;
+            if (strA < strB)
+                return -1;
+            if (strA > strB)
+                return 1;
+            return 0;
+        case KeyType.Bytes:
+            const bytesA = a;
+            const bytesB = b;
+            const minLen = Math.min(bytesA.length, bytesB.length);
+            for (let i = 0; i < minLen; i++) {
+                if (bytesA[i] < bytesB[i])
+                    return -1;
+                if (bytesA[i] > bytesB[i])
+                    return 1;
+            }
+            if (bytesA.length < bytesB.length)
+                return -1;
+            if (bytesA.length > bytesB.length)
+                return 1;
+            return 0;
+        default:
+            return 0;
+    }
+}
+//# sourceMappingURL=types.js.map

package/dist/btree/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/btree/types.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAEtC,MAAM,CAAN,IAAY,OAMX;AAND,WAAY,OAAO;IACjB,qCAAQ,CAAA;IACR,mCAAO,CAAA;IACP,uCAAS,CAAA;IACT,yCAAU,CAAA;IACV,uCAAS,CAAA;AACX,CAAC,EANW,OAAO,KAAP,OAAO,QAMlB;AAmCD,oCAAoC;AACpC,MAAM,UAAU,WAAW,CAAC,CAAoB,EAAE,CAAoB,EAAE,OAAgB;IACtF,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC,CAAC;IAC1B,IAAI,CAAC,KAAK,IAAI;QAAE,OAAO,CAAC,CAAC;IAEzB,QAAQ,OAAO,EAAE,CAAC;QAChB,KAAK,OAAO,CAAC,GAAG,CAAC;QACjB,KAAK,OAAO,CAAC,KAAK;YAChB,MAAM,IAAI,GAAG,CAAW,CAAC;YACzB,MAAM,IAAI,GAAG,CAAW,CAAC;YACzB,IAAI,IAAI,GAAG,IAAI;gBAAE,OAAO,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,GAAG,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC1B,OAAO,CAAC,CAAC;QAEX,KAAK,OAAO,CAAC,MAAM;YACjB,MAAM,IAAI,GAAG,CAAW,CAAC;YACzB,MAAM,IAAI,GAAG,CAAW,CAAC;YACzB,IAAI,IAAI,GAAG,IAAI;gBAAE,OAAO,CAAC,CAAC,CAAC;YAC3B,IAAI,IAAI,GAAG,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC1B,OAAO,CAAC,CAAC;QAEX,KAAK,OAAO,CAAC,KAAK;YAChB,MAAM,MAAM,GAAG,CAAe,CAAC;YAC/B,MAAM,MAAM,GAAG,CAAe,CAAC;YAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YACtD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAChC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC,CAAC;gBACrC,IAAI,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC;oBAAE,OAAO,CAAC,CAAC;YACtC,CAAC;YACD,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;gBAAE,OAAO,CAAC,CAAC,CAAC;YAC7C,IAAI,MAAM,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM;gBAAE,OAAO,CAAC,CAAC;YAC5C,OAAO,CAAC,CAAC;QAEX;YACE,OAAO,CAAC,CAAC;IACb,CAAC;AACH,CAAC"}

package/dist/core/database.d.ts

@@ -0,0 +1,45 @@
+import { DatabaseSchema, TableDef } from '../schema/index.js';
+export interface QueryResult {
+    columns: string[];
+    rows: any[][];
+    rowCount: number;
+}
+export interface FlatBufferAccessor {
+    getField(data: Uint8Array, path: string[]): any;
+    buildBuffer(tableName: string, fields: Record<string, any>): Uint8Array;
+}
+export interface DatabaseOptions {
+    /** Maximum SQL query length (default: 10000) */
+    maxSqlLength?: number;
+    /** Maximum queries per second, 0 for unlimited (default: 0) */
+    rateLimit?: number;
+}
+export declare class FlatSQLDatabase {
+    private schema;
+    private storage;
+    private tables;
+    private accessor;
+    private maxSqlLength;
+    private rateLimit;
+    private queryTimestamps;
+    constructor(schema: DatabaseSchema, accessor: FlatBufferAccessor, options?: DatabaseOptions);
+    static fromSchema(source: string, accessor: FlatBufferAccessor, name?: string, options?: DatabaseOptions): FlatSQLDatabase;
+    insert(tableName: string, data: Record<string, any>): bigint;
+    insertRaw(tableName: string, flatbufferData: Uint8Array): bigint;
+    stream(tableName: string, flatbuffers: Iterable<Uint8Array>): bigint[];
+    query(sql: string): QueryResult;
+    private parseSQL;
+    private parseValue;
+    private enforceRateLimit;
+    private evaluateCondition;
+    getTableDef(tableName: string): TableDef | undefined;
+    listTables(): string[];
+    exportData(): Uint8Array;
+    getSchema(): DatabaseSchema;
+    getStats(): {
+        tableName: string;
+        recordCount: bigint;
+        indexes: string[];
+    }[];
+}
+//# sourceMappingURL=database.d.ts.map

package/dist/core/database.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"database.d.ts","sourceRoot":"","sources":["../../src/core/database.ts"],"names":[],"mappings":"AAKA,OAAO,EAAE,cAAc,EAAE,QAAQ,EAAe,MAAM,oBAAoB,CAAC;AAS3E,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,kBAAkB;IAEjC,QAAQ,CAAC,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,GAAG,CAAC;IAEhD,WAAW,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,UAAU,CAAC;CACzE;AAED,MAAM,WAAW,eAAe;IAC9B,gDAAgD;IAChD,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB,+DAA+D;IAC/D,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,qBAAa,eAAe;IAC1B,OAAO,CAAC,MAAM,CAAiB;IAC/B,OAAO,CAAC,OAAO,CAAyB;IACxC,OAAO,CAAC,MAAM,CAAsC;IACpD,OAAO,CAAC,QAAQ,CAAqB;IAGrC,OAAO,CAAC,YAAY,CAAS;IAC7B,OAAO,CAAC,SAAS,CAAS;IAC1B,OAAO,CAAC,eAAe,CAAgB;gBAE3B,MAAM,EAAE,cAAc,EAAE,QAAQ,EAAE,kBAAkB,EAAE,OAAO,GAAE,eAAoB;IAmB/F,MAAM,CAAC,UAAU,CACf,MAAM,EAAE,MAAM,EACd,QAAQ,EAAE,kBAAkB,EAC5B,IAAI,GAAE,MAAkB,EACxB,OAAO,GAAE,eAAoB,GAC5B,eAAe;IAMlB,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,GAAG,CAAC,GAAG,MAAM;IAW5D,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,cAAc,EAAE,UAAU,GAAG,MAAM;IAUhE,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,QAAQ,CAAC,UAAU,CAAC,GAAG,MAAM,EAAE;IAYtE,KAAK,CAAC,GAAG,EAAE,MAAM,GAAG,WAAW;IAkE/B,OAAO,CAAC,QAAQ;IAkDhB,OAAO,CAAC,UAAU;IAkClB,OAAO,CAAC,gBAAgB;IAcxB,OAAO,CAAC,iBAAiB;IAqBzB,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,QAAQ,GAAG,SAAS;IAKpD,UAAU,IAAI,MAAM,EAAE;IAKtB,UAAU,IAAI,UAAU;IAKxB,SAAS,IAAI,cAAc;IAK3B,QAAQ,IAAI;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,WAAW,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE,EAAE;CAO5E"}