@minnowdb/core 0.0.1 → 0.1.0

package/dist/engine/group-index.js

@@ -0,0 +1,366 @@
+const INITIAL_ENTRY_CAPACITY = 4;
+const INITIAL_BUCKET_CAPACITY = 8;
+const INITIAL_KEY_CAPACITY = 32;
+const INDEX_FIELDS = 4;
+const UINT32_BYTES = Uint32Array.BYTES_PER_ELEMENT;
+const INITIAL_SCRATCH_CAPACITY = 64;
+const REPLACEMENT_CHARACTER_BYTES = [0xef, 0xbf, 0xbd];
+// Every probe encodes its key into this shared scratch arena instead of allocating a fresh buffer
+// per row. Encoding is synchronous and the bytes are consumed before the next probe begins, so a
+// single arena serves every index; the miss path copies out of it before any caller code runs.
+let scratch = new Uint8Array(INITIAL_SCRATCH_CAPACITY);
+let scratchView = new DataView(scratch.buffer);
+// The arena grows to fit the largest key ever encoded, so a single pathological key (a
+// multi-megabyte string) would otherwise pin that memory for the life of the process — hostile
+// to low-end devices. Each fresh encoding starts by shedding anything beyond the retention cap;
+// ordinary keys never reach it, so the check is one branch per operation.
+const SCRATCH_RETAIN_BYTES = 1024 * 1024;
+function reclaimScratch() {
+    if (scratch.byteLength <= SCRATCH_RETAIN_BYTES)
+        return;
+    scratch = new Uint8Array(SCRATCH_RETAIN_BYTES);
+    scratchView = new DataView(scratch.buffer);
+}
+/** Byte-addressable, insertion-ordered grouping index with fully reserved typed storage. */
+export class ByteGroupIndex {
+    #memory;
+    #values = [];
+    #buckets = new Int32Array(0);
+    #hashes = new Uint32Array(0);
+    #offsets = new Uint32Array(0);
+    #lengths = new Uint32Array(0);
+    #next = new Int32Array(0);
+    #keys = new Uint8Array(0);
+    #keyLength = 0;
+    #entryReservation;
+    #bucketReservation;
+    #keyReservation;
+    constructor(memory) {
+        this.#memory = memory;
+    }
+    get size() {
+        return this.#values.length;
+    }
+    get(keys) {
+        const length = encodeGroupKey(keys);
+        const index = this.#find(length, hashScratch(length));
+        return index < 0 ? undefined : this.#values[index];
+    }
+    getEmpty() {
+        return this.get([]);
+    }
+    getOne(key) {
+        const length = encodeSingleGroupKey(key);
+        const index = this.#find(length, hashScratch(length));
+        return index < 0 ? undefined : this.#values[index];
+    }
+    set(keys, value) {
+        const length = encodeGroupKey(keys);
+        const hash = hashScratch(length);
+        const existing = this.#find(length, hash);
+        if (existing >= 0) {
+            this.#values[existing] = value;
+            return;
+        }
+        this.#insert(scratch.slice(0, length), hash, value);
+    }
+    getOrInsert(keys, create) {
+        const length = encodeGroupKey(keys);
+        return this.#getOrInsertScratch(length, create);
+    }
+    getOrInsertOne(key, create) {
+        const length = encodeSingleGroupKey(key);
+        return this.#getOrInsertScratch(length, create);
+    }
+    /**
+     * Resolves the key currently held in the scratch arena. A hit touches no allocation at all; a
+     * miss — at most one per distinct group — copies the key out before `create` runs, so caller
+     * code can never observe or disturb the shared arena.
+     */
+    #getOrInsertScratch(length, create) {
+        const hash = hashScratch(length);
+        const existing = this.#find(length, hash);
+        if (existing >= 0)
+            return this.#values[existing];
+        const encoded = scratch.slice(0, length);
+        const value = create();
+        this.#insert(encoded, hash, value);
+        return value;
+    }
+    #insert(encoded, hash, value) {
+        const index = this.#values.length;
+        this.#ensureEntryCapacity(index + 1);
+        this.#ensureBucketCapacity(index + 1);
+        this.#ensureKeyCapacity(encoded.byteLength);
+        const offset = this.#keyLength;
+        this.#keys.set(encoded, offset);
+        this.#keyLength += encoded.byteLength;
+        this.#hashes[index] = hash;
+        this.#offsets[index] = offset;
+        this.#lengths[index] = encoded.byteLength;
+        const bucket = hash & (this.#buckets.length - 1);
+        this.#next[index] = this.#buckets[bucket] ?? -1;
+        this.#buckets[bucket] = index;
+        this.#values.push(value);
+    }
+    setEmpty(value) {
+        this.set([], value);
+    }
+    setOne(key, value) {
+        this.set([key], value);
+    }
+    values() {
+        return this.#values;
+    }
+    /** Matches the scratch arena's first `length` bytes against stored keys without copying them. */
+    #find(length, hash) {
+        if (this.#buckets.length === 0)
+            return -1;
+        let index = this.#buckets[hash & (this.#buckets.length - 1)] ?? -1;
+        while (index >= 0) {
+            if (this.#hashes[index] === hash &&
+                this.#lengths[index] === length &&
+                equalsScratch(this.#keys, this.#offsets[index] ?? 0, length)) {
+                return index;
+            }
+            index = this.#next[index] ?? -1;
+        }
+        return -1;
+    }
+    #ensureEntryCapacity(required) {
+        if (required <= this.#hashes.length)
+            return;
+        let capacity = Math.max(INITIAL_ENTRY_CAPACITY, this.#hashes.length * 2);
+        while (capacity < required)
+            capacity = safeDouble(capacity, "Group index entries");
+        const reservation = this.#memory.reserve(safeProduct(capacity, INDEX_FIELDS * UINT32_BYTES, "Group index entry storage"), "Group index entry storage");
+        try {
+            const hashes = new Uint32Array(capacity);
+            const offsets = new Uint32Array(capacity);
+            const lengths = new Uint32Array(capacity);
+            const next = new Int32Array(capacity);
+            next.fill(-1);
+            hashes.set(this.#hashes);
+            offsets.set(this.#offsets);
+            lengths.set(this.#lengths);
+            next.set(this.#next);
+            this.#hashes = hashes;
+            this.#offsets = offsets;
+            this.#lengths = lengths;
+            this.#next = next;
+            this.#entryReservation?.release();
+            this.#entryReservation = reservation;
+        }
+        catch (error) {
+            reservation.release();
+            throw error;
+        }
+    }
+    #ensureBucketCapacity(requiredEntries) {
+        let capacity = this.#buckets.length;
+        if (capacity === 0)
+            capacity = INITIAL_BUCKET_CAPACITY;
+        while (requiredEntries * 4 > capacity * 3) {
+            capacity = safeDouble(capacity, "Group index buckets");
+        }
+        if (capacity === this.#buckets.length)
+            return;
+        const reservation = this.#memory.reserve(safeProduct(capacity, Int32Array.BYTES_PER_ELEMENT, "Group index bucket storage"), "Group index bucket storage");
+        try {
+            const buckets = new Int32Array(capacity);
+            buckets.fill(-1);
+            for (let index = 0; index < this.#values.length; index += 1) {
+                const bucket = (this.#hashes[index] ?? 0) & (capacity - 1);
+                this.#next[index] = buckets[bucket] ?? -1;
+                buckets[bucket] = index;
+            }
+            this.#buckets = buckets;
+            this.#bucketReservation?.release();
+            this.#bucketReservation = reservation;
+        }
+        catch (error) {
+            reservation.release();
+            throw error;
+        }
+    }
+    #ensureKeyCapacity(additionalBytes) {
+        const required = this.#keyLength + additionalBytes;
+        if (!Number.isSafeInteger(required))
+            throw new RangeError("Group key arena is too large");
+        if (required > 0xffff_ffff)
+            throw new RangeError("Group key arena exceeds uint32 offsets");
+        if (required <= this.#keys.byteLength)
+            return;
+        let capacity = Math.max(INITIAL_KEY_CAPACITY, this.#keys.byteLength * 2);
+        while (capacity < required)
+            capacity = safeDouble(capacity, "Group key arena");
+        const reservation = this.#memory.reserve(capacity, "Group key arena");
+        try {
+            const keys = new Uint8Array(capacity);
+            keys.set(this.#keys.subarray(0, this.#keyLength));
+            this.#keys = keys;
+            this.#keyReservation?.release();
+            this.#keyReservation = reservation;
+        }
+        catch (error) {
+            reservation.release();
+            throw error;
+        }
+    }
+}
+/**
+ * Writes the canonical tagged encoding of `keys` into the scratch arena and returns its byte
+ * length. The byte layout is unchanged from the allocating encoder it replaces — a one-byte tag
+ * per key, little-endian float64 numbers, and length-prefixed UTF-8 strings — so stored keys and
+ * their hashes stay comparable across both paths.
+ */
+function encodeGroupKey(keys) {
+    reclaimScratch();
+    let offset = 0;
+    for (const key of keys)
+        offset = writeGroupKey(key, offset);
+    return offset;
+}
+/**
+ * Encodes one scalar key into the shared scratch arena and returns its byte length. Exported for
+ * the join index, which shares the arena and byte layout: both consume the encoding synchronously
+ * before any other key operation can run, so a single arena serves every index. NaN is the one
+ * excluded number — group callers canonicalize non-finite to null, join callers skip NaN keys —
+ * while ±Infinity encodes as an ordinary float64 so computed join keys can overflow and still match.
+ */
+export function encodeSingleScalarKey(key) {
+    reclaimScratch();
+    return writeGroupKey(key, 0);
+}
+function encodeSingleGroupKey(key) {
+    reclaimScratch();
+    return writeGroupKey(key, 0);
+}
+function writeGroupKey(key, offset) {
+    if (key === null) {
+        ensureScratchCapacity(offset + 1);
+        scratch[offset] = 0;
+        return offset + 1;
+    }
+    if (typeof key === "boolean") {
+        ensureScratchCapacity(offset + 1);
+        scratch[offset] = key ? 2 : 1;
+        return offset + 1;
+    }
+    if (typeof key === "number") {
+        if (Number.isNaN(key))
+            throw new TypeError("Scalar index keys cannot be NaN");
+        ensureScratchCapacity(offset + 1 + Float64Array.BYTES_PER_ELEMENT);
+        scratch[offset] = 3;
+        scratchView.setFloat64(offset + 1, key === 0 ? 0 : key, true);
+        return offset + 1 + Float64Array.BYTES_PER_ELEMENT;
+    }
+    // A UTF-16 code unit never expands past three UTF-8 bytes, and a surrogate pair yields four
+    // across two units, so reserving three bytes per unit lets the encode loop skip bounds checks.
+    const bound = safeSum(offset + 5, safeProduct(key.length, 3, "Encoded group key"), "Encoded group key");
+    if (bound > 0xffff_ffff)
+        throw new RangeError("Encoded group key is too large");
+    ensureScratchCapacity(bound);
+    scratch[offset] = 4;
+    const payloadStart = offset + 5;
+    const payloadEnd = writeUtf8(key, payloadStart);
+    scratchView.setUint32(offset + 1, payloadEnd - payloadStart, true);
+    return payloadEnd;
+}
+/**
+ * Encodes `value` as UTF-8 at `offset`, which the caller has already sized. Unpaired surrogates
+ * become U+FFFD, matching `TextEncoder` so two distinct strings never collapse to one key.
+ */
+function writeUtf8(value, offset) {
+    let write = offset;
+    for (let index = 0; index < value.length; index += 1) {
+        let code = value.charCodeAt(index);
+        if (code < 0x80) {
+            scratch[write] = code;
+            write += 1;
+            continue;
+        }
+        if (code < 0x800) {
+            scratch[write] = 0xc0 | (code >>> 6);
+            scratch[write + 1] = 0x80 | (code & 0x3f);
+            write += 2;
+            continue;
+        }
+        if (code >= 0xd800 && code <= 0xdbff) {
+            const low = index + 1 < value.length ? value.charCodeAt(index + 1) : 0;
+            if (low >= 0xdc00 && low <= 0xdfff) {
+                code = 0x10000 + ((code - 0xd800) << 10) + (low - 0xdc00);
+                index += 1;
+                scratch[write] = 0xf0 | (code >>> 18);
+                scratch[write + 1] = 0x80 | ((code >>> 12) & 0x3f);
+                scratch[write + 2] = 0x80 | ((code >>> 6) & 0x3f);
+                scratch[write + 3] = 0x80 | (code & 0x3f);
+                write += 4;
+                continue;
+            }
+        }
+        if (code >= 0xd800 && code <= 0xdfff) {
+            scratch[write] = REPLACEMENT_CHARACTER_BYTES[0];
+            scratch[write + 1] = REPLACEMENT_CHARACTER_BYTES[1];
+            scratch[write + 2] = REPLACEMENT_CHARACTER_BYTES[2];
+            write += 3;
+            continue;
+        }
+        scratch[write] = 0xe0 | (code >>> 12);
+        scratch[write + 1] = 0x80 | ((code >>> 6) & 0x3f);
+        scratch[write + 2] = 0x80 | (code & 0x3f);
+        write += 3;
+    }
+    return write;
+}
+function ensureScratchCapacity(required) {
+    if (required <= scratch.byteLength)
+        return;
+    let capacity = scratch.byteLength;
+    while (capacity < required)
+        capacity = safeDouble(capacity, "Group key scratch arena");
+    const grown = new Uint8Array(capacity);
+    // Earlier keys of a compound encoding already occupy the arena, so growth carries them over.
+    grown.set(scratch);
+    scratch = grown;
+    scratchView = new DataView(scratch.buffer);
+}
+/** FNV-1a over the scratch arena's first `length` bytes. Exported for the join index. */
+export function hashScratch(length) {
+    let hash = 0x811c9dc5;
+    for (let index = 0; index < length; index += 1) {
+        hash = Math.imul(hash ^ (scratch[index] ?? 0), 0x01000193) >>> 0;
+    }
+    return hash;
+}
+/** Matches `arena[offset..offset+length)` against the scratch arena. Exported for the join index. */
+export function equalsScratch(arena, offset, length) {
+    for (let index = 0; index < length; index += 1) {
+        if (arena[offset + index] !== scratch[index])
+            return false;
+    }
+    return true;
+}
+/** Copies the scratch arena's first `length` bytes into owned storage. Exported for the join index. */
+export function copyScratchKey(length) {
+    return scratch.slice(0, length);
+}
+function safeDouble(value, label) {
+    const doubled = value * 2;
+    if (!Number.isSafeInteger(doubled))
+        throw new RangeError(`${label} exceeds the safe integer range`);
+    return doubled;
+}
+function safeProduct(left, right, label) {
+    const product = left * right;
+    if (!Number.isSafeInteger(product))
+        throw new RangeError(`${label} exceeds the safe integer range`);
+    return product;
+}
+function safeSum(left, right, label) {
+    const sum = left + right;
+    if (!Number.isSafeInteger(sum))
+        throw new RangeError(`${label} exceeds the safe integer range`);
+    return sum;
+}
+//# sourceMappingURL=group-index.js.map

package/dist/engine/group-index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"group-index.js","sourceRoot":"","sources":["../../src/engine/group-index.ts"],"names":[],"mappings":"AAEA,MAAM,sBAAsB,GAAG,CAAC,CAAC;AACjC,MAAM,uBAAuB,GAAG,CAAC,CAAC;AAClC,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAChC,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,YAAY,GAAG,WAAW,CAAC,iBAAiB,CAAC;AACnD,MAAM,wBAAwB,GAAG,EAAE,CAAC;AACpC,MAAM,2BAA2B,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAU,CAAC;AAEhE,kGAAkG;AAClG,iGAAiG;AACjG,+FAA+F;AAC/F,IAAI,OAAO,GAAG,IAAI,UAAU,CAAC,wBAAwB,CAAC,CAAC;AACvD,IAAI,WAAW,GAAG,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AAE/C,uFAAuF;AACvF,+FAA+F;AAC/F,gGAAgG;AAChG,0EAA0E;AAC1E,MAAM,oBAAoB,GAAG,IAAI,GAAG,IAAI,CAAC;AAEzC,SAAS,cAAc;IACrB,IAAI,OAAO,CAAC,UAAU,IAAI,oBAAoB;QAAE,OAAO;IACvD,OAAO,GAAG,IAAI,UAAU,CAAC,oBAAoB,CAAC,CAAC;IAC/C,WAAW,GAAG,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AAC7C,CAAC;AAID,4FAA4F;AAC5F,MAAM,OAAO,cAAc;IAChB,OAAO,CAAqB;IAC5B,OAAO,GAAQ,EAAE,CAAC;IAC3B,QAAQ,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,OAAO,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC7B,QAAQ,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC9B,QAAQ,GAAG,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC;IAC9B,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAC;IAC1B,UAAU,GAAG,CAAC,CAAC;IACf,iBAAiB,CAAqC;IACtD,kBAAkB,CAAqC;IACvD,eAAe,CAAqC;IAEpD,YAAY,MAA0B;QACpC,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;IACxB,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;IAC7B,CAAC;IAED,GAAG,CAAC,IAA8B;QAChC,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;QACtD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC;IAED,QAAQ;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,CAAC,GAAkB;QACvB,MAAM,MAAM,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;QACtD,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACrD,CAAC;IAED,GAAG,CAAC,IAA8B,EAAE,KAAQ;QAC1C,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;YAClB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC;YAC/B,OAAO;QACT,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IACtD,CAAC;IAED,WAAW,CAAC,IAA8B,EAAE,MAAe;QACzD,MAAM,MAAM,GAAG,cAAc,CAAC,IAAI,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAED,cAAc,CAAC,GAAkB,EAAE,MAAe;QAChD,MAAM,MAAM,GAAG,oBAAoB,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClD,CAAC;IAED;;;;OAIG;IACH,mBAAmB,CAAC,MAAc,EAAE,MAAe;QACjD,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,QAAQ,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAM,CAAC;QACtD,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;QACzC,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;QACnC,OAAO,KAAK,CAAC;IACf,CAAC;IAED,OAAO,CAAC,OAAmB,EAAE,IAAY,EAAE,KAAQ;QACjD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC;QAClC,IAAI,CAAC,oBAAoB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACrC,IAAI,CAAC,qBAAqB,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QACtC,IAAI,CAAC,kBAAkB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC5C,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;QAChC,IAAI,CAAC,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC;QACtC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;QAC3B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC;QAC9B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,UAAU,CAAC;QAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAChD,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;QAC9B,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,QAAQ,CAAC,KAAQ;QACf,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IACtB,CAAC;IAED,MAAM,CAAC,GAAkB,EAAE,KAAQ;QACjC,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;IACzB,CAAC;IAED,MAAM;QACJ,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAED,iGAAiG;IACjG,KAAK,CAAC,MAAc,EAAE,IAAY;QAChC,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC,CAAC;QAC1C,IAAI,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QACnE,OAAO,KAAK,IAAI,CAAC,EAAE,CAAC;YAClB,IACE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,IAAI;gBAC5B,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,MAAM;gBAC/B,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,EAC5D,CAAC;gBACD,OAAO,KAAK,CAAC;YACf,CAAC;YACD,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,CAAC,CAAC,CAAC;IACZ,CAAC;IAED,oBAAoB,CAAC,QAAgB;QACnC,IAAI,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM;YAAE,OAAO;QAC5C,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,sBAAsB,EAAE,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACzE,OAAO,QAAQ,GAAG,QAAQ;YAAE,QAAQ,GAAG,UAAU,CAAC,QAAQ,EAAE,qBAAqB,CAAC,CAAC;QACnF,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CACtC,WAAW,CAAC,QAAQ,EAAE,YAAY,GAAG,YAAY,EAAE,2BAA2B,CAAC,EAC/E,2BAA2B,CAC5B,CAAC;QACF,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;YACzC,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,QAAQ,CAAC,CAAC;YAC1C,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACd,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACrB,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;YACtB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;YACxB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;YACxB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,iBAAiB,EAAE,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,iBAAiB,GAAG,WAAW,CAAC;QACvC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,WAAW,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED,qBAAqB,CAAC,eAAuB;QAC3C,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QACpC,IAAI,QAAQ,KAAK,CAAC;YAAE,QAAQ,GAAG,uBAAuB,CAAC;QACvD,OAAO,eAAe,GAAG,CAAC,GAAG,QAAQ,GAAG,CAAC,EAAE,CAAC;YAC1C,QAAQ,GAAG,UAAU,CAAC,QAAQ,EAAE,qBAAqB,CAAC,CAAC;QACzD,CAAC;QACD,IAAI,QAAQ,KAAK,IAAI,CAAC,QAAQ,CAAC,MAAM;YAAE,OAAO;QAC9C,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CACtC,WAAW,CAAC,QAAQ,EAAE,UAAU,CAAC,iBAAiB,EAAE,4BAA4B,CAAC,EACjF,4BAA4B,CAC7B,CAAC;QACF,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;YACzC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;YACjB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;gBAC5D,MAAM,MAAM,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;gBAC3D,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;gBAC1C,OAAO,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC;YAC1B,CAAC;YACD,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;YACxB,IAAI,CAAC,kBAAkB,EAAE,OAAO,EAAE,CAAC;YACnC,IAAI,CAAC,kBAAkB,GAAG,WAAW,CAAC;QACxC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,WAAW,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;IAED,kBAAkB,CAAC,eAAuB;QACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC;QACnD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC;YAAE,MAAM,IAAI,UAAU,CAAC,8BAA8B,CAAC,CAAC;QAC1F,IAAI,QAAQ,GAAG,WAAW;YAAE,MAAM,IAAI,UAAU,CAAC,wCAAwC,CAAC,CAAC;QAC3F,IAAI,QAAQ,IAAI,IAAI,CAAC,KAAK,CAAC,UAAU;YAAE,OAAO;QAC9C,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,CAAC,CAAC,CAAC;QACzE,OAAO,QAAQ,GAAG,QAAQ;YAAE,QAAQ,GAAG,UAAU,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;QAC/E,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,EAAE,iBAAiB,CAAC,CAAC;QACtE,IAAI,CAAC;YACH,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAClD,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,eAAe,EAAE,OAAO,EAAE,CAAC;YAChC,IAAI,CAAC,eAAe,GAAG,WAAW,CAAC;QACrC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,WAAW,CAAC,OAAO,EAAE,CAAC;YACtB,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;CACF;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,IAA8B;IACpD,cAAc,EAAE,CAAC;IACjB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,MAAM,GAAG,IAAI,IAAI;QAAE,MAAM,GAAG,aAAa,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;IAC5D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,qBAAqB,CAAC,GAAkB;IACtD,cAAc,EAAE,CAAC;IACjB,OAAO,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,oBAAoB,CAAC,GAAkB;IAC9C,cAAc,EAAE,CAAC;IACjB,OAAO,aAAa,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,aAAa,CAAC,GAAkB,EAAE,MAAc;IACvD,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;QACjB,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpB,OAAO,MAAM,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,SAAS,EAAE,CAAC;QAC7B,qBAAqB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClC,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,OAAO,MAAM,GAAG,CAAC,CAAC;IACpB,CAAC;IACD,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE,CAAC;QAC5B,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;QAC9E,qBAAqB,CAAC,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;QACnE,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpB,WAAW,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC9D,OAAO,MAAM,GAAG,CAAC,GAAG,YAAY,CAAC,iBAAiB,CAAC;IACrD,CAAC;IACD,4FAA4F;IAC5F,+FAA+F;IAC/F,MAAM,KAAK,GAAG,OAAO,CACnB,MAAM,GAAG,CAAC,EACV,WAAW,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE,mBAAmB,CAAC,EAC/C,mBAAmB,CACpB,CAAC;IACF,IAAI,KAAK,GAAG,WAAW;QAAE,MAAM,IAAI,UAAU,CAAC,gCAAgC,CAAC,CAAC;IAChF,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAC7B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACpB,MAAM,YAAY,GAAG,MAAM,GAAG,CAAC,CAAC;IAChC,MAAM,UAAU,GAAG,SAAS,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;IAChD,WAAW,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,UAAU,GAAG,YAAY,EAAE,IAAI,CAAC,CAAC;IACnE,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAa,EAAE,MAAc;IAC9C,IAAI,KAAK,GAAG,MAAM,CAAC;IACnB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,IAAI,IAAI,GAAG,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;YAChB,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC;YACtB,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,IAAI,GAAG,KAAK,EAAE,CAAC;YACjB,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC;YACrC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;YAC1C,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;YACrC,MAAM,GAAG,GAAG,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACvE,IAAI,GAAG,IAAI,MAAM,IAAI,GAAG,IAAI,MAAM,EAAE,CAAC;gBACnC,IAAI,GAAG,OAAO,GAAG,CAAC,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,GAAG,MAAM,CAAC,CAAC;gBAC1D,KAAK,IAAI,CAAC,CAAC;gBACX,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;gBACtC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;gBACnD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;gBAClD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;gBAC1C,KAAK,IAAI,CAAC,CAAC;gBACX,SAAS;YACX,CAAC;QACH,CAAC;QACD,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,EAAE,CAAC;YACrC,OAAO,CAAC,KAAK,CAAC,GAAG,2BAA2B,CAAC,CAAC,CAAC,CAAC;YAChD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,2BAA2B,CAAC,CAAC,CAAC,CAAC;YACpD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,2BAA2B,CAAC,CAAC,CAAC,CAAC;YACpD,KAAK,IAAI,CAAC,CAAC;YACX,SAAS;QACX,CAAC;QACD,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE,CAAC,CAAC;QACtC,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;QAClD,OAAO,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;QAC1C,KAAK,IAAI,CAAC,CAAC;IACb,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,qBAAqB,CAAC,QAAgB;IAC7C,IAAI,QAAQ,IAAI,OAAO,CAAC,UAAU;QAAE,OAAO;IAC3C,IAAI,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC;IAClC,OAAO,QAAQ,GAAG,QAAQ;QAAE,QAAQ,GAAG,UAAU,CAAC,QAAQ,EAAE,yBAAyB,CAAC,CAAC;IACvF,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,QAAQ,CAAC,CAAC;IACvC,6FAA6F;IAC7F,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IACnB,OAAO,GAAG,KAAK,CAAC;IAChB,WAAW,GAAG,IAAI,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;AAC7C,CAAC;AAED,yFAAyF;AACzF,MAAM,UAAU,WAAW,CAAC,MAAc;IACxC,IAAI,IAAI,GAAG,UAAU,CAAC;IACtB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC/C,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC;IACnE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,qGAAqG;AACrG,MAAM,UAAU,aAAa,CAAC,KAAiB,EAAE,MAAc,EAAE,MAAc;IAC7E,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC;QAC/C,IAAI,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,KAAK,OAAO,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7D,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,uGAAuG;AACvG,MAAM,UAAU,cAAc,CAAC,MAAc;IAC3C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC;AAClC,CAAC;AAED,SAAS,UAAU,CAAC,KAAa,EAAE,KAAa;IAC9C,MAAM,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC;IAC1B,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC;QAChC,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;IAClE,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,KAAa,EAAE,KAAa;IAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,KAAK,CAAC;IAC7B,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,OAAO,CAAC;QAChC,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;IAClE,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,OAAO,CAAC,IAAY,EAAE,KAAa,EAAE,KAAa;IACzD,MAAM,GAAG,GAAG,IAAI,GAAG,KAAK,CAAC;IACzB,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC;QAAE,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,iCAAiC,CAAC,CAAC;IAChG,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/engine/index.d.ts

@@ -0,0 +1,13 @@
+export * from "./catalog.js";
+export * from "./client.js";
+export * from "./coordinator.js";
+export * from "./database.js";
+export * from "./schema-wire.js";
+export * from "./worker-host.js";
+export { bindPlanParameters, bindStatementParameters, compileQuery, compileStatement, executeQuery, referencedColumns, type InsertValue, type CompiledQuery, type CompiledStatement, type QueryResult, type QueryRow, type QueryExecutionOptions, type QueryValue, type SqlColumnSchema, type SqlColumnType, } from "./query.js";
+export { QueryMemoryBudgetError, type QueryMemoryUsage } from "./memory.js";
+export { optimizePlan, renderPlan } from "./optimizer.js";
+export * from "./schema.js";
+export * from "./live.js";
+export type { AsyncQueryExecutionOptions, QuerySpillStore } from "./vector.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/engine/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,iBAAiB,EACjB,KAAK,WAAW,EAChB,KAAK,aAAa,EAClB,KAAK,iBAAiB,EACtB,KAAK,WAAW,EAChB,KAAK,QAAQ,EACb,KAAK,qBAAqB,EAC1B,KAAK,UAAU,EACf,KAAK,eAAe,EACpB,KAAK,aAAa,GACnB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,sBAAsB,EAAE,KAAK,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC5E,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC1D,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC;AAC1B,YAAY,EAAE,0BAA0B,EAAE,eAAe,EAAE,MAAM,aAAa,CAAC"}

package/dist/engine/index.js

@@ -0,0 +1,12 @@
+export * from "./catalog.js";
+export * from "./client.js";
+export * from "./coordinator.js";
+export * from "./database.js";
+export * from "./schema-wire.js";
+export * from "./worker-host.js";
+export { bindPlanParameters, bindStatementParameters, compileQuery, compileStatement, executeQuery, referencedColumns, } from "./query.js";
+export { QueryMemoryBudgetError } from "./memory.js";
+export { optimizePlan, renderPlan } from "./optimizer.js";
+export * from "./schema.js";
+export * from "./live.js";
+//# sourceMappingURL=index.js.map

package/dist/engine/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/engine/index.ts"],"names":[],"mappings":"AAAA,cAAc,cAAc,CAAC;AAC7B,cAAc,aAAa,CAAC;AAC5B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC;AAC9B,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,OAAO,EACL,kBAAkB,EAClB,uBAAuB,EACvB,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,iBAAiB,GAUlB,MAAM,YAAY,CAAC;AACpB,OAAO,EAAE,sBAAsB,EAAyB,MAAM,aAAa,CAAC;AAC5E,OAAO,EAAE,YAAY,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC1D,cAAc,aAAa,CAAC;AAC5B,cAAc,WAAW,CAAC"}

package/dist/engine/join-index.d.ts

@@ -0,0 +1,12 @@
+import { QueryMemoryContext } from "./memory.js";
+export type JoinIndexKey = boolean | number | string | Date;
+/** Collision-checked scalar-key hash index with typed duplicate row chains. */
+export declare class ByteJoinIndex {
+    #private;
+    constructor(memory: QueryMemoryContext, rowCapacity: number);
+    get unique(): boolean;
+    add(value: unknown, row: number): void;
+    firstRow(value: unknown): number;
+    nextRow(row: number): number;
+}
+//# sourceMappingURL=join-index.d.ts.map

package/dist/engine/join-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-index.d.ts","sourceRoot":"","sources":["../../src/engine/join-index.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,kBAAkB,EAA+B,MAAM,aAAa,CAAC;AAQ9E,MAAM,MAAM,YAAY,GAAG,OAAO,GAAG,MAAM,GAAG,MAAM,GAAG,IAAI,CAAC;AAE5D,+EAA+E;AAC/E,qBAAa,aAAa;;gBAkBZ,MAAM,EAAE,kBAAkB,EAAE,WAAW,EAAE,MAAM;IAa3D,IAAI,MAAM,IAAI,OAAO,CAEpB;IAED,GAAG,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,GAAG,IAAI;IAoCtC,QAAQ,CAAC,KAAK,EAAE,OAAO,GAAG,MAAM;IAOhC,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,MAAM;CA0G7B"}

package/dist/engine/join-index.js

@@ -0,0 +1,217 @@
+import { copyScratchKey, encodeSingleScalarKey, equalsScratch, hashScratch, } from "./group-index.js";
+const INITIAL_ENTRY_CAPACITY = 4;
+const INITIAL_BUCKET_CAPACITY = 8;
+const INITIAL_KEY_CAPACITY = 32;
+const ENTRY_FIELDS = 6;
+const UINT32_BYTES = Uint32Array.BYTES_PER_ELEMENT;
+/** Collision-checked scalar-key hash index with typed duplicate row chains. */
+export class ByteJoinIndex {
+    #memory;
+    #rowNext;
+    #buckets = new Int32Array(0);
+    #hashes = new Uint32Array(0);
+    #offsets = new Uint32Array(0);
+    #lengths = new Uint32Array(0);
+    #bucketNext = new Int32Array(0);
+    #rowHeads = new Int32Array(0);
+    #rowTails = new Int32Array(0);
+    #keys = new Uint8Array(0);
+    #keyLength = 0;
+    #entryCount = 0;
+    #unique = true;
+    #entryReservation;
+    #bucketReservation;
+    #keyReservation;
+    constructor(memory, rowCapacity) {
+        if (!Number.isSafeInteger(rowCapacity) || rowCapacity < 0) {
+            throw new RangeError("Join index row capacity must be a non-negative safe integer");
+        }
+        this.#memory = memory;
+        memory.reserve(safeProduct(rowCapacity, Int32Array.BYTES_PER_ELEMENT, "Join duplicate row chains"), "Join duplicate row chains");
+        this.#rowNext = new Int32Array(rowCapacity);
+        this.#rowNext.fill(-1);
+    }
+    get unique() {
+        return this.#unique;
+    }
+    add(value, row) {
+        if (!Number.isSafeInteger(row) || row < 0 || row >= this.#rowNext.length) {
+            throw new RangeError("Join index row is outside its declared capacity");
+        }
+        const length = encodeJoinKey(value);
+        if (length < 0)
+            return;
+        const hash = hashScratch(length);
+        const existing = this.#find(length, hash);
+        if (existing >= 0) {
+            const tail = this.#rowTails[existing] ?? -1;
+            if (tail < 0)
+                throw new Error("Join index row chain is corrupt");
+            this.#rowNext[tail] = row;
+            this.#rowTails[existing] = row;
+            this.#unique = false;
+            return;
+        }
+        const encoded = copyScratchKey(length);
+        const index = this.#entryCount;
+        this.#ensureEntryCapacity(index + 1);
+        this.#ensureBucketCapacity(index + 1);
+        this.#ensureKeyCapacity(encoded.byteLength);
+        const offset = this.#keyLength;
+        this.#keys.set(encoded, offset);
+        this.#keyLength += encoded.byteLength;
+        this.#hashes[index] = hash;
+        this.#offsets[index] = offset;
+        this.#lengths[index] = encoded.byteLength;
+        this.#rowHeads[index] = row;
+        this.#rowTails[index] = row;
+        const bucket = hash & (this.#buckets.length - 1);
+        this.#bucketNext[index] = this.#buckets[bucket] ?? -1;
+        this.#buckets[bucket] = index;
+        this.#entryCount += 1;
+    }
+    firstRow(value) {
+        const length = encodeJoinKey(value);
+        if (length < 0)
+            return -1;
+        const index = this.#find(length, hashScratch(length));
+        return index < 0 ? -1 : (this.#rowHeads[index] ?? -1);
+    }
+    nextRow(row) {
+        return row < 0 || row >= this.#rowNext.length ? -1 : (this.#rowNext[row] ?? -1);
+    }
+    /** Matches the scratch arena's first `length` bytes against stored keys without copying them. */
+    #find(length, hash) {
+        if (this.#buckets.length === 0)
+            return -1;
+        let index = this.#buckets[hash & (this.#buckets.length - 1)] ?? -1;
+        while (index >= 0) {
+            if (this.#hashes[index] === hash &&
+                this.#lengths[index] === length &&
+                equalsScratch(this.#keys, this.#offsets[index] ?? 0, length)) {
+                return index;
+            }
+            index = this.#bucketNext[index] ?? -1;
+        }
+        return -1;
+    }
+    #ensureEntryCapacity(required) {
+        if (required <= this.#hashes.length)
+            return;
+        let capacity = Math.max(INITIAL_ENTRY_CAPACITY, this.#hashes.length * 2);
+        while (capacity < required)
+            capacity = safeDouble(capacity, "Join index entries");
+        const reservation = this.#memory.reserve(safeProduct(capacity, ENTRY_FIELDS * UINT32_BYTES, "Join index entry storage"), "Join index entry storage");
+        try {
+            const hashes = new Uint32Array(capacity);
+            const offsets = new Uint32Array(capacity);
+            const lengths = new Uint32Array(capacity);
+            const bucketNext = new Int32Array(capacity);
+            const rowHeads = new Int32Array(capacity);
+            const rowTails = new Int32Array(capacity);
+            bucketNext.fill(-1);
+            rowHeads.fill(-1);
+            rowTails.fill(-1);
+            hashes.set(this.#hashes);
+            offsets.set(this.#offsets);
+            lengths.set(this.#lengths);
+            bucketNext.set(this.#bucketNext);
+            rowHeads.set(this.#rowHeads);
+            rowTails.set(this.#rowTails);
+            this.#hashes = hashes;
+            this.#offsets = offsets;
+            this.#lengths = lengths;
+            this.#bucketNext = bucketNext;
+            this.#rowHeads = rowHeads;
+            this.#rowTails = rowTails;
+            this.#entryReservation?.release();
+            this.#entryReservation = reservation;
+        }
+        catch (error) {
+            reservation.release();
+            throw error;
+        }
+    }
+    #ensureBucketCapacity(requiredEntries) {
+        let capacity = this.#buckets.length;
+        if (capacity === 0)
+            capacity = INITIAL_BUCKET_CAPACITY;
+        while (requiredEntries * 4 > capacity * 3) {
+            capacity = safeDouble(capacity, "Join index buckets");
+        }
+        if (capacity === this.#buckets.length)
+            return;
+        const reservation = this.#memory.reserve(safeProduct(capacity, Int32Array.BYTES_PER_ELEMENT, "Join index bucket storage"), "Join index bucket storage");
+        try {
+            const buckets = new Int32Array(capacity);
+            buckets.fill(-1);
+            for (let index = 0; index < this.#entryCount; index += 1) {
+                const bucket = (this.#hashes[index] ?? 0) & (capacity - 1);
+                this.#bucketNext[index] = buckets[bucket] ?? -1;
+                buckets[bucket] = index;
+            }
+            this.#buckets = buckets;
+            this.#bucketReservation?.release();
+            this.#bucketReservation = reservation;
+        }
+        catch (error) {
+            reservation.release();
+            throw error;
+        }
+    }
+    #ensureKeyCapacity(additionalBytes) {
+        const required = this.#keyLength + additionalBytes;
+        if (!Number.isSafeInteger(required))
+            throw new RangeError("Join key arena is too large");
+        if (required > 0xffff_ffff)
+            throw new RangeError("Join key arena exceeds uint32 offsets");
+        if (required <= this.#keys.byteLength)
+            return;
+        let capacity = Math.max(INITIAL_KEY_CAPACITY, this.#keys.byteLength * 2);
+        while (capacity < required)
+            capacity = safeDouble(capacity, "Join key arena");
+        const reservation = this.#memory.reserve(capacity, "Join key arena");
+        try {
+            const keys = new Uint8Array(capacity);
+            keys.set(this.#keys.subarray(0, this.#keyLength));
+            this.#keys = keys;
+            this.#keyReservation?.release();
+            this.#keyReservation = reservation;
+        }
+        catch (error) {
+            reservation.release();
+            throw error;
+        }
+    }
+}
+/**
+ * Encodes one join key into the shared scratch arena and returns its byte length, or -1 for keys
+ * SQL equality can never match (null, undefined, NaN). Dates coerce to their epoch milliseconds,
+ * so a Date and its number representation join as the same key.
+ */
+function encodeJoinKey(value) {
+    const key = value instanceof Date ? value.getTime() : value;
+    if (key === null || key === undefined)
+        return -1;
+    if (typeof key === "number" && Number.isNaN(key))
+        return -1;
+    if (typeof key === "boolean" || typeof key === "number" || typeof key === "string") {
+        return encodeSingleScalarKey(key);
+    }
+    throw new TypeError("Join keys must be SQL scalar values");
+}
+function safeDouble(value, label) {
+    const doubled = value * 2;
+    if (!Number.isSafeInteger(doubled)) {
+        throw new RangeError(`${label} exceeds the safe integer range`);
+    }
+    return doubled;
+}
+function safeProduct(left, right, label) {
+    const product = left * right;
+    if (!Number.isSafeInteger(product)) {
+        throw new RangeError(`${label} exceeds the safe integer range`);
+    }
+    return product;
+}
+//# sourceMappingURL=join-index.js.map