flatsql 3.11.1 → 3.12.0

package/dist/artifacts/index.js

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

package/dist/artifacts/index.js.map

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

package/dist/artifacts/transport.d.ts

@@ -1,5 +0,0 @@
-export declare function sizePrefixedByteLength(buffers: Uint8Array[]): number;
-export declare function writeSizePrefixedStream(target: Uint8Array, buffers: Uint8Array[]): number;
-export declare function forEachSizePrefixedBuffer(stream: Uint8Array, visitor: (buffer: Uint8Array, index: number) => void): number;
-export declare function decodeSizePrefixedStream(stream: Uint8Array): Uint8Array[];
-//# sourceMappingURL=transport.d.ts.map

package/dist/artifacts/transport.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"transport.d.ts","sourceRoot":"","sources":["../../src/artifacts/transport.ts"],"names":[],"mappings":"AAAA,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,MAAM,CAMpE;AAED,wBAAgB,uBAAuB,CAAC,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,MAAM,CAUzF;AAED,wBAAgB,yBAAyB,CACvC,MAAM,EAAE,UAAU,EAClB,OAAO,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,GACnD,MAAM,CAsBR;AAED,wBAAgB,wBAAwB,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,EAAE,CAOzE"}

package/dist/artifacts/transport.js

@@ -1,45 +0,0 @@
-export function sizePrefixedByteLength(buffers) {
-    let totalLength = 0;
-    for (const buffer of buffers) {
-        totalLength += 4 + buffer.length;
-    }
-    return totalLength;
-}
-export function writeSizePrefixedStream(target, buffers) {
-    let offset = 0;
-    const view = new DataView(target.buffer, target.byteOffset, target.byteLength);
-    for (const buffer of buffers) {
-        view.setUint32(offset, buffer.length, true);
-        offset += 4;
-        target.set(buffer, offset);
-        offset += buffer.length;
-    }
-    return offset;
-}
-export function forEachSizePrefixedBuffer(stream, visitor) {
-    const view = new DataView(stream.buffer, stream.byteOffset, stream.byteLength);
-    let offset = 0;
-    let index = 0;
-    while (offset < stream.byteLength) {
-        if (stream.byteLength - offset < 4) {
-            throw new Error(`Invalid size-prefixed stream: truncated frame header at offset ${offset}`);
-        }
-        const size = view.getUint32(offset, true);
-        offset += 4;
-        if (size > stream.byteLength - offset) {
-            throw new Error(`Invalid size-prefixed stream: truncated frame at index ${index}`);
-        }
-        visitor(stream.subarray(offset, offset + size), index);
-        offset += size;
-        index += 1;
-    }
-    return index;
-}
-export function decodeSizePrefixedStream(stream) {
-    const buffers = [];
-    forEachSizePrefixedBuffer(stream, (buffer) => {
-        buffers.push(buffer);
-    });
-    return buffers;
-}
-//# sourceMappingURL=transport.js.map

package/dist/artifacts/transport.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"transport.js","sourceRoot":"","sources":["../../src/artifacts/transport.ts"],"names":[],"mappings":"AAAA,MAAM,UAAU,sBAAsB,CAAC,OAAqB;IAC1D,IAAI,WAAW,GAAG,CAAC,CAAC;IACpB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,WAAW,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACnC,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED,MAAM,UAAU,uBAAuB,CAAC,MAAkB,EAAE,OAAqB;IAC/E,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/E,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC5C,MAAM,IAAI,CAAC,CAAC;QACZ,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC3B,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC;IAC1B,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,MAAM,UAAU,yBAAyB,CACvC,MAAkB,EAClB,OAAoD;IAEpD,MAAM,IAAI,GAAG,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,UAAU,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/E,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,OAAO,MAAM,GAAG,MAAM,CAAC,UAAU,EAAE,CAAC;QAClC,IAAI,MAAM,CAAC,UAAU,GAAG,MAAM,GAAG,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,kEAAkE,MAAM,EAAE,CAAC,CAAC;QAC9F,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,MAAM,IAAI,CAAC,CAAC;QACZ,IAAI,IAAI,GAAG,MAAM,CAAC,UAAU,GAAG,MAAM,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CAAC,0DAA0D,KAAK,EAAE,CAAC,CAAC;QACrF,CAAC;QAED,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC;QACvD,MAAM,IAAI,IAAI,CAAC;QACf,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,MAAkB;IACzD,MAAM,OAAO,GAAiB,EAAE,CAAC;IACjC,yBAAyB,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,EAAE;QAC3C,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/artifacts/types.d.ts

@@ -1,34 +0,0 @@
-import type { DatabaseSchema } from '../schema/index.js';
-export type ArtifactPerformanceProfile = 'fast' | 'safe';
-export interface ArtifactBuilderOptions {
-    sqlitePath: string;
-    name?: string;
-    performanceProfile?: ArtifactPerformanceProfile;
-}
-export interface ArtifactIngestOptions {
-    sourceName?: string;
-    startOffset?: number;
-    offsets?: number[];
-}
-export interface ArtifactQueryResult {
-    columns: string[];
-    rows: any[][];
-    rowCount: number;
-}
-export type ArtifactQueryParams = readonly unknown[] | Record<string, unknown>;
-export interface ArtifactQuerySpec {
-    sql: string;
-    params?: ArtifactQueryParams;
-}
-export type ArtifactTransportMode = 'clone' | 'shared-array-buffer';
-export interface ArtifactIngestResult {
-    recordCount: number;
-    transportMode?: ArtifactTransportMode;
-}
-export interface ArtifactWorkerBuilderOptions extends ArtifactBuilderOptions {
-    preferSharedArrayBuffer?: boolean;
-}
-export interface ParsedArtifactSchema {
-    schema: DatabaseSchema;
-}
-//# sourceMappingURL=types.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../src/artifacts/types.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AAEzD,MAAM,MAAM,0BAA0B,GAAG,MAAM,GAAG,MAAM,CAAC;AAEzD,MAAM,WAAW,sBAAsB;IACrC,UAAU,EAAE,MAAM,CAAC;IACnB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,kBAAkB,CAAC,EAAE,0BAA0B,CAAC;CACjD;AAED,MAAM,WAAW,qBAAqB;IACpC,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;CACpB;AAED,MAAM,WAAW,mBAAmB;IAClC,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,IAAI,EAAE,GAAG,EAAE,EAAE,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,MAAM,mBAAmB,GAAG,SAAS,OAAO,EAAE,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;AAE/E,MAAM,WAAW,iBAAiB;IAChC,GAAG,EAAE,MAAM,CAAC;IACZ,MAAM,CAAC,EAAE,mBAAmB,CAAC;CAC9B;AAED,MAAM,MAAM,qBAAqB,GAAG,OAAO,GAAG,qBAAqB,CAAC;AAEpE,MAAM,WAAW,oBAAoB;IACnC,WAAW,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,qBAAqB,CAAC;CACvC;AAED,MAAM,WAAW,4BAA6B,SAAQ,sBAAsB;IAC1E,uBAAuB,CAAC,EAAE,OAAO,CAAC;CACnC;AAED,MAAM,WAAW,oBAAoB;IACnC,MAAM,EAAE,cAAc,CAAC;CACxB"}

package/dist/artifacts/types.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=types.js.map

package/dist/artifacts/types.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/artifacts/types.ts"],"names":[],"mappings":""}

package/dist/btree/btree.d.ts

@@ -1,34 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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;IA6BlB,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

@@ -1,234 +0,0 @@
-// 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 = [];
-        for (let i = 0; i < node.entries.length; i++) {
-            const entry = node.entries[i];
-            const cmp = compareKeys(key, entry.key, this.config.keyType);
-            if (!node.isLeaf && cmp <= 0) {
-                results.push(...this.searchNode(node.children[i], key));
-            }
-            if (cmp === 0) {
-                results.push(entry);
-            }
-            if (cmp < 0) {
-                return results;
-            }
-        }
-        if (!node.isLeaf) {
-            results.push(...this.searchNode(node.children[node.entries.length], 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

@@ -1 +0,0 @@
-{"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,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,GAAG,GAAG,WAAW,CAAC,GAAG,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAE7D,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC;gBAC7B,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1D,CAAC;YAED,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC;YAED,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;gBACZ,OAAO,OAAO,CAAC;YACjB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YACjB,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QAC5E,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

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

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

@@ -1 +0,0 @@
-{"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

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

package/dist/btree/index.js.map

@@ -1 +0,0 @@
-{"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

@@ -1,36 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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

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

@@ -1 +0,0 @@
-{"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/cluster/index.d.ts

@@ -1,11 +0,0 @@
-export interface ClusterEnvironment {
-    hasSharedArrayBuffer: boolean;
-    hasAtomics: boolean;
-    hasCrossOriginIsolation: boolean;
-    hasOpfs: boolean;
-}
-export declare function detectClusterEnvironment(): ClusterEnvironment;
-export declare function isClusterModeSupported(env?: ClusterEnvironment): boolean;
-export declare function describeClusterSupport(env?: ClusterEnvironment): string;
-export declare function ensureClusterModeSupported(env?: ClusterEnvironment): void;
-//# sourceMappingURL=index.d.ts.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/cluster/index.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,kBAAkB;IACjC,oBAAoB,EAAE,OAAO,CAAC;IAC9B,UAAU,EAAE,OAAO,CAAC;IACpB,uBAAuB,EAAE,OAAO,CAAC;IACjC,OAAO,EAAE,OAAO,CAAC;CAClB;AA2BD,wBAAgB,wBAAwB,IAAI,kBAAkB,CAO7D;AAED,wBAAgB,sBAAsB,CAAC,GAAG,GAAE,kBAA+C,GAAG,OAAO,CAOpG;AAED,wBAAgB,sBAAsB,CAAC,GAAG,GAAE,kBAA+C,GAAG,MAAM,CAoBnG;AAED,wBAAgB,0BAA0B,CAAC,GAAG,GAAE,kBAA+C,GAAG,IAAI,CAIrG"}

package/dist/cluster/index.js

@@ -1,59 +0,0 @@
-function detectSharedArrayBuffer() {
-    return typeof SharedArrayBuffer !== 'undefined';
-}
-function detectAtomics() {
-    return typeof Atomics !== 'undefined';
-}
-function detectCrossOriginIsolation() {
-    const globalAny = globalThis;
-    return globalAny.crossOriginIsolated === true;
-}
-function detectOpfs() {
-    if (typeof navigator !== 'undefined') {
-        const storageManager = navigator.storage;
-        if (storageManager && typeof storageManager.getDirectory === 'function') {
-            return true;
-        }
-    }
-    const globalAny = globalThis;
-    return typeof globalAny.originPrivateFileSystem === 'object' && globalAny.originPrivateFileSystem !== null;
-}
-export function detectClusterEnvironment() {
-    return {
-        hasSharedArrayBuffer: detectSharedArrayBuffer(),
-        hasAtomics: detectAtomics(),
-        hasCrossOriginIsolation: detectCrossOriginIsolation(),
-        hasOpfs: detectOpfs(),
-    };
-}
-export function isClusterModeSupported(env = detectClusterEnvironment()) {
-    return (env.hasSharedArrayBuffer &&
-        env.hasAtomics &&
-        env.hasCrossOriginIsolation &&
-        env.hasOpfs);
-}
-export function describeClusterSupport(env = detectClusterEnvironment()) {
-    const missing = [];
-    if (!env.hasSharedArrayBuffer) {
-        missing.push('SharedArrayBuffer');
-    }
-    if (!env.hasAtomics) {
-        missing.push('Atomics');
-    }
-    if (!env.hasCrossOriginIsolation) {
-        missing.push('cross-origin isolation');
-    }
-    if (!env.hasOpfs) {
-        missing.push('OPFS');
-    }
-    if (missing.length === 0) {
-        return 'Cluster mode supported on this runtime';
-    }
-    return `Cluster mode unsupported: missing ${missing.join(', ')}`;
-}
-export function ensureClusterModeSupported(env = detectClusterEnvironment()) {
-    if (!isClusterModeSupported(env)) {
-        throw new Error(describeClusterSupport(env));
-    }
-}
-//# sourceMappingURL=index.js.map

package/dist/cluster/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/cluster/index.ts"],"names":[],"mappings":"AAWA,SAAS,uBAAuB;IAC9B,OAAO,OAAO,iBAAiB,KAAK,WAAW,CAAC;AAClD,CAAC;AAED,SAAS,aAAa;IACpB,OAAO,OAAO,OAAO,KAAK,WAAW,CAAC;AACxC,CAAC;AAED,SAAS,0BAA0B;IACjC,MAAM,SAAS,GAAG,UAAmE,CAAC;IACtF,OAAO,SAAS,CAAC,mBAAmB,KAAK,IAAI,CAAC;AAChD,CAAC;AAED,SAAS,UAAU;IACjB,IAAI,OAAO,SAAS,KAAK,WAAW,EAAE,CAAC;QACrC,MAAM,cAAc,GAAG,SAAS,CAAC,OAAkD,CAAC;QACpF,IAAI,cAAc,IAAI,OAAO,cAAc,CAAC,YAAY,KAAK,UAAU,EAAE,CAAC;YACxE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,UAAuE,CAAC;IAC1F,OAAO,OAAO,SAAS,CAAC,uBAAuB,KAAK,QAAQ,IAAI,SAAS,CAAC,uBAAuB,KAAK,IAAI,CAAC;AAC7G,CAAC;AAED,MAAM,UAAU,wBAAwB;IACtC,OAAO;QACL,oBAAoB,EAAE,uBAAuB,EAAE;QAC/C,UAAU,EAAE,aAAa,EAAE;QAC3B,uBAAuB,EAAE,0BAA0B,EAAE;QACrD,OAAO,EAAE,UAAU,EAAE;KACtB,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAA0B,wBAAwB,EAAE;IACzF,OAAO,CACL,GAAG,CAAC,oBAAoB;QACxB,GAAG,CAAC,UAAU;QACd,GAAG,CAAC,uBAAuB;QAC3B,GAAG,CAAC,OAAO,CACZ,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,MAA0B,wBAAwB,EAAE;IACzF,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,CAAC;QAC9B,OAAO,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;IACpC,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC;QACpB,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC1B,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,uBAAuB,EAAE,CAAC;QACjC,OAAO,CAAC,IAAI,CAAC,wBAAwB,CAAC,CAAC;IACzC,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,CAAC;QACjB,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvB,CAAC;IAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACzB,OAAO,wCAAwC,CAAC;IAClD,CAAC;IAED,OAAO,qCAAqC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,MAA0B,wBAAwB,EAAE;IAC7F,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,EAAE,CAAC;QACjC,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,GAAG,CAAC,CAAC,CAAC;IAC/C,CAAC;AACH,CAAC"}

package/dist/response/artifact.d.ts

@@ -1,4 +0,0 @@
-import type { QueryResult, QueryResponseArtifact, QueryResponseArtifactOptions } from './types.js';
-export declare function createQueryResponseArtifact(result: QueryResult, options: QueryResponseArtifactOptions): QueryResponseArtifact;
-export declare function getResponseArtifactChunk(artifact: QueryResponseArtifact, index: number): Uint8Array;
-//# sourceMappingURL=artifact.d.ts.map

package/dist/response/artifact.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"artifact.d.ts","sourceRoot":"","sources":["../../src/response/artifact.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,WAAW,EACX,qBAAqB,EAErB,4BAA4B,EAE7B,MAAM,YAAY,CAAC;AA0EpB,wBAAgB,2BAA2B,CACzC,MAAM,EAAE,WAAW,EACnB,OAAO,EAAE,4BAA4B,GACpC,qBAAqB,CA6BvB;AAED,wBAAgB,wBAAwB,CAAC,QAAQ,EAAE,qBAAqB,EAAE,KAAK,EAAE,MAAM,GAAG,UAAU,CAMnG"}