@quereus/quereus 3.3.0 → 4.1.0

package/dist/src/vtab/mapping-advertisement.d.ts

@@ -0,0 +1,163 @@
+import type * as AST from '../parser/ast.js';
+/**
+ * Module mapping advertisement protocol — the typed surface a virtual-table
+ * module exposes to tell the lens default mapper how a set of *its* basis
+ * relations jointly back one logical table (columnar split / EAV / column-family
+ * / nd-tree). See `docs/lens.md` § "The Default Mapper".
+ *
+ * The advertisement is load-bearing in both directions of the lens:
+ * - **`get`** — the join fan-out shape + which basis relation backs each logical
+ *   column (drives the n-way read body).
+ * - **`put`** — the same fan-out + the shared key, so an insert reaches every
+ *   member and a surrogate is evaluated once and threaded.
+ *
+ * This module defines the descriptor only. Resolution / validation / slot
+ * storage lives in `schema/lens-compiler.ts`; the n-way join synthesis + put
+ * fan-out that *consume* a resolved advertisement land in the follow-up ticket
+ * `lens-multi-source-decomposition`.
+ *
+ * The two facets ({@link StorageShape}, {@link AccessShape}) are **separate and
+ * need not be symmetric** (accommodation #1): *storage shape* drives `put`,
+ * *access shape* drives `get` planning. An nd-tree's storage shape is a
+ * surrogate-keyed insert path identical to the column stores beside it, while
+ * its access shape is spatial predicates over a coordinate tuple.
+ */
+/** How a set of a module's basis relations decomposes one logical table. */
+export interface MappingAdvertisement {
+    /**
+     * Stable symbolic id, unique within the basis schema. This is the existence
+     * anchor's `relationId` — the target an injected IND (`IndTarget.kind:'relation'`,
+     * reserved by `optimizer-inclusion-dependency-foundation`) points at. Minted by
+     * the module (dedicated) or by the tag builder (generic) from the anchor
+     * relation. The contract `id === storage.anchorRelationId` is validated by the
+     * resolver, so the INDs `lens-multi-source-decomposition` injects and the join
+     * it builds agree on which relation is the existence anchor.
+     */
+    readonly id: string;
+    /**
+     * Logical table this decomposition backs, matched case-insensitively by the
+     * resolver against the logical declaration.
+     */
+    readonly logicalTable: string;
+    /**
+     * `primary-storage` drives write fan-out (at most one per logical table —
+     * accommodation #5); `auxiliary-access` is a read-path-only structure (nd-tree,
+     * covering MV, vector index).
+     */
+    readonly role: 'primary-storage' | 'auxiliary-access';
+    /** Drives put (and the get join). Required on `primary-storage`. */
+    readonly storage?: StorageShape;
+    /**
+     * Drives read-path selection. Defined + stored here; consumed by the read-path
+     * planner consumer (`lens-access-shape-path-selection`,
+     * `planner/rules/access/rule-lens-auxiliary-access.ts`), which routes a matching
+     * outer-query predicate through the auxiliary structure.
+     */
+    readonly access?: AccessShape;
+}
+/** The write/storage facet: drives `put` fan-out and the `get` join skeleton. */
+export interface StorageShape {
+    /**
+     * The existence anchor (accommodation #4): preserved side for outer joins of
+     * value-only members, the delete source for "the logical row ceases to exist",
+     * and the relation a covering MV joins back through. Named explicitly — never
+     * reverse-engineered from outer-join structure. Must be one of {@link members}.
+     */
+    readonly anchorRelationId: string;
+    /** Every basis relation in the decomposition, including the anchor. */
+    readonly members: readonly DecompositionMember[];
+    readonly sharedKey: SharedKey;
+}
+/** A reference to a concrete basis relation (schema + table). */
+export interface BasisRelationRef {
+    readonly schema: string;
+    readonly table: string;
+}
+/** One basis relation participating in a decomposition. */
+export interface DecompositionMember {
+    /** Member's symbolic id (the anchor's equals {@link StorageShape.anchorRelationId}). */
+    readonly relationId: string;
+    readonly relation: BasisRelationRef;
+    /**
+     * `mandatory` ⇒ inner-joined onto the anchor (every logical row has it);
+     * `optional` ⇒ outer-joined (a logical row may lack it). "Every logical row has
+     * it" is the `anchor.key ⊆ member.key` totality the existence-anchor IND encodes
+     * (`computeExistenceAnchorInds` in `schema/lens-compiler.ts`) — the property the
+     * producer relies on to discharge the anchor-rooted inner join's no-row-loss
+     * obligation.
+     */
+    readonly presence: 'mandatory' | 'optional';
+    /**
+     * logical-column-name -> the basis expression on THIS relation backing it. A
+     * member may back many columns (column-family), one (columnar), or none beyond
+     * identity (pure existence anchor). EAV members use {@link attributePivot}
+     * instead.
+     */
+    readonly columns: readonly LogicalColumnMapping[];
+    /**
+     * EAV / triple-store member: logical columns are rows keyed by an attribute
+     * literal, not basis columns. Defined for completeness; the resolver validates
+     * its shape, the synthesis ticket builds the pivot.
+     */
+    readonly attributePivot?: AttributePivot;
+}
+/** Binds one logical column to a basis expression on a member relation. */
+export interface LogicalColumnMapping {
+    readonly logicalColumn: string;
+    readonly basisExpr: AST.Expression;
+}
+/**
+ * The key that stitches the decomposition's members together (the equi-join in
+ * `get`, the threaded identity in `put`).
+ */
+export interface SharedKey {
+    /**
+     * Accommodation #3 — a **coverage fact**, derived from whether the shared-key
+     * column is also a logical column. It is not a generation policy: the engine no
+     * longer invents a key. Both kinds source the threaded value from ordinary
+     * column-default / supplied-value machinery and propagate it across the fan-out
+     * via the equivalence class (`docs/view-updateability.md` § Mutation Context):
+     * - `surrogate`: a substrate-managed key distinct from any logical column. The
+     *   value comes from the **anchor's shared-key column `default`**, evaluated once
+     *   per produced row at the envelope (evaluate-once-and-thread). A basis author
+     *   composes a per-row allocator with `mutation_ordinal()`; the engine chooses no
+     *   ID policy of its own. The anchor's key column must therefore declare a
+     *   `default` (validated at deploy time).
+     * - `logical-tuple`: the shared key IS the logical PK, arriving mapped (supplied)
+     *   from the logical layer; it threads with no generation.
+     */
+    readonly kind: 'surrogate' | 'logical-tuple';
+    /**
+     * Per-member key columns the equi-join uses (a surrogate may be spelled
+     * differently across relations). Keyed by member `relationId`.
+     */
+    readonly keyColumnsByRelation: ReadonlyMap<string, readonly string[]>;
+}
+/**
+ * Extensible (accommodation #2) — string-typed with built-in constants, NOT a
+ * closed enum, so vector-similarity / full-text / time-series forms land without
+ * re-litigating the type. Built-ins enumerated; `string & {}` keeps it open.
+ */
+export type AccessForm = 'equality' | 'range' | 'prefix' | 'contains' | 'intersects' | 'knn' | (string & {});
+/** The read/access facet: which predicate forms the decomposition serves. */
+export interface AccessShape {
+    /**
+     * Which predicate forms this decomposition serves efficiently over which
+     * columns (or coordinate tuple). The nd-tree case is
+     * `{ columns: ['x','y','z'], forms: ['range','contains','knn'] }`.
+     */
+    readonly served: readonly {
+        readonly columns: readonly string[];
+        readonly forms: readonly AccessForm[];
+    }[];
+}
+/** EAV / triple-store pivot: three basis columns carrying identity, name, value. */
+export interface AttributePivot {
+    /** basis column = logical row identity. */
+    readonly entityColumn: string;
+    /** basis column = logical column name. */
+    readonly attributeColumn: string;
+    /** basis column = the value. */
+    readonly valueColumn: string;
+}
+//# sourceMappingURL=mapping-advertisement.d.ts.map

package/dist/src/vtab/mapping-advertisement.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"mapping-advertisement.d.ts","sourceRoot":"","sources":["../../../src/vtab/mapping-advertisement.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,KAAK,GAAG,MAAM,kBAAkB,CAAC;AAE7C;;;;;;;;;;;;;;;;;;;;;;GAsBG;AAEH,4EAA4E;AAC5E,MAAM,WAAW,oBAAoB;IACpC;;;;;;;;OAQG;IACH,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB;;;OAGG;IACH,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B;;;;OAIG;IACH,QAAQ,CAAC,IAAI,EAAE,iBAAiB,GAAG,kBAAkB,CAAC;IACtD,oEAAoE;IACpE,QAAQ,CAAC,OAAO,CAAC,EAAE,YAAY,CAAC;IAChC;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,WAAW,CAAC;CAC9B;AAED,iFAAiF;AACjF,MAAM,WAAW,YAAY;IAC5B;;;;;OAKG;IACH,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,uEAAuE;IACvE,QAAQ,CAAC,OAAO,EAAE,SAAS,mBAAmB,EAAE,CAAC;IACjD,QAAQ,CAAC,SAAS,EAAE,SAAS,CAAC;CAC9B;AAED,iEAAiE;AACjE,MAAM,WAAW,gBAAgB;IAChC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACvB;AAED,2DAA2D;AAC3D,MAAM,WAAW,mBAAmB;IACnC,wFAAwF;IACxF,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;IAC5B,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC;IACpC;;;;;;;OAOG;IACH,QAAQ,CAAC,QAAQ,EAAE,WAAW,GAAG,UAAU,CAAC;IAC5C;;;;;OAKG;IACH,QAAQ,CAAC,OAAO,EAAE,SAAS,oBAAoB,EAAE,CAAC;IAClD;;;;OAIG;IACH,QAAQ,CAAC,cAAc,CAAC,EAAE,cAAc,CAAC;CACzC;AAED,2EAA2E;AAC3E,MAAM,WAAW,oBAAoB;IACpC,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,SAAS,EAAE,GAAG,CAAC,UAAU,CAAC;CACnC;AAED;;;GAGG;AACH,MAAM,WAAW,SAAS;IACzB;;;;;;;;;;;;;;OAcG;IACH,QAAQ,CAAC,IAAI,EAAE,WAAW,GAAG,eAAe,CAAC;IAC7C;;;OAGG;IACH,QAAQ,CAAC,oBAAoB,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC;CACtE;AAED;;;;GAIG;AACH,MAAM,MAAM,UAAU,GAAG,UAAU,GAAG,OAAO,GAAG,QAAQ,GAAG,UAAU,GAAG,YAAY,GAAG,KAAK,GAAG,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;AAE7G,6EAA6E;AAC7E,MAAM,WAAW,WAAW;IAC3B;;;;OAIG;IACH,QAAQ,CAAC,MAAM,EAAE,SAAS;QAAE,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;QAAC,QAAQ,CAAC,KAAK,EAAE,SAAS,UAAU,EAAE,CAAA;KAAE,EAAE,CAAC;CAC3G;AAED,oFAAoF;AACpF,MAAM,WAAW,cAAc;IAC9B,2CAA2C;IAC3C,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,0CAA0C;IAC1C,QAAQ,CAAC,eAAe,EAAE,MAAM,CAAC;IACjC,gCAAgC;IAChC,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC7B"}

package/dist/src/vtab/mapping-advertisement.js

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

package/dist/src/vtab/mapping-advertisement.js.map

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

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

@@ -22,7 +22,25 @@ export declare class MemoryIndex {
      *  `evaluate(row) === true` participate in the index. */
     readonly predicate: CompiledPredicate | undefined;
     private readonly allTableColumnsSchema;
-    constructor(spec: IndexSpec, allTableColumnsSchema: ReadonlyArray<ColumnSchema>, baseInheritreeTable?: BTree<BTreeKeyForIndex, MemoryIndexEntry>);
+    /**
+     * The table's primary-key comparator (from `createPrimaryKeyFunctions(schema)`),
+     * used to sort each entry's `primaryKeys` on read (see {@link getSortedPrimaryKeys}).
+     * It is per-index — identical for every entry — so it lives here, not duplicated
+     * per entry. A PK-collation change via `ALTER COLUMN … SET COLLATE` forces a full
+     * base rebuild (`rebuildAllSecondaryIndexes` / `rebuildPrimaryTreeStrict`),
+     * recreating entries under the new comparator/encoder — so no stale order or
+     * encoding survives an ALTER.
+     */
+    private readonly primaryKeyComparator;
+    /**
+     * The table's lossless PK encoder (from `createPrimaryKeyFunctions(schema)`),
+     * bound to the PK arity. Produces the `Map` key for value-identity dedup of each
+     * entry's `primaryKeys`. Per-index — every layer derives it from the same PK
+     * definition, so an inherited entry's Map keys stay valid for this layer's
+     * add/remove. See `utils/primary-key-encode.ts`.
+     */
+    private readonly encode;
+    constructor(spec: IndexSpec, allTableColumnsSchema: ReadonlyArray<ColumnSchema>, primaryKeyComparator: (a: BTreeKeyForPrimary, b: BTreeKeyForPrimary) => number, encode: (pk: BTreeKeyForPrimary) => string, baseInheritreeTable?: BTree<BTreeKeyForIndex, MemoryIndexEntry>);
     /** True when the partial-index predicate is satisfied by `row` (or there is no predicate). */
     rowMatchesPredicate(row: Row): boolean;
     private validateColumnIndexes;
@@ -31,12 +49,54 @@ export declare class MemoryIndex {
     private createCompositeColumnKeyFunctions;
     private validateRowLength;
     private createBTree;
-    /** Adds a mapping from index key to primary key */
+    /**
+     * Entries created by THIS index instance — safe to mutate in place. An entry
+     * found through the tree but absent here was INHERITED from an ancestor
+     * layer's tree (each TransactionLayer wraps a fresh MemoryIndex around the
+     * parent's BTree as base): only the btree NODES are copy-on-write, the entry
+     * objects (and their `primaryKeys` Maps) are shared, so mutating an inherited
+     * entry's Map writes through to the ancestor — corrupting committed state
+     * when this layer rolls back (a rolled-back insert leaves a phantom PK that
+     * false-rejects later UNIQUE checks; a rolled-back delete strips a live PK
+     * and silently un-enforces UNIQUE). Inherited entries are therefore
+     * copy-on-written via {@link BTree.updateAt}, which lands the replacement in
+     * THIS tree; the cloned container is a `new Map(existing.primaryKeys)` (was a
+     * `slice()` of the sorted array). Owned entries keep the in-place fast path —
+     * a Map set/delete is O(1), so bulk loads and repeated same-key writes within
+     * one layer stay O(1) per entry (the previous sorted-array splice was O(n) on
+     * an out-of-order arrival).
+     */
+    private ownedEntries;
+    /**
+     * Per-entry memoized PK-sorted view, rebuilt lazily by {@link getSortedPrimaryKeys}.
+     * Keyed by entry identity (a WeakMap, so it never pins an entry alive and is never
+     * serialized — entries stay pure structured-cloneable data). An owned in-place
+     * mutation invalidates by `delete(entry)` (entry identity is preserved); a
+     * copy-on-write produces a fresh entry object whose cache slot is naturally absent.
+     * The cache is per-MemoryIndex (per layer) and discarded with the layer.
+     */
+    private sortedCache;
+    /** Adds a mapping from index key to primary key (O(1) Map set, deduped by encoding) */
     addEntry(indexKey: BTreeKeyForIndex, primaryKey: BTreeKeyForPrimary): void;
-    /** Removes a mapping from index key to primary key */
+    /** Removes a mapping from index key to primary key (O(1) Map delete by encoding) */
     removeEntry(indexKey: BTreeKeyForIndex, primaryKey: BTreeKeyForPrimary): void;
-    /** Returns the primary keys for a given index key */
+    /**
+     * Returns the entry's PKs sorted under the PK comparator, memoized per entry.
+     * Scan output must be PK-sorted within each index key (the optimizer never claims
+     * the order, but `quereus-isolation` merges overlay and underlying secondary scans
+     * assuming `(indexKey, PK)` order — an insertion-order Map would break the merge).
+     * The Map stores PKs in insertion order, so this sorts on read; the cache keeps
+     * repeated scans at the original amortized cost.
+     */
+    getSortedPrimaryKeys(entry: MemoryIndexEntry): readonly BTreeKeyForPrimary[];
+    /** Returns the primary keys for a given index key (defensive copy of the sorted view) */
     getPrimaryKeys(indexKey: BTreeKeyForIndex): BTreeKeyForPrimary[];
+    /**
+     * True when at least one PK is mapped under `indexKey`. O(1) (Map size), so the
+     * build-time UNIQUE check (BaseLayer `populateNewIndex`) can probe per row without
+     * sorting the bucket.
+     */
+    hasAnyPrimaryKey(indexKey: BTreeKeyForIndex): boolean;
     /** Gets the count of unique index values */
     get size(): number;
     /** Clears all entries from the index, creating a fresh empty BTree */

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAc,KAAK,GAAG,EAAiB,MAAM,uBAAuB,CAAC;AAE5E,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACzF,OAAO,KAAK,EAAE,iBAAiB,IAAI,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAClF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEtD,OAAO,EAAoB,KAAK,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAEhF,mFAAmF;AACnF,MAAM,WAAW,SAAS;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;IACxC,SAAS,CAAC,EAAE,UAAU,CAAC;CACvB;AAQD,wDAAwD;AACxD,qBAAa,WAAW;IACvB,SAAgB,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,SAAgB,WAAW,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;IAC5D,SAAgB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,gBAAgB,CAAC;IAC3D,SAAgB,WAAW,EAAE,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;IAC3E,IAAI,EAAE,KAAK,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;IACvD;6DACyD;IACzD,SAAgB,SAAS,EAAE,iBAAiB,GAAG,SAAS,CAAC;IACzD,OAAO,CAAC,QAAQ,CAAC,qBAAqB,CAA8B;gBAExD,IAAI,EAAE,SAAS,EAAE,qBAAqB,EAAE,aAAa,CAAC,YAAY,CAAC,EAAE,mBAAmB,CAAC,EAAE,KAAK,CAAC,gBAAgB,EAAE,gBAAgB,CAAC;IAgBhJ,8FAA8F;IAC9F,mBAAmB,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO;IAKtC,OAAO,CAAC,qBAAqB;IAU7B,OAAO,CAAC,uBAAuB;IAQ/B,OAAO,CAAC,8BAA8B;IAsBtC,OAAO,CAAC,iCAAiC;IAuCzC,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,WAAW;IAQnB,mDAAmD;IACnD,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,kBAAkB,GAAG,IAAI;IAgB1E,sDAAsD;IACtD,WAAW,CAAC,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,kBAAkB,GAAG,IAAI;IAa7E,qDAAqD;IACrD,cAAc,CAAC,QAAQ,EAAE,gBAAgB,GAAG,kBAAkB,EAAE;IAKhE,4CAA4C;IAC5C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,sEAAsE;IACtE,KAAK,IAAI,IAAI;IAIb,yFAAyF;IACzF,SAAS,IAAI,IAAI;CAGjB"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/vtab/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAc,KAAK,GAAG,EAAiB,MAAM,uBAAuB,CAAC;AAE5E,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,YAAY,CAAC;AACzF,OAAO,KAAK,EAAE,iBAAiB,IAAI,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAClF,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAEtD,OAAO,EAAoB,KAAK,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAEhF,mFAAmF;AACnF,MAAM,WAAW,SAAS;IACzB,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;IACxC,SAAS,CAAC,EAAE,UAAU,CAAC;CACvB;AAQD,wDAAwD;AACxD,qBAAa,WAAW;IACvB,SAAgB,IAAI,EAAE,MAAM,GAAG,SAAS,CAAC;IACzC,SAAgB,WAAW,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;IAC5D,SAAgB,UAAU,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,gBAAgB,CAAC;IAC3D,SAAgB,WAAW,EAAE,CAAC,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,gBAAgB,KAAK,MAAM,CAAC;IAC3E,IAAI,EAAE,KAAK,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,CAAC;IACvD;6DACyD;IACzD,SAAgB,SAAS,EAAE,iBAAiB,GAAG,SAAS,CAAC;IACzD,OAAO,CAAC,QAAQ,CAAC,qBAAqB,CAA8B;IACpE;;;;;;;;OAQG;IACH,OAAO,CAAC,QAAQ,CAAC,oBAAoB,CAA2D;IAEhG;;;;;;OAMG;IACH,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAqC;gBAG3D,IAAI,EAAE,SAAS,EACf,qBAAqB,EAAE,aAAa,CAAC,YAAY,CAAC,EAClD,oBAAoB,EAAE,CAAC,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,kBAAkB,KAAK,MAAM,EAC9E,MAAM,EAAE,CAAC,EAAE,EAAE,kBAAkB,KAAK,MAAM,EAC1C,mBAAmB,CAAC,EAAE,KAAK,CAAC,gBAAgB,EAAE,gBAAgB,CAAC;IAmBhE,8FAA8F;IAC9F,mBAAmB,CAAC,GAAG,EAAE,GAAG,GAAG,OAAO;IAKtC,OAAO,CAAC,qBAAqB;IAU7B,OAAO,CAAC,uBAAuB;IAQ/B,OAAO,CAAC,8BAA8B;IAsBtC,OAAO,CAAC,iCAAiC;IAuCzC,OAAO,CAAC,iBAAiB;IAMzB,OAAO,CAAC,WAAW;IAQnB;;;;;;;;;;;;;;;;OAgBG;IACH,OAAO,CAAC,YAAY,CAAmC;IAEvD;;;;;;;OAOG;IACH,OAAO,CAAC,WAAW,CAAyD;IAE5E,uFAAuF;IACvF,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,kBAAkB,GAAG,IAAI;IAiC1E,oFAAoF;IACpF,WAAW,CAAC,QAAQ,EAAE,gBAAgB,EAAE,UAAU,EAAE,kBAAkB,GAAG,IAAI;IA8B7E;;;;;;;OAOG;IACH,oBAAoB,CAAC,KAAK,EAAE,gBAAgB,GAAG,SAAS,kBAAkB,EAAE;IAS5E,yFAAyF;IACzF,cAAc,CAAC,QAAQ,EAAE,gBAAgB,GAAG,kBAAkB,EAAE;IAKhE;;;;OAIG;IACH,gBAAgB,CAAC,QAAQ,EAAE,gBAAgB,GAAG,OAAO;IAIrD,4CAA4C;IAC5C,IAAI,IAAI,IAAI,MAAM,CAEjB;IAED,sEAAsE;IACtE,KAAK,IAAI,IAAI;IAIb,yFAAyF;IACzF,SAAS,IAAI,IAAI;CAGjB"}

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

@@ -14,10 +14,30 @@ export class MemoryIndex {
      *  `evaluate(row) === true` participate in the index. */
     predicate;
     allTableColumnsSchema;
-    constructor(spec, allTableColumnsSchema, baseInheritreeTable) {
+    /**
+     * The table's primary-key comparator (from `createPrimaryKeyFunctions(schema)`),
+     * used to sort each entry's `primaryKeys` on read (see {@link getSortedPrimaryKeys}).
+     * It is per-index — identical for every entry — so it lives here, not duplicated
+     * per entry. A PK-collation change via `ALTER COLUMN … SET COLLATE` forces a full
+     * base rebuild (`rebuildAllSecondaryIndexes` / `rebuildPrimaryTreeStrict`),
+     * recreating entries under the new comparator/encoder — so no stale order or
+     * encoding survives an ALTER.
+     */
+    primaryKeyComparator;
+    /**
+     * The table's lossless PK encoder (from `createPrimaryKeyFunctions(schema)`),
+     * bound to the PK arity. Produces the `Map` key for value-identity dedup of each
+     * entry's `primaryKeys`. Per-index — every layer derives it from the same PK
+     * definition, so an inherited entry's Map keys stay valid for this layer's
+     * add/remove. See `utils/primary-key-encode.ts`.
+     */
+    encode;
+    constructor(spec, allTableColumnsSchema, primaryKeyComparator, encode, baseInheritreeTable) {
         this.name = spec.name;
         this.specColumns = Object.freeze(spec.columns.map(c => ({ ...c })));
         this.allTableColumnsSchema = allTableColumnsSchema;
+        this.primaryKeyComparator = primaryKeyComparator;
+        this.encode = encode;
         this.validateColumnIndexes(allTableColumnsSchema);
         const keyFunctions = this.createIndexKeyFunctions();
         this.keyFromRow = keyFunctions.keyFromRow;
@@ -101,39 +121,126 @@ export class MemoryIndex {
     createBTree(baseInheritreeTable) {
         return new BTree((entry) => entry.indexKey, this.compareKeys, baseInheritreeTable);
     }
-    /** Adds a mapping from index key to primary key */
+    /**
+     * Entries created by THIS index instance — safe to mutate in place. An entry
+     * found through the tree but absent here was INHERITED from an ancestor
+     * layer's tree (each TransactionLayer wraps a fresh MemoryIndex around the
+     * parent's BTree as base): only the btree NODES are copy-on-write, the entry
+     * objects (and their `primaryKeys` Maps) are shared, so mutating an inherited
+     * entry's Map writes through to the ancestor — corrupting committed state
+     * when this layer rolls back (a rolled-back insert leaves a phantom PK that
+     * false-rejects later UNIQUE checks; a rolled-back delete strips a live PK
+     * and silently un-enforces UNIQUE). Inherited entries are therefore
+     * copy-on-written via {@link BTree.updateAt}, which lands the replacement in
+     * THIS tree; the cloned container is a `new Map(existing.primaryKeys)` (was a
+     * `slice()` of the sorted array). Owned entries keep the in-place fast path —
+     * a Map set/delete is O(1), so bulk loads and repeated same-key writes within
+     * one layer stay O(1) per entry (the previous sorted-array splice was O(n) on
+     * an out-of-order arrival).
+     */
+    ownedEntries = new WeakSet();
+    /**
+     * Per-entry memoized PK-sorted view, rebuilt lazily by {@link getSortedPrimaryKeys}.
+     * Keyed by entry identity (a WeakMap, so it never pins an entry alive and is never
+     * serialized — entries stay pure structured-cloneable data). An owned in-place
+     * mutation invalidates by `delete(entry)` (entry identity is preserved); a
+     * copy-on-write produces a fresh entry object whose cache slot is naturally absent.
+     * The cache is per-MemoryIndex (per layer) and discarded with the layer.
+     */
+    sortedCache = new WeakMap();
+    /** Adds a mapping from index key to primary key (O(1) Map set, deduped by encoding) */
     addEntry(indexKey, primaryKey) {
+        const enc = this.encode(primaryKey);
         const path = this.data.find(indexKey);
         if (path.on) {
-            // Entry exists, add to the existing set of primary keys
             const existingEntry = this.data.at(path);
-            existingEntry.primaryKeys.add(primaryKey);
+            if (this.ownedEntries.has(existingEntry)) {
+                existingEntry.primaryKeys.set(enc, primaryKey);
+                this.sortedCache.delete(existingEntry);
+                return;
+            }
+            // Inherited: copy-on-write into this layer's tree (see ownedEntries).
+            // Clone the Map before mutating so the ancestor entry is untouched. Keep the
+            // stored indexKey bytes (a collation-equal/byte-different new key must not
+            // re-key the entry — matching the prior in-place behavior). The fresh entry
+            // object has no sortedCache slot, so no stale sorted view survives.
+            const primaryKeys = new Map(existingEntry.primaryKeys);
+            primaryKeys.set(enc, primaryKey);
+            const updated = {
+                indexKey: existingEntry.indexKey,
+                primaryKeys,
+            };
+            this.ownedEntries.add(updated);
+            this.data.updateAt(path, updated);
         }
         else {
-            // Create new entry with a Set containing the primary key
             const newEntry = {
                 indexKey,
-                primaryKeys: new Set([primaryKey])
+                primaryKeys: new Map([[enc, primaryKey]]),
             };
+            this.ownedEntries.add(newEntry);
             this.data.insert(newEntry);
         }
     }
-    /** Removes a mapping from index key to primary key */
+    /** Removes a mapping from index key to primary key (O(1) Map delete by encoding) */
     removeEntry(indexKey, primaryKey) {
         const path = this.data.find(indexKey);
-        if (path.on) {
-            const entry = this.data.at(path);
-            entry.primaryKeys.delete(primaryKey);
+        if (!path.on)
+            return;
+        const entry = this.data.at(path);
+        const enc = this.encode(primaryKey);
+        if (this.ownedEntries.has(entry)) {
+            entry.primaryKeys.delete(enc);
             // If no primary keys remain, remove the entire entry
             if (entry.primaryKeys.size === 0) {
                 this.data.deleteAt(path);
             }
+            else {
+                this.sortedCache.delete(entry);
+            }
+            return;
+        }
+        // Inherited: copy-on-write (see ownedEntries). A delete that empties the
+        // entry masks it in this layer's tree; the ancestor's entry is untouched.
+        const remaining = new Map(entry.primaryKeys);
+        remaining.delete(enc);
+        if (remaining.size === 0) {
+            this.data.deleteAt(path);
+        }
+        else {
+            const updated = { indexKey: entry.indexKey, primaryKeys: remaining };
+            this.ownedEntries.add(updated);
+            this.data.updateAt(path, updated);
         }
     }
-    /** Returns the primary keys for a given index key */
+    /**
+     * Returns the entry's PKs sorted under the PK comparator, memoized per entry.
+     * Scan output must be PK-sorted within each index key (the optimizer never claims
+     * the order, but `quereus-isolation` merges overlay and underlying secondary scans
+     * assuming `(indexKey, PK)` order — an insertion-order Map would break the merge).
+     * The Map stores PKs in insertion order, so this sorts on read; the cache keeps
+     * repeated scans at the original amortized cost.
+     */
+    getSortedPrimaryKeys(entry) {
+        let sorted = this.sortedCache.get(entry);
+        if (!sorted) {
+            sorted = [...entry.primaryKeys.values()].sort(this.primaryKeyComparator);
+            this.sortedCache.set(entry, sorted);
+        }
+        return sorted;
+    }
+    /** Returns the primary keys for a given index key (defensive copy of the sorted view) */
     getPrimaryKeys(indexKey) {
         const entry = this.data.get(indexKey);
-        return entry ? Array.from(entry.primaryKeys) : [];
+        return entry ? this.getSortedPrimaryKeys(entry).slice() : [];
+    }
+    /**
+     * True when at least one PK is mapped under `indexKey`. O(1) (Map size), so the
+     * build-time UNIQUE check (BaseLayer `populateNewIndex`) can probe per row without
+     * sorting the bucket.
+     */
+    hasAnyPrimaryKey(indexKey) {
+        return (this.data.get(indexKey)?.primaryKeys.size ?? 0) > 0;
     }
     /** Gets the count of unique index values */
     get size() {

package/dist/src/vtab/memory/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/vtab/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,UAAU,EAA2B,MAAM,uBAAuB,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAKnF,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAA0B,MAAM,sBAAsB,CAAC;AAehF,wDAAwD;AACxD,MAAM,OAAO,WAAW;IACP,IAAI,CAAqB;IACzB,WAAW,CAAiC;IAC5C,UAAU,CAAiC;IAC3C,WAAW,CAAuD;IAC3E,IAAI,CAA4C;IACvD;6DACyD;IACzC,SAAS,CAAgC;IACxC,qBAAqB,CAA8B;IAEpE,YAAY,IAAe,EAAE,qBAAkD,EAAE,mBAA+D;QAC/I,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;QAEnD,IAAI,CAAC,qBAAqB,CAAC,qBAAqB,CAAC,CAAC;QAElD,MAAM,YAAY,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,UAAU,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC;QAE5C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC;IACnD,CAAC;IAED,8FAA8F;IAC9F,mBAAmB,CAAC,GAAQ;QAC3B,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QACjC,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;IAC9C,CAAC;IAEO,qBAAqB,CAAC,qBAAkD;QAC/E,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAClD,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,qBAAqB,CAAC,MAAM,CACxD,CAAC;QAEF,IAAI,eAAe,EAAE,CAAC;YACrB,YAAY,CAAC,kCAAkC,IAAI,CAAC,IAAI,IAAI,WAAW,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnG,CAAC;IACF,CAAC;IAEO,uBAAuB;QAC9B,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC,8BAA8B,EAAE,CAAC;QAC9C,CAAC;aAAM,CAAC;YACP,OAAO,IAAI,CAAC,iCAAiC,EAAE,CAAC;QACjD,CAAC;IACF,CAAC;IAEO,8BAA8B;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC;QACrC,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;QAChE,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,+BAA+B;QAC/B,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1F,MAAM,eAAe,GAAG,qBAAqB,CAAC,YAAY,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QAEvF,MAAM,UAAU,GAAG,CAAC,GAAQ,EAAoB,EAAE;YACjD,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;YAC5C,OAAO,GAAG,CAAC,cAAc,CAAC,CAAC;QAC5B,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;YACxE,OAAO,eAAe,CAAC,CAAa,EAAE,CAAa,CAAC,GAAG,cAAc,CAAC;QACvE,CAAC,CAAC;QAEF,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IACpC,CAAC;IAEO,iCAAiC;QACxC,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC;QAE1C,oDAAoD;QACpD,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAChF,OAAO,qBAAqB,CAAC,YAAY,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG,CAAC,GAAQ,EAAoB,EAAE;YACjD,OAAO,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAChC,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;gBACtC,OAAO,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;YACxE,MAAM,IAAI,GAAG,CAAe,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAe,CAAC;YAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC1C,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAClC,CAAC;gBAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEpD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;oBACtB,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;gBAChD,CAAC;YACF,CAAC;YACD,OAAO,CAAC,CAAC;QACV,CAAC,CAAC;QAEF,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IACpC,CAAC;IAEO,iBAAiB,CAAC,GAAQ,EAAE,WAAmB;QACtD,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAClD,YAAY,CAAC,uBAAuB,WAAW,oBAAoB,GAAG,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACvG,CAAC;IACF,CAAC;IAEO,WAAW,CAAC,mBAA+D;QAClF,OAAO,IAAI,KAAK,CACf,CAAC,KAAuB,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,EAC3C,IAAI,CAAC,WAAW,EAChB,mBAAmB,CACnB,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,QAAQ,CAAC,QAA0B,EAAE,UAA8B;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,wDAAwD;YACxD,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAE,CAAC;YAC1C,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAC3C,CAAC;aAAM,CAAC;YACP,yDAAyD;YACzD,MAAM,QAAQ,GAAqB;gBAClC,QAAQ;gBACR,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,UAAU,CAAC,CAAC;aAClC,CAAC;YACF,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;IACF,CAAC;IAED,sDAAsD;IACtD,WAAW,CAAC,QAA0B,EAAE,UAA8B;QACrE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAE,CAAC;YAClC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YAErC,qDAAqD;YACrD,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;QACF,CAAC;IACF,CAAC;IAED,qDAAqD;IACrD,cAAc,CAAC,QAA0B;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACnD,CAAC;IAED,4CAA4C;IAC5C,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC7B,CAAC;IAED,sEAAsE;IACtE,KAAK;QACJ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAChC,CAAC;IAED,yFAAyF;IACzF,SAAS;QACR,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;IACvB,CAAC;CACD"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/vtab/memory/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,EAAE,UAAU,EAA2B,MAAM,uBAAuB,CAAC;AAC5E,OAAO,EAAE,qBAAqB,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAKnF,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,gBAAgB,EAA0B,MAAM,sBAAsB,CAAC;AAehF,wDAAwD;AACxD,MAAM,OAAO,WAAW;IACP,IAAI,CAAqB;IACzB,WAAW,CAAiC;IAC5C,UAAU,CAAiC;IAC3C,WAAW,CAAuD;IAC3E,IAAI,CAA4C;IACvD;6DACyD;IACzC,SAAS,CAAgC;IACxC,qBAAqB,CAA8B;IACpE;;;;;;;;OAQG;IACc,oBAAoB,CAA2D;IAEhG;;;;;;OAMG;IACc,MAAM,CAAqC;IAE5D,YACC,IAAe,EACf,qBAAkD,EAClD,oBAA8E,EAC9E,MAA0C,EAC1C,mBAA+D;QAE/D,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACtB,IAAI,CAAC,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACpE,IAAI,CAAC,qBAAqB,GAAG,qBAAqB,CAAC;QACnD,IAAI,CAAC,oBAAoB,GAAG,oBAAoB,CAAC;QACjD,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QAErB,IAAI,CAAC,qBAAqB,CAAC,qBAAqB,CAAC,CAAC;QAElD,MAAM,YAAY,GAAG,IAAI,CAAC,uBAAuB,EAAE,CAAC;QACpD,IAAI,CAAC,UAAU,GAAG,YAAY,CAAC,UAAU,CAAC;QAC1C,IAAI,CAAC,WAAW,GAAG,YAAY,CAAC,WAAW,CAAC;QAE5C,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC,SAAS,EAAE,qBAAqB,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAEtG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,mBAAmB,CAAC,CAAC;IACnD,CAAC;IAED,8FAA8F;IAC9F,mBAAmB,CAAC,GAAQ;QAC3B,IAAI,CAAC,IAAI,CAAC,SAAS;YAAE,OAAO,IAAI,CAAC;QACjC,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC;IAC9C,CAAC;IAEO,qBAAqB,CAAC,qBAAkD;QAC/E,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAClD,EAAE,CAAC,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,qBAAqB,CAAC,MAAM,CACxD,CAAC;QAEF,IAAI,eAAe,EAAE,CAAC;YACrB,YAAY,CAAC,kCAAkC,IAAI,CAAC,IAAI,IAAI,WAAW,IAAI,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACnG,CAAC;IACF,CAAC;IAEO,uBAAuB;QAC9B,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC,8BAA8B,EAAE,CAAC;QAC9C,CAAC;aAAM,CAAC;YACP,OAAO,IAAI,CAAC,iCAAiC,EAAE,CAAC;QACjD,CAAC;IACF,CAAC;IAEO,8BAA8B;QACrC,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACpC,MAAM,cAAc,GAAG,OAAO,CAAC,KAAK,CAAC;QACrC,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,cAAc,CAAC,CAAC;QAChE,MAAM,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE7C,+BAA+B;QAC/B,MAAM,aAAa,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAC1F,MAAM,eAAe,GAAG,qBAAqB,CAAC,YAAY,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QAEvF,MAAM,UAAU,GAAG,CAAC,GAAQ,EAAoB,EAAE;YACjD,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,cAAc,CAAC,CAAC;YAC5C,OAAO,GAAG,CAAC,cAAc,CAAC,CAAC;QAC5B,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;YACxE,OAAO,eAAe,CAAC,CAAa,EAAE,CAAa,CAAC,GAAG,cAAc,CAAC;QACvE,CAAC,CAAC;QAEF,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IACpC,CAAC;IAEO,iCAAiC;QACxC,MAAM,gBAAgB,GAAG,IAAI,CAAC,WAAW,CAAC;QAE1C,oDAAoD;QACpD,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;YAC7C,MAAM,YAAY,GAAG,IAAI,CAAC,qBAAqB,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YAC1D,MAAM,aAAa,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,gBAAgB,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;YAChF,OAAO,qBAAqB,CAAC,YAAY,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,MAAM,UAAU,GAAG,CAAC,GAAQ,EAAoB,EAAE;YACjD,OAAO,gBAAgB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE;gBAChC,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC;gBACtC,OAAO,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;YACtB,CAAC,CAAC,CAAC;QACJ,CAAC,CAAC;QAEF,MAAM,WAAW,GAAG,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;YACxE,MAAM,IAAI,GAAG,CAAe,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAe,CAAC;YAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,gBAAgB,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAClD,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;oBAC1C,OAAO,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;gBAClC,CAAC;gBAED,MAAM,OAAO,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;gBACpC,MAAM,UAAU,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;gBAEpD,IAAI,UAAU,KAAK,CAAC,EAAE,CAAC;oBACtB,OAAO,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC;gBAChD,CAAC;YACF,CAAC;YACD,OAAO,CAAC,CAAC;QACV,CAAC,CAAC;QAEF,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC;IACpC,CAAC;IAEO,iBAAiB,CAAC,GAAQ,EAAE,WAAmB;QACtD,IAAI,WAAW,GAAG,CAAC,IAAI,WAAW,IAAI,GAAG,CAAC,MAAM,EAAE,CAAC;YAClD,YAAY,CAAC,uBAAuB,WAAW,oBAAoB,GAAG,CAAC,MAAM,EAAE,EAAE,UAAU,CAAC,QAAQ,CAAC,CAAC;QACvG,CAAC;IACF,CAAC;IAEO,WAAW,CAAC,mBAA+D;QAClF,OAAO,IAAI,KAAK,CACf,CAAC,KAAuB,EAAE,EAAE,CAAC,KAAK,CAAC,QAAQ,EAC3C,IAAI,CAAC,WAAW,EAChB,mBAAmB,CACnB,CAAC;IACH,CAAC;IAED;;;;;;;;;;;;;;;;OAgBG;IACK,YAAY,GAAG,IAAI,OAAO,EAAoB,CAAC;IAEvD;;;;;;;OAOG;IACK,WAAW,GAAG,IAAI,OAAO,EAA0C,CAAC;IAE5E,uFAAuF;IACvF,QAAQ,CAAC,QAA0B,EAAE,UAA8B;QAClE,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,IAAI,CAAC,EAAE,EAAE,CAAC;YACb,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAE,CAAC;YAC1C,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC;gBAC1C,aAAa,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;gBAC/C,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC;gBACvC,OAAO;YACR,CAAC;YACD,sEAAsE;YACtE,6EAA6E;YAC7E,2EAA2E;YAC3E,4EAA4E;YAC5E,oEAAoE;YACpE,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;YACvD,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;YACjC,MAAM,OAAO,GAAqB;gBACjC,QAAQ,EAAE,aAAa,CAAC,QAAQ;gBAChC,WAAW;aACX,CAAC;YACF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnC,CAAC;aAAM,CAAC;YACP,MAAM,QAAQ,GAAqB;gBAClC,QAAQ;gBACR,WAAW,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC,CAAC;aACzC,CAAC;YACF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC5B,CAAC;IACF,CAAC;IAED,oFAAoF;IACpF,WAAW,CAAC,QAA0B,EAAE,UAA8B;QACrE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,EAAE;YAAE,OAAO;QACrB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAE,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;QAEpC,IAAI,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAClC,KAAK,CAAC,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAC9B,qDAAqD;YACrD,IAAI,KAAK,CAAC,WAAW,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;iBAAM,CAAC;gBACP,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAChC,CAAC;YACD,OAAO;QACR,CAAC;QAED,yEAAyE;QACzE,0EAA0E;QAC1E,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC7C,SAAS,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,SAAS,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1B,CAAC;aAAM,CAAC;YACP,MAAM,OAAO,GAAqB,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;YACvF,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACnC,CAAC;IACF,CAAC;IAED;;;;;;;OAOG;IACH,oBAAoB,CAAC,KAAuB;QAC3C,IAAI,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,EAAE,CAAC;YACb,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;YACzE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACrC,CAAC;QACD,OAAO,MAAM,CAAC;IACf,CAAC;IAED,yFAAyF;IACzF,cAAc,CAAC,QAA0B;QACxC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACtC,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAC9D,CAAC;IAED;;;;OAIG;IACH,gBAAgB,CAAC,QAA0B;QAC1C,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,WAAW,CAAC,IAAI,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;IAC7D,CAAC;IAED,4CAA4C;IAC5C,IAAI,IAAI;QACP,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;IAC7B,CAAC;IAED,sEAAsE;IACtE,KAAK;QACJ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;IAChC,CAAC;IAED,yFAAyF;IACzF,SAAS;QACR,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;IACvB,CAAC;CACD"}

package/dist/src/vtab/memory/layer/base.d.ts

@@ -16,6 +16,34 @@ export declare class BaseLayer implements Layer {
     updateSchema(newSchema: TableSchema): void;
     private initializePrimaryKeyFunctions;
     rebuildAllSecondaryIndexes(): void;
+    /**
+     * Strict variant of {@link rebuildAllSecondaryIndexes}: rebuilds every
+     * secondary index from the primary tree but surfaces a UNIQUE-index key
+     * collision as a thrown CONSTRAINT error (the non-strict variant logs and
+     * drops duplicates). Used by `ALTER COLUMN ... SET COLLATE`, where a value set
+     * unique under the old collation may collide under the new one. On throw the
+     * secondary index map is left cleared; the caller restores the prior schema and
+     * calls the non-strict rebuild to recover a consistent state.
+     */
+    rebuildAllSecondaryIndexesStrict(): void;
+    /**
+     * Rebuild the primary BTree under the *current* primaryKeyFunctions — call
+     * {@link updateSchema} first so they reflect the new key collation. Re-extracts
+     * every row's key with the new functions and detects a primary-key collision —
+     * two rows whose distinct old keys collapse to one under the new comparator
+     * (e.g. a PK-column collation change BINARY→NOCASE) — throwing CONSTRAINT and
+     * leaving the live tree intact for the caller's rollback.
+     */
+    rebuildPrimaryTreeStrict(): void;
+    /**
+     * Replaces the primary tree with a fresh tree containing exactly `rows`, then
+     * rebuilds all secondary indexes from it. Used when consolidating a committed
+     * transaction layer into the base: `rows` is that layer's merged view (deletes
+     * already applied), so the base must be *replaced* — not unioned — or rows
+     * deleted in the transaction layer would remain physically resident in the base
+     * and resurface in base-direct scans (e.g. UNIQUE index builds).
+     */
+    rebuildPrimaryTreeFromRows(rows: Row[]): void;
     private clearExistingSecondaryIndexes;
     private hasSecondaryIndexes;
     private createSecondaryIndexes;
@@ -34,7 +62,7 @@ export declare class BaseLayer implements Layer {
         primaryKeyComparator: (a: BTreeKeyForPrimary, b: BTreeKeyForPrimary) => number;
     };
     has: (key: BTreeKeyForPrimary) => boolean;
-    addColumnToBase(newColumnSchema: ColumnSchema, defaultValue: SqlValue): Promise<void>;
+    addColumnToBase(newColumnSchema: ColumnSchema, defaultValue: SqlValue, backfillEvaluator?: (row: Row) => SqlValue | Promise<SqlValue>): Promise<void>;
     private recreatePrimaryTreeWithNewColumn;
     dropColumnFromBase(columnIndexInOldSchema: number): Promise<void>;
     private recreatePrimaryTreeWithoutColumn;
@@ -48,6 +76,15 @@ export declare class BaseLayer implements Layer {
      * the caller is expected to roll back the schema change in that case.
      */
     private populateNewIndex;
+    /**
+     * True when populating `indexSchema` must reject duplicate keys: either the
+     * index is itself declared UNIQUE, or it is the auto-built covering structure
+     * for a declared UNIQUE constraint (same column set). The latter never carries
+     * `unique: true` — insert-time enforcement runs through `uniqueConstraints` —
+     * so without this check a strict rebuild (e.g. `ALTER COLUMN ... SET COLLATE`)
+     * would silently accept rows that collide under the new collation.
+     */
+    private indexEnforcesUnique;
     dropIndexFromBase(indexName: string): Promise<void>;
 }
 //# sourceMappingURL=base.d.ts.map

package/dist/src/vtab/memory/layer/base.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"base.d.ts","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/base.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC1F,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAc,KAAK,GAAG,EAAE,KAAK,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAC/E,OAAO,EAAE,KAAK,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAQ5D,qBAAa,SAAU,YAAW,KAAK;IACtC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IAC1B,WAAW,EAAE,WAAW,CAAC;IAChC,OAAO,CAAC,mBAAmB,CAAuB;IAC3C,WAAW,EAAE,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC;IACnD,SAAgB,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAE/C,MAAM,EAAE,WAAW;IAiBxB,YAAY,CAAC,SAAS,EAAE,WAAW,GAAG,IAAI;IASjD,OAAO,CAAC,6BAA6B;IAI9B,0BAA0B,IAAI,IAAI;IAYzC,OAAO,CAAC,6BAA6B;IAIrC,OAAO,CAAC,mBAAmB;IAI3B,OAAO,CAAC,sBAAsB;IAgB9B,OAAO,CAAC,wBAAwB;IAOhC,OAAO,CAAC,wBAAwB;IAehC,OAAO,CAAC,uBAAuB;IAK/B,UAAU,QAAO,MAAM,CAAiB;IACxC,SAAS,QAAO,KAAK,GAAG,IAAI,CAAS;IACrC,SAAS,QAAO,WAAW,CAAqB;IAChD,WAAW,QAAO,OAAO,CAAS;IAElC,mBAAmB,GAAI,WAAW,MAAM,GAAG,SAAS,KAAG,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,GAAG,IAAI,CACzC;IAEnD,qBAAqB,GAAI,WAAW,MAAM,KAAG,KAAK,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,GAAG,IAAI,CACzC;IAEpD,iBAAiB,GAAI,WAAW,MAAM,KAAG,WAAW,GAAG,SAAS,CAC1B;IAE/B,6BAA6B,CAAC,MAAM,EAAE,WAAW,GAAG;QAC1D,0BAA0B,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,kBAAkB,CAAC;QAC7D,oBAAoB,EAAE,CAAC,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,kBAAkB,KAAK,MAAM,CAAA;KAC9E;IAUD,GAAG,GAAI,KAAK,kBAAkB,KAAG,OAAO,CAGtC;IAEI,eAAe,CAAC,eAAe,EAAE,YAAY,EAAE,YAAY,EAAE,QAAQ,GAAG,OAAO,CAAC,IAAI,CAAC;IAiB3F,OAAO,CAAC,gCAAgC;IAoBlC,kBAAkB,CAAC,sBAAsB,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAUvE,OAAO,CAAC,gCAAgC;IAgBlC,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC;IAKnC,cAAc,CAAC,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAU7D;;;;;;OAMG;IACH,OAAO,CAAC,gBAAgB;IAsClB,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAOzD"}
+{"version":3,"file":"base.d.ts","sourceRoot":"","sources":["../../../../../src/vtab/memory/layer/base.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AACnC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,KAAK,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AAC1F,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAC1C,OAAO,EAAc,KAAK,GAAG,EAAE,KAAK,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAC/E,OAAO,EAAE,KAAK,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAC9D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAQ5D,qBAAa,SAAU,YAAW,KAAK;IACtC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAS;IAC1B,WAAW,EAAE,WAAW,CAAC;IAChC,OAAO,CAAC,mBAAmB,CAAuB;IAC3C,WAAW,EAAE,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,CAAC;IACnD,SAAgB,gBAAgB,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;gBAE/C,MAAM,EAAE,WAAW;IAiBxB,YAAY,CAAC,SAAS,EAAE,WAAW,GAAG,IAAI;IASjD,OAAO,CAAC,6BAA6B;IAI9B,0BAA0B,IAAI,IAAI;IAYzC;;;;;;;;OAQG;IACI,gCAAgC,IAAI,IAAI;IAgB/C;;;;;;;OAOG;IACI,wBAAwB,IAAI,IAAI;IAsBvC;;;;;;;OAOG;IACI,0BAA0B,CAAC,IAAI,EAAE,GAAG,EAAE,GAAG,IAAI;IAcpD,OAAO,CAAC,6BAA6B;IAIrC,OAAO,CAAC,mBAAmB;IAI3B,OAAO,CAAC,sBAAsB;IAgB9B,OAAO,CAAC,wBAAwB;IAOhC,OAAO,CAAC,wBAAwB;IAehC,OAAO,CAAC,uBAAuB;IAK/B,UAAU,QAAO,MAAM,CAAiB;IACxC,SAAS,QAAO,KAAK,GAAG,IAAI,CAAS;IACrC,SAAS,QAAO,WAAW,CAAqB;IAChD,WAAW,QAAO,OAAO,CAAS;IAElC,mBAAmB,GAAI,WAAW,MAAM,GAAG,SAAS,KAAG,KAAK,CAAC,kBAAkB,EAAE,GAAG,CAAC,GAAG,IAAI,CACzC;IAEnD,qBAAqB,GAAI,WAAW,MAAM,KAAG,KAAK,CAAC,gBAAgB,EAAE,gBAAgB,CAAC,GAAG,IAAI,CACzC;IAEpD,iBAAiB,GAAI,WAAW,MAAM,KAAG,WAAW,GAAG,SAAS,CAC1B;IAE/B,6BAA6B,CAAC,MAAM,EAAE,WAAW,GAAG;QAC1D,0BAA0B,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,kBAAkB,CAAC;QAC7D,oBAAoB,EAAE,CAAC,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,kBAAkB,KAAK,MAAM,CAAA;KAC9E;IAUD,GAAG,GAAI,KAAK,kBAAkB,KAAG,OAAO,CAGtC;IAEI,eAAe,CACpB,eAAe,EAAE,YAAY,EAC7B,YAAY,EAAE,QAAQ,EACtB,iBAAiB,CAAC,EAAE,CAAC,GAAG,EAAE,GAAG,KAAK,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC,GAC5D,OAAO,CAAC,IAAI,CAAC;YAiBF,gCAAgC;IAuCxC,kBAAkB,CAAC,sBAAsB,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAUvE,OAAO,CAAC,gCAAgC;IAgBlC,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC;IAKnC,cAAc,CAAC,WAAW,EAAE,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;IAU7D;;;;;;OAMG;IACH,OAAO,CAAC,gBAAgB;IAiCxB;;;;;;;OAOG;IACH,OAAO,CAAC,mBAAmB;IAUrB,iBAAiB,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;CAOzD"}