@minnowdb/core 0.0.1 → 0.1.1

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

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../src/engine/memory.ts"],"names":[],"mappings":"AAAA,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,qBAAa,sBAAuB,SAAQ,KAAK;IAI7C,QAAQ,CAAC,KAAK,EAAE,MAAM;IACtB,QAAQ,CAAC,cAAc,EAAE,MAAM;IAC/B,QAAQ,CAAC,SAAS,EAAE,MAAM;IAC1B,QAAQ,CAAC,WAAW,EAAE,MAAM;IAN9B,SAAkB,IAAI,4BAA4B;gBAGvC,KAAK,EAAE,MAAM,EACb,cAAc,EAAE,MAAM,EACtB,SAAS,EAAE,MAAM,EACjB,WAAW,EAAE,MAAM;CAM/B;AAQD,qBAAa,kBAAkB;;gBAQjB,WAAW,GAAE,MAAgC,EAAE,MAAM,CAAC,EAAE,kBAAkB;IAYtF,IAAI,KAAK,IAAI,gBAAgB,CAE5B;IAED,WAAW,IAAI,kBAAkB;IAKjC,OAAO,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,sBAAsB;IAmB7D;;;;;;OAMG;IACH,KAAK,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAiBzC,KAAK,IAAI,IAAI;IAWb,OAAO,CAAC,WAAW,EAAE,sBAAsB,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;CASlE;AAED,qBAAa,sBAAsB;;IAEjC,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAGX,OAAO,EAAE,kBAAkB,EAAE,KAAK,EAAE,MAAM;IAKtD,OAAO,IAAI,IAAI;CAKhB"}

package/dist/engine/memory.js

@@ -0,0 +1,119 @@
+export class QueryMemoryBudgetError extends Error {
+    label;
+    requestedBytes;
+    usedBytes;
+    budgetBytes;
+    name = "QueryMemoryBudgetError";
+    constructor(label, requestedBytes, usedBytes, budgetBytes) {
+        super(`${label} requested ${String(requestedBytes)} accounted bytes with ${String(usedBytes)} of ${String(budgetBytes)} bytes already reserved`);
+        this.label = label;
+        this.requestedBytes = requestedBytes;
+        this.usedBytes = usedBytes;
+        this.budgetBytes = budgetBytes;
+    }
+}
+export class QueryMemoryContext {
+    #state;
+    #parent;
+    #children = new Set();
+    #reservations = new Set();
+    #talliedBytes = 0;
+    #closed = false;
+    constructor(budgetBytes = Number.MAX_SAFE_INTEGER, parent) {
+        if (!Number.isSafeInteger(budgetBytes) || budgetBytes < 0) {
+            throw new RangeError("Query memory budget must be a non-negative safe integer");
+        }
+        this.#parent = parent;
+        if (parent === undefined)
+            this.#state = { budgetBytes, usedBytes: 0, peakBytes: 0 };
+        else {
+            this.#state = parent.#state;
+            parent.#children.add(this);
+        }
+    }
+    get usage() {
+        return { ...this.#state };
+    }
+    createChild() {
+        this.#assertOpen();
+        return new QueryMemoryContext(this.#state.budgetBytes, this);
+    }
+    reserve(bytes, label) {
+        this.#assertOpen();
+        validateMemoryBytes(bytes, "Query memory reservation");
+        const nextUsed = this.#state.usedBytes + bytes;
+        if (!Number.isSafeInteger(nextUsed) || nextUsed > this.#state.budgetBytes) {
+            throw new QueryMemoryBudgetError(label, bytes, this.#state.usedBytes, this.#state.budgetBytes);
+        }
+        this.#state.usedBytes = nextUsed;
+        this.#state.peakBytes = Math.max(this.#state.peakBytes, nextUsed);
+        const reservation = new QueryMemoryReservation(this, bytes);
+        this.#reservations.add(reservation);
+        return reservation;
+    }
+    /**
+     * Reserves bytes that live until this context closes, without a per-call reservation object.
+     * The hot accumulation paths (result rows, spill pages) reserve once per row; tracking each
+     * row as a retained `QueryMemoryReservation` in a Set costs O(result rows) live objects on
+     * top of the rows themselves. Tallied bytes share the same budget and error semantics as
+     * `reserve` and are released together when the context closes.
+     */
+    tally(bytes, label) {
+        this.#assertOpen();
+        validateMemoryBytes(bytes, "Query memory reservation");
+        const nextUsed = this.#state.usedBytes + bytes;
+        if (!Number.isSafeInteger(nextUsed) || nextUsed > this.#state.budgetBytes) {
+            throw new QueryMemoryBudgetError(label, bytes, this.#state.usedBytes, this.#state.budgetBytes);
+        }
+        this.#state.usedBytes = nextUsed;
+        this.#state.peakBytes = Math.max(this.#state.peakBytes, nextUsed);
+        this.#talliedBytes += bytes;
+    }
+    close() {
+        if (this.#closed)
+            return;
+        this.#closed = true;
+        for (const child of [...this.#children])
+            child.close();
+        for (const reservation of [...this.#reservations])
+            reservation.release();
+        this.#state.usedBytes -= this.#talliedBytes;
+        this.#talliedBytes = 0;
+        if (this.#state.usedBytes < 0)
+            throw new Error("Query memory accounting underflow");
+        if (this.#parent !== undefined)
+            this.#parent.#children.delete(this);
+    }
+    release(reservation, bytes) {
+        if (!this.#reservations.delete(reservation))
+            return;
+        this.#state.usedBytes -= bytes;
+        if (this.#state.usedBytes < 0)
+            throw new Error("Query memory accounting underflow");
+    }
+    #assertOpen() {
+        if (this.#closed)
+            throw new Error("Query memory context is closed");
+    }
+}
+export class QueryMemoryReservation {
+    #context;
+    bytes;
+    #released = false;
+    constructor(context, bytes) {
+        this.#context = context;
+        this.bytes = bytes;
+    }
+    release() {
+        if (this.#released)
+            return;
+        this.#released = true;
+        this.#context.release(this, this.bytes);
+    }
+}
+function validateMemoryBytes(bytes, label) {
+    if (!Number.isSafeInteger(bytes) || bytes < 0) {
+        throw new RangeError(`${label} must be a non-negative safe integer`);
+    }
+}
+//# sourceMappingURL=memory.js.map

package/dist/engine/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../src/engine/memory.ts"],"names":[],"mappings":"AAMA,MAAM,OAAO,sBAAuB,SAAQ,KAAK;IAIpC;IACA;IACA;IACA;IANO,IAAI,GAAG,wBAAwB,CAAC;IAElD,YACW,KAAa,EACb,cAAsB,EACtB,SAAiB,EACjB,WAAmB;QAE5B,KAAK,CACH,GAAG,KAAK,cAAc,MAAM,CAAC,cAAc,CAAC,yBAAyB,MAAM,CAAC,SAAS,CAAC,OAAO,MAAM,CAAC,WAAW,CAAC,yBAAyB,CAC1I,CAAC;QAPO,UAAK,GAAL,KAAK,CAAQ;QACb,mBAAc,GAAd,cAAc,CAAQ;QACtB,cAAS,GAAT,SAAS,CAAQ;QACjB,gBAAW,GAAX,WAAW,CAAQ;IAK9B,CAAC;CACF;AAQD,MAAM,OAAO,kBAAkB;IACpB,MAAM,CAAmB;IACzB,OAAO,CAAiC;IACxC,SAAS,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC1C,aAAa,GAAG,IAAI,GAAG,EAA0B,CAAC;IAC3D,aAAa,GAAG,CAAC,CAAC;IAClB,OAAO,GAAG,KAAK,CAAC;IAEhB,YAAY,cAAsB,MAAM,CAAC,gBAAgB,EAAE,MAA2B;QACpF,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;YAC1D,MAAM,IAAI,UAAU,CAAC,yDAAyD,CAAC,CAAC;QAClF,CAAC;QACD,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,MAAM,KAAK,SAAS;YAAE,IAAI,CAAC,MAAM,GAAG,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;aAC/E,CAAC;YACJ,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YAC5B,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC7B,CAAC;IACH,CAAC;IAED,IAAI,KAAK;QACP,OAAO,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC5B,CAAC;IAED,WAAW;QACT,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,OAAO,IAAI,kBAAkB,CAAC,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC/D,CAAC;IAED,OAAO,CAAC,KAAa,EAAE,KAAa;QAClC,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,mBAAmB,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,KAAK,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAC1E,MAAM,IAAI,sBAAsB,CAC9B,KAAK,EACL,KAAK,EACL,IAAI,CAAC,MAAM,CAAC,SAAS,EACrB,IAAI,CAAC,MAAM,CAAC,WAAW,CACxB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,MAAM,WAAW,GAAG,IAAI,sBAAsB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QAC5D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACpC,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,KAAa,EAAE,KAAa;QAChC,IAAI,CAAC,WAAW,EAAE,CAAC;QACnB,mBAAmB,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC;QACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,KAAK,CAAC;QAC/C,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,IAAI,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC;YAC1E,MAAM,IAAI,sBAAsB,CAC9B,KAAK,EACL,KAAK,EACL,IAAI,CAAC,MAAM,CAAC,SAAS,EACrB,IAAI,CAAC,MAAM,CAAC,WAAW,CACxB,CAAC;QACJ,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,QAAQ,CAAC;QACjC,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAClE,IAAI,CAAC,aAAa,IAAI,KAAK,CAAC;IAC9B,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,OAAO;YAAE,OAAO;QACzB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,KAAK,MAAM,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC;YAAE,KAAK,CAAC,KAAK,EAAE,CAAC;QACvD,KAAK,MAAM,WAAW,IAAI,CAAC,GAAG,IAAI,CAAC,aAAa,CAAC;YAAE,WAAW,CAAC,OAAO,EAAE,CAAC;QACzE,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,IAAI,CAAC,aAAa,CAAC;QAC5C,IAAI,CAAC,aAAa,GAAG,CAAC,CAAC;QACvB,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACpF,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtE,CAAC;IAED,OAAO,CAAC,WAAmC,EAAE,KAAa;QACxD,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,WAAW,CAAC;YAAE,OAAO;QACpD,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,KAAK,CAAC;QAC/B,IAAI,IAAI,CAAC,MAAM,CAAC,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;IACtF,CAAC;IAED,WAAW;QACT,IAAI,IAAI,CAAC,OAAO;YAAE,MAAM,IAAI,KAAK,CAAC,gCAAgC,CAAC,CAAC;IACtE,CAAC;CACF;AAED,MAAM,OAAO,sBAAsB;IACxB,QAAQ,CAAqB;IAC7B,KAAK,CAAS;IACvB,SAAS,GAAG,KAAK,CAAC;IAElB,YAAY,OAA2B,EAAE,KAAa;QACpD,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,OAAO;QACL,IAAI,IAAI,CAAC,SAAS;YAAE,OAAO;QAC3B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACtB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC1C,CAAC;CACF;AAED,SAAS,mBAAmB,CAAC,KAAa,EAAE,KAAa;IACvD,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,UAAU,CAAC,GAAG,KAAK,sCAAsC,CAAC,CAAC;IACvE,CAAC;AACH,CAAC"}

package/dist/engine/optimizer.d.ts

@@ -0,0 +1,20 @@
+import { type CompiledQuery } from "./query.js";
+/**
+ * Deterministic plan-to-plan rewrites over the shared compiled representation. Every rule
+ * preserves result semantics exactly; rules that cannot prove safety leave the plan unchanged.
+ * The optimizer runs before subquery resolution, so subquery blocks optimize recursively and
+ * predicates containing subqueries stay self-contained when they move.
+ */
+export declare function optimizePlan(plan: CompiledQuery): CompiledQuery;
+/**
+ * Cost-based build-side selection using prepared or catalog-derived row counts. A single inner
+ * equi-join probes from the base into an index over the joined table, so a joined input more than
+ * twice the base size swaps sides and builds over the smaller input. Asymmetric and observable
+ * source-order shapes stay unchanged.
+ */
+export declare function chooseJoinOrder(plan: CompiledQuery, inputs: ReadonlyMap<string, {
+    readonly rowCount: number;
+}>): CompiledQuery;
+/** Renders a stable, human-readable plan for snapshot tests and explain(). */
+export declare function renderPlan(plan: CompiledQuery): string;
+//# sourceMappingURL=optimizer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"optimizer.d.ts","sourceRoot":"","sources":["../../src/engine/optimizer.ts"],"names":[],"mappings":"AAAA,OAAO,EAUL,KAAK,aAAa,EAMnB,MAAM,YAAY,CAAC;AAEpB;;;;;GAKG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,aAAa,GAAG,aAAa,CAI/D;AAED;;;;;GAKG;AACH,wBAAgB,eAAe,CAC7B,IAAI,EAAE,aAAa,EACnB,MAAM,EAAE,WAAW,CAAC,MAAM,EAAE;IAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAAC,GACzD,aAAa,CAoBf;AAqkCD,8EAA8E;AAC9E,wBAAgB,UAAU,CAAC,IAAI,EAAE,aAAa,GAAG,MAAM,CAItD"}