@quereus/quereus 4.3.1 → 4.3.2

package/dist/src/vtab/memory/layer/transaction.js

@@ -15,7 +15,28 @@ let transactionLayerCounter = 1000;
 export class TransactionLayer {
     layerId;
     parentLayer;
-    tableSchemaAtCreation; // Schema when this layer was started
+    /**
+     * Inherited verbatim from the parent layer: this layer's secondary BTrees are
+     * built over the parent's (`new MemoryIndex(..., parentSecondaryTree)`), so the
+     * child's `compareKeys` must come from the same collation function the parent
+     * ordered those nodes with.
+     */
+    collationResolver;
+    /**
+     * Schema when this layer was started. Replaced when DDL runs inside this layer's own
+     * transaction: by {@link adoptSchema} for additive index/constraint DDL, a secondary-index
+     * re-key from `alter column … set collate`, and index/constraint removal (`drop index` /
+     * `drop constraint`), and by {@link rekeyPrimaryKey} when that collate change lands on a
+     * primary-key column. The column set is identical across every such swap.
+     */
+    tableSchemaAtCreation;
+    /**
+     * Derived from {@link tableSchemaAtCreation}'s primary key definition, so the primary
+     * tree, every inherited secondary index, and every scan share one comparator/encoder
+     * set — and one pass of collation resolution. Rebuilt only by {@link rekeyPrimaryKey},
+     * which rebuilds the structures keyed by them in the same call.
+     */
+    pkFunctions;
     // Primary modifications BTree that inherits from parent
     primaryModifications;
     // Secondary index BTrees that inherit from parent's indexes
@@ -24,23 +45,33 @@ export class TransactionLayer {
     _hasModifications = false;
     /** Pending changes for event emission. Null if tracking disabled. */
     pendingChanges = null;
+    // NOTE: always-on, one entry per record{Upsert,Delete} call — an ordered
+    // list, so repeated writes to the same PK are all retained (last-write-wins is
+    // applied at replay by re-deriving each key's effective row on the new head).
+    // If a write-heavy transaction ever shows memory pressure from this log,
+    // collapse it to a PK-keyed last-write map (only the net per-PK effect is ever
+    // replayed).
+    /** Always-maintained log of this layer's own structural writes (see {@link OwnWrite}). */
+    ownWrites = [];
     constructor(parent) {
         this.layerId = transactionLayerCounter++;
         this.parentLayer = parent;
+        this.collationResolver = parent.collationResolver;
         const schema = parent.getSchema();
         if (!schema) {
             throw new QuereusError(`TransactionLayer: parent layer ${parent.getLayerId()} has no schema. ` +
                 'This usually means a savepoint snapshot was created before the overlay was initialised.', StatusCode.INTERNAL);
         }
         this.tableSchemaAtCreation = schema; // Schema is fixed at creation
+        this.pkFunctions = createPrimaryKeyFunctions(schema, this.collationResolver);
         // Initialize primary modifications BTree with parent's primary tree as base
-        const { primaryKeyExtractorFromRow, primaryKeyComparator } = this.getPkExtractorsAndComparators(this.tableSchemaAtCreation);
+        const { extractFromRow, compare: primaryKeyComparator } = this.pkFunctions;
         const btreeKeyFromValue = (value) => {
-            const result = primaryKeyExtractorFromRow(value);
+            const result = extractFromRow(value);
             return result;
         };
         const parentPrimaryTree = parent.getModificationTree('primary');
-        this.primaryModifications = new BTree(btreeKeyFromValue, primaryKeyComparator, parentPrimaryTree || undefined // Use parent's primary tree as base
+        this.primaryModifications = new BTree(btreeKeyFromValue, primaryKeyComparator, { base: parentPrimaryTree || undefined } // Use parent's primary tree as base
         );
         // Initialize secondary indexes that inherit from parent's secondary indexes
         this.secondaryIndexes = new Map();
@@ -53,15 +84,301 @@ export class TransactionLayer {
         // All layers of a table derive the PK comparator and encoder from the same PK
         // definition, so an inherited entry's `primaryKeys` Map keys stay valid for this
         // layer's value add/remove on each MemoryIndex entry.
-        const pkFunctions = createPrimaryKeyFunctions(schema);
+        const pkFunctions = this.pkFunctions;
         for (const indexSchema of schema.indexes) {
             const parentSecondaryTree = this.parentLayer.getSecondaryIndexTree?.(indexSchema.name);
             // Create MemoryIndex with inherited BTree
-            const memoryIndex = new MemoryIndex(indexSchema, schema.columns, pkFunctions.compare, pkFunctions.encode, parentSecondaryTree || undefined // Use parent's secondary index tree as base
+            const memoryIndex = new MemoryIndex(indexSchema, schema.columns, this.collationResolver, pkFunctions.compare, pkFunctions.encode, schema.name, parentSecondaryTree || undefined // Use parent's secondary index tree as base
             );
             this.secondaryIndexes.set(indexSchema.name, memoryIndex);
         }
     }
+    /**
+     * Adopts a schema change that was applied to the table while THIS layer's transaction
+     * is still open, so the rest of that transaction reads and enforces the new structures.
+     * Three kinds of change reach here:
+     *
+     *  - **Additive** (`create index` / `create unique index` / `add constraint … unique`):
+     *    a name absent from {@link secondaryIndexes} is built and added. Without it, a layer
+     *    created before the DDL keeps its creation-time schema: it has neither the new
+     *    `IndexSchema` (so an index scan raises "Secondary index not found") nor the derived
+     *    `uniqueConstraints` entry (so `checkUniqueConstraints` silently skips it and a
+     *    colliding insert is accepted).
+     *  - **Re-keying** (`alter column … set collate`): an index whose `IndexSchema` object
+     *    is no longer the one this layer holds is REPLACED. `BaseLayer.rebuildAllSecondaryIndexes`
+     *    hands every index a fresh BTree under the new collation, so a layer that kept its old
+     *    `MemoryIndex` would go on comparing under the old collation over an orphaned tree —
+     *    and, once it becomes the committed head at commit, would shadow the base's rebuilt
+     *    structures entirely.
+     *  - **Removal** (`drop index` / `drop constraint`): an index whose name the new schema no
+     *    longer declares is DROPPED from {@link secondaryIndexes}. Without it the layer keeps the
+     *    derived `uniqueConstraints` entry in its frozen schema and goes on enforcing a constraint
+     *    that no longer exists, and an index scan can still reach the orphaned tree via
+     *    {@link getSecondaryIndexTree}. An empty/undefined `newSchema.indexes` drops all of them.
+     *    Like the additive side, a removal is NOT undone by `rollback to savepoint`: every layer in
+     *    the chain adopts it, so the restored snapshot has the index dropped too (DDL is not
+     *    transactional here — see `feat-ddl-transaction-capability`).
+     *
+     * An index is considered unchanged only when the NEW schema's `IndexSchema` is the very
+     * object the old schema carried. Every DDL path that re-keys rebuilds those objects, and
+     * every additive path preserves them, so identity is the exact discriminator.
+     *
+     * The caller MUST apply this to a whole parent chain oldest-first: each layer builds its
+     * `MemoryIndex` over its parent's tree for that index, so the parent's must already be the
+     * new one. Only the layer's OWN writes are re-indexed — everything below is inherited
+     * copy-on-write, exactly as {@link initializeSecondaryIndexes} does at construction.
+     *
+     * Never applied to a column-set or primary-key change: either would invalidate
+     * {@link pkFunctions} and the primary tree. A PK-column collation change goes to
+     * {@link rekeyPrimaryKey} instead, and `ensureSchemaChangeSafety` raises BUSY when any
+     * connection other than the DDL issuer holds a pending layer.
+     */
+    adoptSchema(newSchema) {
+        const oldSchema = this.tableSchemaAtCreation;
+        this.tableSchemaAtCreation = newSchema;
+        // Additive + re-key: add an index the layer lacks, replace one the new schema rebuilt.
+        for (const indexSchema of newSchema.indexes ?? []) {
+            const held = this.secondaryIndexes.get(indexSchema.name);
+            const previous = oldSchema.indexes?.find(ix => ix.name === indexSchema.name);
+            if (held && previous === indexSchema)
+                continue;
+            const parentSecondaryTree = this.parentLayer.getSecondaryIndexTree?.(indexSchema.name);
+            const memoryIndex = new MemoryIndex(indexSchema, newSchema.columns, this.collationResolver, this.pkFunctions.compare, this.pkFunctions.encode, newSchema.name, parentSecondaryTree || undefined);
+            this.reindexOwnWrites(memoryIndex);
+            this.secondaryIndexes.set(indexSchema.name, memoryIndex);
+        }
+        // Removal (`drop index` / `drop constraint`): drop every held index the new schema no
+        // longer declares (empty/undefined `newSchema.indexes` drops all). Enforcement stops the
+        // moment the frozen schema loses the derived `uniqueConstraints` entry; dropping the
+        // orphaned `MemoryIndex` additionally keeps an index scan from reaching it.
+        const declared = new Set((newSchema.indexes ?? []).map(ix => ix.name));
+        for (const name of [...this.secondaryIndexes.keys()]) {
+            if (!declared.has(name))
+                this.secondaryIndexes.delete(name);
+        }
+    }
+    /**
+     * Adopts a schema change that re-keys the PRIMARY KEY — `alter column … set collate` on a
+     * PK column — applied while THIS layer's transaction is still open. Rebuilds
+     * {@link pkFunctions}, the primary tree, and every secondary index (each of which derives
+     * its `primaryKeyComparator` / `encode` from the PK definition), so nothing this layer owns
+     * survives the ALTER still keyed under the old collation.
+     *
+     * Like {@link adoptSchema}, the caller MUST apply this to a whole parent chain oldest-first
+     * (base layer already re-keyed): the new tree inherits copy-on-write from the parent's new
+     * one, so the parent's must already exist.
+     *
+     * ### Why {@link ownWrites} is rewritten to its net effect
+     *
+     * `ownWrites` is an ordered log that may touch one key repeatedly, and under the new
+     * comparator two keys that were distinct in that log can collapse into one. Replaying it
+     * verbatim would let a later write land on an earlier write's row, or a deletion remove a
+     * row a subsequent upsert had already placed. So the log is REWRITTEN here, in place, to
+     * one entry per key: the layer's effective row (read out of the pre-rekey tree), or a
+     * deletion — deletions first, and a deletion whose key an upsert now occupies is dropped
+     * entirely. The rewritten log is what every later reader of it replays: this method's own
+     * index rebuild, a `create index` later in the same transaction ({@link adoptSchema} →
+     * {@link reindexOwnWrites}), and `MemoryTableManager.commitTransaction`'s rebase.
+     *
+     * Soundness rests on a precondition `MemoryTableManager.validateRekeyedPrimaryKey` enforces
+     * before any of this runs: NO layer in the chain — base included — holds two rows that
+     * collide under the new comparator. Given that, every key here resolves to at most one row
+     * in the parent, so a deletion removes exactly the row this layer removed and an upsert
+     * lands at exactly one key.
+     *
+     * NOTE: the deletion replay assumes a key this layer deleted was a key the PARENT held.
+     * That holds because every DML operation gets its own layer (`MemoryTableConnection`'s
+     * statement savepoints), so no layer both creates and destroys a key. If a single layer
+     * ever does, `rekeyed.find(key)` can land on a *colliding* parent row and delete it: at
+     * that point the deletion needs to verify, under the OLD comparator, that the row it found
+     * is the row it removed.
+     */
+    rekeyPrimaryKey(newSchema) {
+        const preRekeyTree = this.primaryModifications;
+        const preRekeyEncode = this.pkFunctions.encode;
+        this.tableSchemaAtCreation = newSchema;
+        this.pkFunctions = createPrimaryKeyFunctions(newSchema, this.collationResolver);
+        const { extractFromRow, compare } = this.pkFunctions;
+        const parentPrimaryTree = this.parentLayer.getModificationTree('primary');
+        const rekeyed = new BTree((value) => extractFromRow(value), compare, { base: parentPrimaryTree || undefined });
+        // Net per-key effect of this layer's own writes, read out of the pre-rekey tree
+        // (`get` traverses the inheritance chain, so it yields the layer's EFFECTIVE row).
+        const deletions = [];
+        const upserts = [];
+        const seen = new Set();
+        for (const write of this.ownWrites) {
+            const encoded = preRekeyEncode(write.primaryKey);
+            if (seen.has(encoded))
+                continue;
+            seen.add(encoded);
+            const effectiveRow = preRekeyTree.get(write.primaryKey);
+            if (effectiveRow === undefined)
+                deletions.push(write.primaryKey);
+            else
+                upserts.push(effectiveRow);
+        }
+        for (const primaryKey of deletions) {
+            const path = rekeyed.find(primaryKey);
+            if (path.on)
+                rekeyed.deleteAt(path);
+        }
+        for (const row of upserts) {
+            rekeyed.upsert(row);
+        }
+        this.primaryModifications = rekeyed;
+        // A deleted key an upsert has since re-occupied (`update t set v='A' where v='a'` under
+        // NOCASE) is no longer a deletion of anything: keeping it would make the log claim both
+        // a deletion and an upsert of the same key.
+        const survivingDeletions = deletions.filter(primaryKey => rekeyed.get(primaryKey) === undefined);
+        this.ownWrites.length = 0;
+        for (const primaryKey of survivingDeletions) {
+            this.ownWrites.push({ type: 'delete', primaryKey });
+        }
+        for (const row of upserts) {
+            this.ownWrites.push({ type: 'upsert', primaryKey: extractFromRow(row), newRow: row });
+        }
+        // Every secondary index's key encoding and PK bookkeeping derive from `pkFunctions`,
+        // and each inherits the parent's freshly-rebuilt tree — so all of them are rebuilt,
+        // including ones the altered column does not appear in.
+        this.secondaryIndexes = new Map();
+        this.initializeSecondaryIndexes();
+        for (const index of this.secondaryIndexes.values()) {
+            this.reindexOwnWrites(index);
+        }
+    }
+    /**
+     * Adopts an `alter column … set data type` / `set not null` backfill conversion applied while
+     * THIS layer's transaction is still open: swaps in the new schema and rewrites the CONVERTED value
+     * into every own-written row at `colIndex`, so the rest of the transaction — and, at commit, the
+     * committed head — read the new value instead of the raw one the transaction wrote. This is what
+     * fills the transaction's OWN pending NULL rows for SET NOT NULL backfill, which live in this
+     * layer, not the base.
+     *
+     * NON-primary-key column, or a key column whose bytes are unchanged. `MemoryTableManager.alterColumn`
+     * rejects a physical retype of a key column before any mutation, and SET NOT NULL leaves the key
+     * bytes intact, so the primary key encoding is unchanged: {@link pkFunctions} and the primary tree
+     * keep their keys, and only the value at `colIndex` moves. (Contrast {@link rekeyPrimaryKey}, which
+     * must rebuild the tree because the keys themselves change.)
+     *
+     * Like {@link adoptSchema} / {@link rekeyPrimaryKey}, the caller MUST apply this oldest-first
+     * (base already converted): the layer's copy-on-write base inherits the parent's already-converted
+     * rows, so only this layer's OWN writes are rewritten here.
+     *
+     * `ownWrites` is collapsed to its net per-key effect (as {@link rekeyPrimaryKey} does) so an
+     * intermediate value a later write overwrote never reaches `convert`, and the rewritten log —
+     * carrying converted values — is what the rebase (`MemoryTableManager.rebaseLayerOntoHead`) and
+     * any later `create index` ({@link reindexOwnWrites}) replay.
+     *
+     * NULL own-values pass through untouched UNLESS `convertNulls` is set (the SET NOT NULL backfill
+     * maps null → DEFAULT). A value that fails to convert is left as-is (not an error): the manager
+     * validated every value in the effective VIEW before calling, so an unconvertible own value here is
+     * one a higher layer has shadowed — it is never read through this layer, and re-converting it would
+     * double-fault a value the transaction cannot see. It matches the base rewrite's same-reasoned skip.
+     */
+    convertColumn(colIndex, convert, newSchema, convertNulls = false) {
+        const preTree = this.primaryModifications;
+        this.tableSchemaAtCreation = newSchema;
+        // The parent's primary tree has been REPLACED by the conversion (base rebuilt from fresh
+        // rows, or a parent layer already converted oldest-first), so this layer's own tree — which
+        // derived from the OLD one — must be rebuilt over the parent's NEW tree, exactly as
+        // rekeyPrimaryKey does. The PK is unchanged (a key-column retype is rejected upstream), so
+        // pkFunctions and the keys stay; only the value at colIndex moves.
+        const { extractFromRow, compare } = this.pkFunctions;
+        const parentPrimaryTree = this.parentLayer.getModificationTree('primary');
+        const rebuilt = new BTree((value) => extractFromRow(value), compare, { base: parentPrimaryTree || undefined });
+        // Net per-key effect of this layer's own writes, read out of the pre-conversion tree. The PK
+        // is unchanged, so a key is either finally-deleted or finally-upserted, never both — no key
+        // can collapse onto another (unlike rekeyPrimaryKey).
+        const seen = new Set();
+        const survivingDeletions = [];
+        const upserts = [];
+        for (const write of this.ownWrites) {
+            const encoded = this.pkFunctions.encode(write.primaryKey);
+            if (seen.has(encoded))
+                continue;
+            seen.add(encoded);
+            // `get` traverses the inheritance chain, so this is the layer's EFFECTIVE row:
+            // undefined when the layer deleted the key, the layer's own row otherwise.
+            const effectiveRow = preTree.get(write.primaryKey);
+            if (effectiveRow === undefined) {
+                survivingDeletions.push(write.primaryKey);
+                continue;
+            }
+            const oldVal = effectiveRow[colIndex];
+            let newRow = effectiveRow;
+            if (oldVal !== null || convertNulls) {
+                try {
+                    const newVal = convert(oldVal);
+                    newRow = effectiveRow.map((v, i) => i === colIndex ? newVal : v);
+                }
+                catch {
+                    // Shadowed unconvertible own value — leave as-is (see method doc).
+                }
+            }
+            upserts.push(newRow);
+        }
+        for (const primaryKey of survivingDeletions) {
+            const path = rebuilt.find(primaryKey);
+            if (path.on)
+                rebuilt.deleteAt(path);
+        }
+        for (const row of upserts) {
+            rebuilt.upsert(row);
+        }
+        this.primaryModifications = rebuilt;
+        this.ownWrites.length = 0;
+        for (const primaryKey of survivingDeletions) {
+            this.ownWrites.push({ type: 'delete', primaryKey });
+        }
+        for (const row of upserts) {
+            this.ownWrites.push({ type: 'upsert', primaryKey: extractFromRow(row), newRow: row });
+        }
+        // Any secondary index on the column holds keys extracted from the OLD value. Rebuild every
+        // index over the parent's freshly-converted trees (matching the base's unconditional rebuild),
+        // then re-file this layer's own converted writes.
+        this.secondaryIndexes = new Map();
+        this.initializeSecondaryIndexes();
+        for (const index of this.secondaryIndexes.values()) {
+            this.reindexOwnWrites(index);
+        }
+    }
+    /**
+     * Brings a newly-inherited `MemoryIndex` (built over the parent's tree, which
+     * already covers the parent chain's effective rows) up to date with this layer's own
+     * writes: for each primary key this layer touched, drop the parent's entry and add
+     * this layer's effective row, if any. Both operations copy-on-write into this
+     * layer's tree, leaving the parent's entries untouched.
+     *
+     * Driven by {@link ownWrites} (deduplicated by primary key — the log is an ordered
+     * list that may touch one key repeatedly) rather than a full scan, so the cost is
+     * proportional to the transaction's writes, not the table's size.
+     *
+     * The parent's entry is dropped under the PARENT row's own primary key, not under the
+     * key the write names. After {@link rekeyPrimaryKey} the two can differ — a write of
+     * `'A'` resolves, under NOCASE, to a parent row keyed `'a'` — and filing the removal
+     * under the write's key would leave the parent's entry in place, so an index scan would
+     * return the row twice.
+     */
+    reindexOwnWrites(index) {
+        const parentPrimaryTree = this.parentLayer.getModificationTree('primary');
+        const seen = new Set();
+        for (const write of this.ownWrites) {
+            const encoded = this.pkFunctions.encode(write.primaryKey);
+            if (seen.has(encoded))
+                continue;
+            seen.add(encoded);
+            const parentRow = parentPrimaryTree?.get(write.primaryKey);
+            if (parentRow !== undefined && index.rowMatchesPredicate(parentRow)) {
+                index.removeEntry(index.keyFromRow(parentRow), this.pkFunctions.extractFromRow(parentRow));
+            }
+            // `get` traverses the inheritance chain, so this is the layer's EFFECTIVE row:
+            // undefined when the layer deleted the key, the layer's own row otherwise.
+            const ownRow = this.primaryModifications.get(write.primaryKey);
+            if (ownRow !== undefined && index.rowMatchesPredicate(ownRow)) {
+                index.addEntry(index.keyFromRow(ownRow), this.pkFunctions.extractFromRow(ownRow));
+            }
+        }
+    }
     getLayerId() {
         return this.layerId;
     }
@@ -97,16 +414,20 @@ export class TransactionLayer {
     getPendingChanges() {
         return this.pendingChanges ?? [];
     }
+    /** This layer's own structural writes, oldest-first — the rebase replay source. */
+    getOwnWrites() {
+        return this.ownWrites;
+    }
     getPkExtractorsAndComparators(schema) {
         if (schema !== this.tableSchemaAtCreation) {
             warnLog("TransactionLayer.getPkExtractorsAndComparators called with a schema different from its creation schema. Using creation schema.");
         }
         // Use the centralized primary key functions instead of duplicating the logic
         // This ensures consistent handling of empty primary key definitions
-        const pkFunctions = createPrimaryKeyFunctions(this.tableSchemaAtCreation);
         return {
-            primaryKeyExtractorFromRow: pkFunctions.extractFromRow,
-            primaryKeyComparator: pkFunctions.compare
+            primaryKeyExtractorFromRow: this.pkFunctions.extractFromRow,
+            primaryKeyComparator: this.pkFunctions.compare,
+            primaryKeyEncoder: this.pkFunctions.encode
         };
     }
     getModificationTree(indexName) {
@@ -126,6 +447,8 @@ export class TransactionLayer {
             throw new QuereusError("Cannot modify a committed layer");
         this._hasModifications = true;
         this.primaryModifications.upsert(newRowData);
+        // Always-on replay log (independent of change tracking).
+        this.ownWrites.push({ type: 'upsert', primaryKey, newRow: newRowData });
         // Track change for event emission
         if (this.pendingChanges) {
             this.pendingChanges.push({
@@ -193,6 +516,8 @@ export class TransactionLayer {
         }
         // If key doesn't exist, there's nothing to delete - no deletion marker needed
         // Inheritree's copy-on-write semantics handle this properly
+        // Always-on replay log (independent of change tracking).
+        this.ownWrites.push({ type: 'delete', primaryKey });
         // Track change for event emission
         if (this.pendingChanges) {
             this.pendingChanges.push({

package/dist/src/vtab/memory/layer/transaction.js.map

@@ -1 +1 @@
-{"version":3,"file":"transaction.js","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/transaction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAI1C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,yBAAyB,EAAE,MAAM,yBAAyB,CAAC;AACpE,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAEtD,MAAM,GAAG,GAAG,YAAY,CAAC,+BAA+B,CAAC,CAAC;AAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAEnC,IAAI,uBAAuB,GAAG,IAAI,CAAC;AAYnC;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACX,OAAO,CAAS;IACjB,WAAW,CAAQ;IAClB,qBAAqB,CAAc,CAAC,qCAAqC;IAE1F,wDAAwD;IAChD,oBAAoB,CAAiC;IAE7D,4DAA4D;IACpD,gBAAgB,CAA2B;IAE3C,YAAY,GAAY,KAAK,CAAC;IAC9B,iBAAiB,GAAY,KAAK,CAAC;IAE3C,qEAAqE;IAC7D,cAAc,GAA2B,IAAI,CAAC;IAEtD,YAAY,MAAa;QACxB,IAAI,CAAC,OAAO,GAAG,uBAAuB,EAAE,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;QAC1B,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,MAAM,IAAI,YAAY,CACrB,kCAAkC,MAAM,CAAC,UAAU,EAAE,kBAAkB;gBACvE,yFAAyF,EACzF,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,qBAAqB,GAAG,MAAM,CAAC,CAAC,8BAA8B;QAEnE,4EAA4E;QAC5E,MAAM,EAAE,0BAA0B,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC,6BAA6B,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC5H,MAAM,iBAAiB,GAAG,CAAC,KAAU,EAAsB,EAAE;YAC5D,MAAM,MAAM,GAAG,0BAA0B,CAAC,KAAK,CAAC,CAAC;YACjD,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;QAEF,MAAM,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAEhE,IAAI,CAAC,oBAAoB,GAAG,IAAI,KAAK,CACpC,iBAAiB,EACjB,oBAAoB,EACpB,iBAAiB,IAAI,SAAS,CAAC,oCAAoC;SACnE,CAAC;QAEF,4EAA4E;QAC5E,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;IACnC,CAAC;IAEO,0BAA0B;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QAE5B,8EAA8E;QAC9E,iFAAiF;QACjF,sDAAsD;QACtD,MAAM,WAAW,GAAG,yBAAyB,CAAC,MAAM,CAAC,CAAC;QAEtD,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvF,0CAA0C;YAC1C,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,WAAW,EACX,MAAM,CAAC,OAAO,EACd,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,MAAM,EAClB,mBAAmB,IAAI,SAAS,CAAC,4CAA4C;aAC7E,CAAC;YACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;IAED,UAAU;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,SAAS;QACR,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED,SAAS;QACR,4DAA4D;QAC5D,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACnC,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED,yEAAyE;IACzE,aAAa;QACZ,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,oFAAoF;QACrF,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,oBAAoB;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QAC1B,CAAC;IACF,CAAC;IAED;;OAEG;IACH,iBAAiB;QAChB,OAAO,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC;IAClC,CAAC;IAEM,6BAA6B,CAAC,MAAmB;QAIvD,IAAI,MAAM,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC3C,OAAO,CAAC,gIAAgI,CAAC,CAAC;QAC3I,CAAC;QAED,6EAA6E;QAC7E,oEAAoE;QACpE,MAAM,WAAW,GAAG,yBAAyB,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;QAC1E,OAAO;YACN,0BAA0B,EAAE,WAAW,CAAC,cAAc;YACtD,oBAAoB,EAAE,WAAW,CAAC,OAAO;SACzC,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,SAA6B;QAChD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC;QAC9D,OAAO,IAAI,CAAC,CAAC,2DAA2D;IACzE,CAAC;IAED,qBAAqB,CAAC,SAAiB;QACtC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;IAC3D,CAAC;IAED,iBAAiB,CAAC,SAAiB;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,4DAA4D;IAC5D,YAAY,CAAC,UAA8B,EAAE,UAAe,EAAE,kBAA+B;QAC5F,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAE7C,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;gBAC9C,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,kBAAkB,IAAI,SAAS;gBACvC,MAAM,EAAE,UAAU;aAClB,CAAC,CAAC;QACJ,CAAC;QAED,+DAA+D;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,MAAM,UAAU,GAAG,WAAW,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;gBAE/D,IAAI,kBAAkB,EAAE,CAAC,CAAC,SAAS;oBAClC,MAAM,UAAU,GAAG,WAAW,CAAC,mBAAmB,CAAC,kBAAkB,CAAC,CAAC;oBAEvE,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU;wBAAE,SAAS;oBAEzC,IAAI,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;wBAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;wBAC/D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,SAAS;oBACV,CAAC;oBAED,IAAI,CAAC,UAAU,IAAI,UAAU,EAAE,CAAC;wBAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;wBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBAC9C,SAAS;oBACV,CAAC;oBAED,gBAAgB;oBAChB,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBAEvD,+CAA+C;oBAC/C,IAAI,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACP,2DAA2D;wBAC3D,oEAAoE;wBACpE,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;gBACF,CAAC;qBAAM,CAAC,CAAC,SAAS;oBACjB,IAAI,CAAC,UAAU;wBAAE,SAAS;oBAC1B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,iDAAiD;IACjD,YAAY,CAAC,UAA8B,EAAE,oBAAyB;QACrE,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,IAAI,YAAY,CAAC,EAAE,EAAE,CAAC;YACrB,kEAAkE;YAClE,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QACD,8EAA8E;QAC9E,4DAA4D;QAE5D,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,oBAAoB;aAC5B,CAAC,CAAC;QACJ,CAAC;QAED,oFAAoF;QACpF,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,oBAAoB,CAAC;oBAAE,SAAS;gBAErE,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;gBACjE,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;IACF,CAAC;IAEM,UAAU;QAChB,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,SAAS;QACf,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,CAAC;QACtC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,WAAW,CAAC,SAAS,EAAE,CAAC;QACzB,CAAC;IACF,CAAC;CACD"}
+{"version":3,"file":"transaction.js","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/transaction.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAEnC,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAI1C,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,yBAAyB,EAA4B,MAAM,yBAAyB,CAAC;AAC9F,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AACzD,OAAO,EAAE,UAAU,EAAE,MAAM,0BAA0B,CAAC;AAGtD,MAAM,GAAG,GAAG,YAAY,CAAC,+BAA+B,CAAC,CAAC;AAC1D,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;AAEnC,IAAI,uBAAuB,GAAG,IAAI,CAAC;AA0BnC;;;;GAIG;AACH,MAAM,OAAO,gBAAgB;IACX,OAAO,CAAS;IACjB,WAAW,CAAQ;IACnC;;;;;OAKG;IACa,iBAAiB,CAAoB;IACrD;;;;;;OAMG;IACK,qBAAqB,CAAc;IAE3C;;;;;OAKG;IACK,WAAW,CAAsB;IAEzC,wDAAwD;IAChD,oBAAoB,CAAiC;IAE7D,4DAA4D;IACpD,gBAAgB,CAA2B;IAE3C,YAAY,GAAY,KAAK,CAAC;IAC9B,iBAAiB,GAAY,KAAK,CAAC;IAE3C,qEAAqE;IAC7D,cAAc,GAA2B,IAAI,CAAC;IAEtD,yEAAyE;IACzE,+EAA+E;IAC/E,8EAA8E;IAC9E,yEAAyE;IACzE,+EAA+E;IAC/E,aAAa;IACb,0FAA0F;IACzE,SAAS,GAAe,EAAE,CAAC;IAE5C,YAAY,MAAa;QACxB,IAAI,CAAC,OAAO,GAAG,uBAAuB,EAAE,CAAC;QACzC,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC;QAC1B,IAAI,CAAC,iBAAiB,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAClD,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,EAAE,CAAC;QAClC,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,MAAM,IAAI,YAAY,CACrB,kCAAkC,MAAM,CAAC,UAAU,EAAE,kBAAkB;gBACvE,yFAAyF,EACzF,UAAU,CAAC,QAAQ,CACnB,CAAC;QACH,CAAC;QACD,IAAI,CAAC,qBAAqB,GAAG,MAAM,CAAC,CAAC,8BAA8B;QACnE,IAAI,CAAC,WAAW,GAAG,yBAAyB,CAAC,MAAM,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAE7E,4EAA4E;QAC5E,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,oBAAoB,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;QAC3E,MAAM,iBAAiB,GAAG,CAAC,KAAU,EAAsB,EAAE;YAC5D,MAAM,MAAM,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;YACrC,OAAO,MAAM,CAAC;QACf,CAAC,CAAC;QAEF,MAAM,iBAAiB,GAAG,MAAM,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAEhE,IAAI,CAAC,oBAAoB,GAAG,IAAI,KAAK,CACpC,iBAAiB,EACjB,oBAAoB,EACpB,EAAE,IAAI,EAAE,iBAAiB,IAAI,SAAS,EAAE,CAAC,oCAAoC;SAC7E,CAAC;QAEF,4EAA4E;QAC5E,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;IACnC,CAAC;IAEO,0BAA0B;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC1C,IAAI,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QAE5B,8EAA8E;QAC9E,iFAAiF;QACjF,sDAAsD;QACtD,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;QAErC,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC1C,MAAM,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvF,0CAA0C;YAC1C,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,WAAW,EACX,MAAM,CAAC,OAAO,EACd,IAAI,CAAC,iBAAiB,EACtB,WAAW,CAAC,OAAO,EACnB,WAAW,CAAC,MAAM,EAClB,MAAM,CAAC,IAAI,EACX,mBAAmB,IAAI,SAAS,CAAC,4CAA4C;aAC7E,CAAC;YACF,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAuCG;IACI,WAAW,CAAC,SAAsB;QACxC,MAAM,SAAS,GAAG,IAAI,CAAC,qBAAqB,CAAC;QAC7C,IAAI,CAAC,qBAAqB,GAAG,SAAS,CAAC;QAEvC,uFAAuF;QACvF,KAAK,MAAM,WAAW,IAAI,SAAS,CAAC,OAAO,IAAI,EAAE,EAAE,CAAC;YACnD,MAAM,IAAI,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACzD,MAAM,QAAQ,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,KAAK,WAAW,CAAC,IAAI,CAAC,CAAC;YAC7E,IAAI,IAAI,IAAI,QAAQ,KAAK,WAAW;gBAAE,SAAS;YAE/C,MAAM,mBAAmB,GAAG,IAAI,CAAC,WAAW,CAAC,qBAAqB,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvF,MAAM,WAAW,GAAG,IAAI,WAAW,CAClC,WAAW,EACX,SAAS,CAAC,OAAO,EACjB,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,WAAW,CAAC,OAAO,EACxB,IAAI,CAAC,WAAW,CAAC,MAAM,EACvB,SAAS,CAAC,IAAI,EACd,mBAAmB,IAAI,SAAS,CAChC,CAAC;YACF,IAAI,CAAC,gBAAgB,CAAC,WAAW,CAAC,CAAC;YACnC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;QAED,sFAAsF;QACtF,yFAAyF;QACzF,qFAAqF;QACrF,4EAA4E;QAC5E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;QACvE,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC7D,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;OAmCG;IACI,eAAe,CAAC,SAAsB;QAC5C,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC/C,MAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC;QAE/C,IAAI,CAAC,qBAAqB,GAAG,SAAS,CAAC;QACvC,IAAI,CAAC,WAAW,GAAG,yBAAyB,CAAC,SAAS,EAAE,IAAI,CAAC,iBAAiB,CAAC,CAAC;QAEhF,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;QACrD,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,IAAI,KAAK,CACxB,CAAC,KAAU,EAAsB,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EACzD,OAAO,EACP,EAAE,IAAI,EAAE,iBAAiB,IAAI,SAAS,EAAE,CACxC,CAAC;QAEF,gFAAgF;QAChF,mFAAmF;QACnF,MAAM,SAAS,GAAyB,EAAE,CAAC;QAC3C,MAAM,OAAO,GAAU,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,cAAc,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACjD,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAElB,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACxD,IAAI,YAAY,KAAK,SAAS;gBAAE,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;;gBAC5D,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QACjC,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,SAAS,EAAE,CAAC;YACpC,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtC,IAAI,IAAI,CAAC,EAAE;gBAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,oBAAoB,GAAG,OAAO,CAAC;QAEpC,wFAAwF;QACxF,wFAAwF;QACxF,4CAA4C;QAC5C,MAAM,kBAAkB,GAAG,SAAS,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC,CAAC;QACjG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,MAAM,UAAU,IAAI,kBAAkB,EAAE,CAAC;YAC7C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACvF,CAAC;QAED,qFAAqF;QACrF,oFAAoF;QACpF,wDAAwD;QACxD,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;OA4BG;IACI,aAAa,CAAC,QAAgB,EAAE,OAAkC,EAAE,SAAsB,EAAE,YAAY,GAAG,KAAK;QACtH,MAAM,OAAO,GAAG,IAAI,CAAC,oBAAoB,CAAC;QAC1C,IAAI,CAAC,qBAAqB,GAAG,SAAS,CAAC;QAEvC,yFAAyF;QACzF,4FAA4F;QAC5F,oFAAoF;QACpF,2FAA2F;QAC3F,mEAAmE;QACnE,MAAM,EAAE,cAAc,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;QACrD,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAC1E,MAAM,OAAO,GAAG,IAAI,KAAK,CACxB,CAAC,KAAU,EAAsB,EAAE,CAAC,cAAc,CAAC,KAAK,CAAC,EACzD,OAAO,EACP,EAAE,IAAI,EAAE,iBAAiB,IAAI,SAAS,EAAE,CACxC,CAAC;QAEF,6FAA6F;QAC7F,4FAA4F;QAC5F,sDAAsD;QACtD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,kBAAkB,GAAyB,EAAE,CAAC;QACpD,MAAM,OAAO,GAAU,EAAE,CAAC;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC1D,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAElB,+EAA+E;YAC/E,2EAA2E;YAC3E,MAAM,YAAY,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YACnD,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;gBAChC,kBAAkB,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;gBAC1C,SAAS;YACV,CAAC;YACD,MAAM,MAAM,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;YACtC,IAAI,MAAM,GAAG,YAAY,CAAC;YAC1B,IAAI,MAAM,KAAK,IAAI,IAAI,YAAY,EAAE,CAAC;gBACrC,IAAI,CAAC;oBACJ,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC/B,MAAM,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAQ,CAAC;gBACzE,CAAC;gBAAC,MAAM,CAAC;oBACR,mEAAmE;gBACpE,CAAC;YACF,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,kBAAkB,EAAE,CAAC;YAC7C,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtC,IAAI,IAAI,CAAC,EAAE;gBAAE,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC3B,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACrB,CAAC;QACD,IAAI,CAAC,oBAAoB,GAAG,OAAO,CAAC;QAEpC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC;QAC1B,KAAK,MAAM,UAAU,IAAI,kBAAkB,EAAE,CAAC;YAC7C,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;QACrD,CAAC;QACD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,cAAc,CAAC,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,CAAC,CAAC;QACvF,CAAC;QAED,2FAA2F;QAC3F,+FAA+F;QAC/F,kDAAkD;QAClD,IAAI,CAAC,gBAAgB,GAAG,IAAI,GAAG,EAAE,CAAC;QAClC,IAAI,CAAC,0BAA0B,EAAE,CAAC;QAClC,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC9B,CAAC;IACF,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACK,gBAAgB,CAAC,KAAkB;QAC1C,MAAM,iBAAiB,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QAC1E,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAE/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACpC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC1D,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC;gBAAE,SAAS;YAChC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAElB,MAAM,SAAS,GAAG,iBAAiB,EAAE,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC3D,IAAI,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,mBAAmB,CAAC,SAAS,CAAC,EAAE,CAAC;gBACrE,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC,SAAS,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,SAAS,CAAC,CAAC,CAAC;YAC5F,CAAC;YACD,+EAA+E;YAC/E,2EAA2E;YAC3E,MAAM,MAAM,GAAG,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC;YAC/D,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,mBAAmB,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/D,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,WAAW,CAAC,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;YACnF,CAAC;QACF,CAAC;IACF,CAAC;IAED,UAAU;QACT,OAAO,IAAI,CAAC,OAAO,CAAC;IACrB,CAAC;IAED,SAAS;QACR,OAAO,IAAI,CAAC,WAAW,CAAC;IACzB,CAAC;IAED,SAAS;QACR,4DAA4D;QAC5D,OAAO,IAAI,CAAC,qBAAqB,CAAC;IACnC,CAAC;IAED,WAAW;QACV,OAAO,IAAI,CAAC,YAAY,CAAC;IAC1B,CAAC;IAED,yEAAyE;IACzE,aAAa;QACZ,IAAI,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC;YACxB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC;YACzB,oFAAoF;QACrF,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,oBAAoB;QACnB,IAAI,CAAC,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1B,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC;QAC1B,CAAC;IACF,CAAC;IAED;;OAEG;IACH,iBAAiB;QAChB,OAAO,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC;IAClC,CAAC;IAED,mFAAmF;IACnF,YAAY;QACX,OAAO,IAAI,CAAC,SAAS,CAAC;IACvB,CAAC;IAEM,6BAA6B,CAAC,MAAmB;QACvD,IAAI,MAAM,KAAK,IAAI,CAAC,qBAAqB,EAAE,CAAC;YAC3C,OAAO,CAAC,gIAAgI,CAAC,CAAC;QAC3I,CAAC;QAED,6EAA6E;QAC7E,oEAAoE;QACpE,OAAO;YACN,0BAA0B,EAAE,IAAI,CAAC,WAAW,CAAC,cAAc;YAC3D,oBAAoB,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO;YAC9C,iBAAiB,EAAE,IAAI,CAAC,WAAW,CAAC,MAAM;SAC1C,CAAC;IACH,CAAC;IAED,mBAAmB,CAAC,SAA6B;QAChD,IAAI,SAAS,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC,oBAAoB,CAAC;QAC9D,OAAO,IAAI,CAAC,CAAC,2DAA2D;IACzE,CAAC;IAED,qBAAqB,CAAC,SAAiB;QACtC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;IAC3D,CAAC;IAED,iBAAiB,CAAC,SAAiB;QAClC,OAAO,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;IAC7C,CAAC;IAED,4DAA4D;IAC5D,YAAY,CAAC,UAA8B,EAAE,UAAe,EAAE,kBAA+B;QAC5F,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAE7C,yDAAyD;QACzD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,CAAC,CAAC;QAExE,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,kBAAkB,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;gBAC9C,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,kBAAkB,IAAI,SAAS;gBACvC,MAAM,EAAE,UAAU;aAClB,CAAC,CAAC;QACJ,CAAC;QAED,+DAA+D;QAC/D,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,MAAM,UAAU,GAAG,WAAW,CAAC,mBAAmB,CAAC,UAAU,CAAC,CAAC;gBAE/D,IAAI,kBAAkB,EAAE,CAAC,CAAC,SAAS;oBAClC,MAAM,UAAU,GAAG,WAAW,CAAC,mBAAmB,CAAC,kBAAkB,CAAC,CAAC;oBAEvE,IAAI,CAAC,UAAU,IAAI,CAAC,UAAU;wBAAE,SAAS;oBAEzC,IAAI,UAAU,IAAI,CAAC,UAAU,EAAE,CAAC;wBAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;wBAC/D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,SAAS;oBACV,CAAC;oBAED,IAAI,CAAC,UAAU,IAAI,UAAU,EAAE,CAAC;wBAC/B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;wBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBAC9C,SAAS;oBACV,CAAC;oBAED,gBAAgB;oBAChB,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;oBAC/D,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBAEvD,+CAA+C;oBAC/C,IAAI,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC7D,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;wBACjD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;yBAAM,CAAC;wBACP,2DAA2D;wBAC3D,oEAAoE;wBACpE,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;oBAC/C,CAAC;gBACF,CAAC;qBAAM,CAAC,CAAC,SAAS;oBACjB,IAAI,CAAC,UAAU;wBAAE,SAAS;oBAC1B,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;oBACvD,WAAW,CAAC,QAAQ,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;gBAC/C,CAAC;YACF,CAAC;QACF,CAAC;IACF,CAAC;IAED,iDAAiD;IACjD,YAAY,CAAC,UAA8B,EAAE,oBAAyB;QACrE,IAAI,IAAI,CAAC,YAAY;YAAE,MAAM,IAAI,YAAY,CAAC,iCAAiC,CAAC,CAAC;QAEjF,IAAI,CAAC,iBAAiB,GAAG,IAAI,CAAC;QAC9B,0BAA0B;QAC1B,MAAM,YAAY,GAAG,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAChE,IAAI,YAAY,CAAC,EAAE,EAAE,CAAC;YACrB,kEAAkE;YAClE,IAAI,CAAC,oBAAoB,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC;QAClD,CAAC;QACD,8EAA8E;QAC9E,4DAA4D;QAE5D,yDAAyD;QACzD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC,CAAC;QAEpD,kCAAkC;QAClC,IAAI,IAAI,CAAC,cAAc,EAAE,CAAC;YACzB,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC;gBACxB,IAAI,EAAE,QAAQ;gBACd,EAAE,EAAE,UAAU;gBACd,MAAM,EAAE,oBAAoB;aAC5B,CAAC,CAAC;QACJ,CAAC;QAED,oFAAoF;QACpF,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,EAAE,CAAC;QAChC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,KAAK,MAAM,WAAW,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;gBAC1C,MAAM,WAAW,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;gBAChE,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAE3B,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,oBAAoB,CAAC;oBAAE,SAAS;gBAErE,MAAM,WAAW,GAAG,WAAW,CAAC,UAAU,CAAC,oBAAoB,CAAC,CAAC;gBACjE,WAAW,CAAC,WAAW,CAAC,WAAW,EAAE,UAAU,CAAC,CAAC;YAClD,CAAC;QACF,CAAC;IACF,CAAC;IAEM,UAAU;QAChB,OAAO,IAAI,CAAC,iBAAiB,CAAC;IAC/B,CAAC;IAED;;;OAGG;IACI,SAAS;QACf,IAAI,CAAC,oBAAoB,CAAC,SAAS,EAAE,CAAC;QACtC,KAAK,MAAM,WAAW,IAAI,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1D,WAAW,CAAC,SAAS,EAAE,CAAC;QACzB,CAAC;IACF,CAAC;CACD"}

package/dist/src/vtab/memory/module.d.ts

@@ -1,7 +1,7 @@
 import type { Database } from '../../core/database.js';
 import { type TableSchema, type IndexSchema } from '../../schema/table.js';
 import { MemoryTable } from './table.js';
-import type { VirtualTableModule, SchemaChangeInfo } from '../module.js';
+import type { VirtualTableModule, SchemaChangeInfo, EffectiveRowSource } from '../module.js';
 import { MemoryTableManager } from './layer/manager.js';
 import type { BackingHost } from '../backing-host.js';
 import type { MemoryTableConfig } from './types.js';
@@ -106,7 +106,14 @@ export declare class MemoryTableModule implements VirtualTableModule<MemoryTable
      */
     private findEqualityMatches;
     /**
-     * Find range match for a column
+     * Find range match for a column.
+     *
+     * Claims at most the FIRST lower ('>'/'>=') and the FIRST upper ('<'/'<=') bound,
+     * matching what `rule-select-access-path` actually turns into seek bounds (it picks
+     * per column by position). Claiming a redundant same-side bound as handled would
+     * drop it from the residual filter without ever applying it — `where v > 10 and
+     * v > 30` would wrongly return the `v > 10` rows. Redundant bounds stay unhandled
+     * and survive as a residual `Filter`.
      */
     private findRangeMatch;
     /**
@@ -171,11 +178,11 @@ export declare class MemoryTableModule implements VirtualTableModule<MemoryTable
     /**
      * Alters an existing memory table's structure (ADD/DROP/RENAME COLUMN).
      */
-    alterTable(db: Database, schemaName: string, tableName: string, change: SchemaChangeInfo): Promise<TableSchema>;
+    alterTable(db: Database, schemaName: string, tableName: string, change: SchemaChangeInfo, rows?: EffectiveRowSource): Promise<TableSchema>;
     /**
      * Creates an index on a memory table
      */
-    createIndex(db: Database, schemaName: string, tableName: string, indexSchema: IndexSchema): Promise<void>;
+    createIndex(db: Database, schemaName: string, tableName: string, indexSchema: IndexSchema, rows?: EffectiveRowSource): Promise<void>;
     /**
      * Drops an index from a memory table
      */

package/dist/src/vtab/memory/module.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"module.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/module.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAAqB,MAAM,uBAAuB,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,cAAc,CAAC;AACzE,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAuD,MAAM,oBAAoB,CAAC;AAI3G,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAGpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,oBAAoB,EAAqC,MAAM,wBAAwB,CAAC;AAC7H,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAsGrD;;;;GAIG;AACH,qBAAa,iBAAkB,YAAW,kBAAkB,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAC3F;;;;;;;;;;;;;;;;;;;OAmBG;IACH,QAAQ,CAAC,eAAe,EAAG,iBAAiB,CAAU;IAEtD;;;;;;;;OAQG;IACH,QAAQ,CAAC,qBAAqB,EAAG,IAAI,CAAU;IAE/C,SAAgB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAa;IACpE,OAAO,CAAC,YAAY,CAAC,CAAqB;gBAE9B,YAAY,CAAC,EAAE,kBAAkB;IAI7C;;OAEG;IACH,eAAe,IAAI,kBAAkB,GAAG,SAAS;IAIjD;;;OAGG;IACH,eAAe,IAAI,kBAAkB;IAUrC;;;;;OAKG;IACH,wBAAwB,CAAC,GAAG,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,GAAG,SAAS,oBAAoB,EAAE;IAI7F;;;;;OAKG;IACH,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAK7F;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAuC1E;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,YAAY,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAcnL;;OAEG;IACH,iBAAiB,CAChB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,qBAAqB,GAC5B,oBAAoB;IAwBvB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAwG1B;;;;OAIG;IACH,OAAO,CAAC,2BAA2B;IAkDnC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IAqF3B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAwC3B;;OAEG;IACH,OAAO,CAAC,cAAc;IAwBtB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAgBxB;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,OAAO,CAAC,qBAAqB;IAgE7B;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,yBAAyB;IAmEjC;;;;;;;OAOG;IACH,OAAO,CAAC,sBAAsB;IAsC9B,OAAO,CAAC,sBAAsB;IAuB9B;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBpH;;;OAGG;IACG,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAWrG;;OAEG;IACG,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,GAAG,OAAO,CAAC,WAAW,CAAC;IAiDrH;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAkB/G;;OAEG;IACG,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAevG"}
+{"version":3,"file":"module.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/module.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AACvD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,WAAW,EAAqB,MAAM,uBAAuB,CAAC;AAC9F,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACzC,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AAC7F,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EAAE,WAAW,EAAuD,MAAM,oBAAoB,CAAC;AAI3G,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,YAAY,CAAC;AAGpD,OAAO,KAAK,EAAE,qBAAqB,EAAE,oBAAoB,EAAqC,MAAM,wBAAwB,CAAC;AAC7H,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,cAAc,CAAC;AACvD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AACxE,OAAO,KAAK,EAAE,MAAM,EAAE,MAAM,wBAAwB,CAAC;AAsGrD;;;;GAIG;AACH,qBAAa,iBAAkB,YAAW,kBAAkB,CAAC,WAAW,EAAE,iBAAiB,CAAC;IAC3F;;;;;;;;;;;;;;;;;;;OAmBG;IACH,QAAQ,CAAC,eAAe,EAAG,iBAAiB,CAAU;IAEtD;;;;;;;;OAQG;IACH,QAAQ,CAAC,qBAAqB,EAAG,IAAI,CAAU;IAE/C,SAAgB,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAa;IACpE,OAAO,CAAC,YAAY,CAAC,CAAqB;gBAE9B,YAAY,CAAC,EAAE,kBAAkB;IAI7C;;OAEG;IACH,eAAe,IAAI,kBAAkB,GAAG,SAAS;IAIjD;;;OAGG;IACH,eAAe,IAAI,kBAAkB;IAcrC;;;;;OAKG;IACH,wBAAwB,CAAC,GAAG,EAAE,QAAQ,EAAE,WAAW,EAAE,MAAM,GAAG,SAAS,oBAAoB,EAAE;IAI7F;;;;;OAKG;IACH,cAAc,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,WAAW,GAAG,SAAS;IAK7F;;OAEG;IACG,MAAM,CAAC,EAAE,EAAE,QAAQ,EAAE,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAuC1E;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,iBAAiB,EAAE,YAAY,CAAC,EAAE,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;IAcnL;;OAEG;IACH,iBAAiB,CAChB,EAAE,EAAE,QAAQ,EACZ,SAAS,EAAE,WAAW,EACtB,OAAO,EAAE,qBAAqB,GAC5B,oBAAoB;IAwBvB;;OAEG;IACH,OAAO,CAAC,kBAAkB;IAwG1B;;;;OAIG;IACH,OAAO,CAAC,2BAA2B;IAkDnC;;OAEG;IACH,OAAO,CAAC,mBAAmB;IA6F3B;;;;OAIG;IACH,OAAO,CAAC,mBAAmB;IAwC3B;;;;;;;;;OASG;IACH,OAAO,CAAC,cAAc;IAuBtB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAgBxB;;;;;;;;;;;;;;;;;;;;;OAqBG;IACH,OAAO,CAAC,qBAAqB;IAgE7B;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,yBAAyB;IAmEjC;;;;;;;OAOG;IACH,OAAO,CAAC,sBAAsB;IAsC9B,OAAO,CAAC,sBAAsB;IAuB9B;;OAEG;IACG,OAAO,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAqBpH;;;OAGG;IACG,WAAW,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAWrG;;OAEG;IACG,UAAU,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,gBAAgB,EAAE,IAAI,CAAC,EAAE,kBAAkB,GAAG,OAAO,CAAC,WAAW,CAAC;IAiDhJ;;OAEG;IACG,WAAW,CAAC,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,IAAI,CAAC,EAAE,kBAAkB,GAAG,OAAO,CAAC,IAAI,CAAC;IAkB1I;;OAEG;IACG,SAAS,CAAC,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAevG"}

package/dist/src/vtab/memory/module.js

@@ -154,6 +154,10 @@ export class MemoryTableModule {
             persistent: false,
             secondaryIndexes: true,
             rangeScans: true,
+            // Schema changes here escape the transaction (they survive rollback), but
+            // buffered DML still rolls back normally — the SchemaManager catalog is not
+            // transaction-scoped. See docs/memory-table.md § "DDL and transactions".
+            ddlTransactionality: 'non-transactional',
         };
     }
     /**
@@ -405,7 +409,15 @@ export class MemoryTableModule {
                 .setExplanation(`Index ${isMultiSeek ? `multi-seek(${inCardinality})` : 'seek'} on ${index.name}`)
                 .build();
         }
-        // Prefix-equality + trailing-range on composite indexes
+        // Prefix-equality + trailing-range on composite indexes.
+        //
+        // NOTE: `findEqualityMatches` counts a multi-value `IN` as a prefix match, but
+        // `rule-select-access-path` can only seek a *single-valued* prefix key, so for
+        // e.g. `a in (1, 2) and b > 15` it declines to a sequential scan and reattaches
+        // both predicates as a residual. Correct, but the cost advertised below is a
+        // range scan. If multi-value-IN prefixes with trailing ranges ever show up as
+        // slow plans, teach the rule a cross-product prefix-range seek (or stop claiming
+        // the trailing range here so the estimate matches the plan).
         if (equalityMatches.matchCount > 0 && equalityMatches.matchCount < indexCols.length) {
             const trailingCol = indexCols[equalityMatches.matchCount];
             const trailingRange = this.findRangeMatch(trailingCol, request.filters);
@@ -494,7 +506,14 @@ export class MemoryTableModule {
         return { matchCount, handledFilters, inCardinality };
     }
     /**
-     * Find range match for a column
+     * Find range match for a column.
+     *
+     * Claims at most the FIRST lower ('>'/'>=') and the FIRST upper ('<'/'<=') bound,
+     * matching what `rule-select-access-path` actually turns into seek bounds (it picks
+     * per column by position). Claiming a redundant same-side bound as handled would
+     * drop it from the residual filter without ever applying it — `where v > 10 and
+     * v > 30` would wrongly return the `v > 10` rows. Redundant bounds stay unhandled
+     * and survive as a residual `Filter`.
      */
     findRangeMatch(indexCol, filters) {
         const handledFilters = new Array(filters.length).fill(false);
@@ -502,15 +521,15 @@ export class MemoryTableModule {
         let hasUpper = false;
         for (let i = 0; i < filters.length; i++) {
             const filter = filters[i];
-            if (filter.columnIndex === indexCol.index && filter.usable) {
-                if (filter.op === '>' || filter.op === '>=') {
-                    handledFilters[i] = true;
-                    hasLower = true;
-                }
-                else if (filter.op === '<' || filter.op === '<=') {
-                    handledFilters[i] = true;
-                    hasUpper = true;
-                }
+            if (filter.columnIndex !== indexCol.index || !filter.usable)
+                continue;
+            if (!hasLower && (filter.op === '>' || filter.op === '>=')) {
+                handledFilters[i] = true;
+                hasLower = true;
+            }
+            else if (!hasUpper && (filter.op === '<' || filter.op === '<=')) {
+                handledFilters[i] = true;
+                hasUpper = true;
             }
         }
         return { hasRange: hasLower || hasUpper, handledFilters };
@@ -755,7 +774,7 @@ export class MemoryTableModule {
     /**
      * Alters an existing memory table's structure (ADD/DROP/RENAME COLUMN).
      */
-    async alterTable(db, schemaName, tableName, change) {
+    async alterTable(db, schemaName, tableName, change, rows) {
         const tableKey = `${schemaName}.${tableName}`.toLowerCase();
         const manager = this.tables.get(tableKey);
         if (!manager) {
@@ -777,7 +796,7 @@ export class MemoryTableModule {
             case 'alterPrimaryKey':
                 throw new QuereusError('MemoryTable does not support in-place primary key alteration', StatusCode.UNSUPPORTED);
             case 'addConstraint':
-                await manager.addConstraint(change.constraint);
+                await manager.addConstraint(change.constraint, rows);
                 break;
             case 'dropConstraint':
                 await manager.dropConstraint(change.constraintName);
@@ -792,7 +811,7 @@ export class MemoryTableModule {
                     setDataType: change.setDataType,
                     setDefault: change.setDefault,
                     setCollation: change.setCollation,
-                });
+                }, rows);
                 break;
         }
         return manager.tableSchema;
@@ -800,14 +819,14 @@ export class MemoryTableModule {
     /**
      * Creates an index on a memory table
      */
-    async createIndex(db, schemaName, tableName, indexSchema) {
+    async createIndex(db, schemaName, tableName, indexSchema, rows) {
         const tableKey = `${schemaName}.${tableName}`.toLowerCase();
         const manager = this.tables.get(tableKey);
         if (!manager) {
             throw new QuereusError(`Memory table '${tableName}' not found in schema '${schemaName}'. Cannot create index.`, StatusCode.ERROR);
         }
         // Delegate to the manager to create the index
-        await manager.createIndex(indexSchema);
+        await manager.createIndex(indexSchema, undefined, rows);
         logger.operation('Create Index', indexSchema.name, {
             table: tableName,
             schema: schemaName,