@atscript/db-memory 0.1.147 → 0.1.148

package/dist/index.cjs

@@ -74,15 +74,26 @@ function stringifyLeaf(v) {
 /** `$eq` semantics, factored out so `$ne` can be its exact negation. */
 function evalEq(row, field, value) {
 	const fieldValue = (0, _atscript_db.getPath)(row, field);
-	if (value === null) return fieldValue == null;
+	if (value === null) return matchesScalar(fieldValue, null);
 	if (value instanceof RegExp) return fieldValue != null && value.test(stringifyLeaf(fieldValue));
+	return matchesScalar(fieldValue, value);
+}
+/**
+* Mongo containment: a scalar compared with an array field matches when ANY element
+* equals it (`{ labels: "bug" }` matches `["bug", "ui"]`). Non-array fields compare as before.
+* `null` also matches a missing field (`undefined`) and an array holding a `null` element,
+* as `{ labels: null }` / `$in: [null]` do in Mongo.
+*/
+function matchesScalar(fieldValue, value) {
+	if (value === null) return fieldValue == null || Array.isArray(fieldValue) && fieldValue.includes(null);
+	if (Array.isArray(fieldValue) && !Array.isArray(value)) return fieldValue.some((el) => valuesEqual(el, value));
 	return valuesEqual(fieldValue, value);
 }
 /** `$in` membership, factored out so `$nin` can be its exact negation. */
 function evalIn(row, field, value) {
 	if (!Array.isArray(value)) return false;
 	const fieldValue = (0, _atscript_db.getPath)(row, field);
-	return value.some((element) => valuesEqual(fieldValue, element));
+	return value.some((element) => matchesScalar(fieldValue, element));
 }
 /**
 * Coerce a leaf to something the JS relational operators can order. `Date`s
@@ -464,10 +475,28 @@ function projectRow(row, projection, opts) {
 function aggregateRows(rows, controls) {
 	const $select = controls.$select;
 	const groupBy = controls.$groupBy ?? [];
-	const aggregates = $select?.aggregates ?? [];
-	const aliases = aggregates.map((expr) => (0, _atscript_db_agg.resolveAlias)(expr));
+	const entries = [
+		...($select?.aggregates ?? []).map((expr) => ({
+			alias: (0, _atscript_db_agg.resolveAlias)(expr),
+			create: accumulatorFactory(expr)
+		})),
+		...($select?.exprAggregates ?? []).map((e) => ({
+			alias: e.alias,
+			create: exprAccumulatorFactory(e)
+		})),
+		...($select?.firstLast ?? []).map((fl) => ({
+			alias: fl.alias,
+			create: firstLastFactory(fl, $select?.rowOrder ?? [])
+		}))
+	];
+	const aliases = entries.map((e) => e.alias);
+	const groupExprs = ($select?.exprs ?? []).map((e) => ({
+		alias: e.alias,
+		expr: e.expr,
+		readers: new Map(e.names.map((name) => [name, pathReader(name)]))
+	}));
 	const keyReaders = groupBy.map((key) => groupKeyReader(key, controls));
-	const accumulators = aggregates.map(accumulatorFactory);
+	const accumulators = entries.map((e) => e.create);
 	const newGroup = (values) => ({
 		values,
 		accs: accumulators.map((create) => create())
@@ -496,6 +525,7 @@ function aggregateRows(rows, controls) {
 		const row = {};
 		for (let i = 0; i < groupBy.length; i++) setPath(row, groupBy[i], values[i]);
 		for (let i = 0; i < aliases.length; i++) row[aliases[i]] = accs[i].result();
+		for (const e of groupExprs) row[e.alias] = (0, _atscript_db.evaluateExpr)(e.expr, (name) => Object.hasOwn(row, name) ? row[name] : e.readers.get(name)(row));
 		out.push(row);
 	}
 	const having = controls.$having;
@@ -503,7 +533,7 @@ function aggregateRows(rows, controls) {
 	if (controls.$count) return [{ count: out.length }];
 	const paged = paginate(sortRows(out, controls.$sort), controls.$skip, controls.$limit);
 	const fields = ($select === void 0 ? groupBy : $select.asArray ?? []).map((field) => [field, pathReader(field)]);
-	const outputAliases = $select === void 0 ? [] : [...($select.buckets ?? []).map((b) => b.alias), ...aliases];
+	const outputAliases = $select === void 0 ? [] : [...($select.buckets ?? []).map((b) => b.alias), ...$select.computedAliases];
 	return paged.map((row) => {
 		const picked = {};
 		for (const [field, read] of fields) setPath(picked, field, copyValue(read(row) ?? null));
@@ -569,76 +599,109 @@ function numericValue(value) {
 		return Number.isNaN(n) ? void 0 : n;
 	}
 }
+/** `sum` / `avg` / `min` / `max` over a per-row arithmetic expression; NULL results are skipped like NULL fields. */
+function exprAccumulatorFactory(e) {
+	const readers = new Map(e.names.map((name) => [name, pathReader(name)]));
+	return fnAccumulator(e.fn, (row) => (0, _atscript_db.evaluateExpr)(e.expr, (field) => readers.get(field)(row)));
+}
+/**
+* `first` / `last`: the value of `fl.column` on the group's representative
+* row — the least (`first`) or greatest (`last`) row by `rowOrder` (NULL
+* smallest; the primary key is the final key, so the pick is deterministic).
+*/
+function firstLastFactory(fl, rowOrder) {
+	const keys = rowOrder.map((k) => ({
+		read: pathReader(k.column),
+		sign: k.desc ? -1 : 1
+	}));
+	const read = pathReader(fl.column);
+	const sign = fl.fn === "first" ? -1 : 1;
+	const compare = (a, b) => {
+		for (const k of keys) {
+			const c = compareLeaves(k.read(a), k.read(b)) * k.sign;
+			if (c !== 0) return c;
+		}
+		return 0;
+	};
+	return () => {
+		let best;
+		return {
+			add: (row) => {
+				if (best === void 0 || compare(row, best) * sign > 0) best = row;
+			},
+			result: () => best === void 0 ? null : copyValue(read(best) ?? null)
+		};
+	};
+}
+/**
+* `sum` / `avg` / `min` / `max` over the values `read` yields per row — a
+* field's, or a per-row expression's. `sum` / `avg` skip non-numeric values
+* and are `null` over none; `min` / `max` skip null / missing and order with
+* the `$sort` comparator.
+*/
+function fnAccumulator(fn, read) {
+	if (fn === "sum" || fn === "avg") return () => {
+		let sum = 0;
+		let n = 0;
+		return {
+			add: (row) => {
+				const v = numericValue(read(row));
+				if (v !== void 0) {
+					sum += v;
+					n++;
+				}
+			},
+			result: () => n === 0 ? null : fn === "avg" ? sum / n : sum
+		};
+	};
+	const sign = fn === "min" ? -1 : 1;
+	return () => {
+		let best = null;
+		return {
+			add: (row) => {
+				const v = read(row);
+				if (v == null) return;
+				if (best === null || compareLeaves(v, best) * sign > 0) best = v;
+			},
+			result: () => best
+		};
+	};
+}
 /**
-* Resolves an aggregate expression to an accumulator factory (one accumulator
-* per group). Validated up front, so an unknown `$fn` is rejected even when
-* there are no rows.
+* Resolves a plain aggregate (`first` / `last` are {@link firstLastFactory}'s)
+* to an accumulator factory (one accumulator per group). Validated up front,
+* so an unknown `$fn` is rejected even when there are no rows.
 */
 function accumulatorFactory(expr) {
 	(0, _atscript_db_agg.assertAggregateFn)(expr.$fn);
 	const field = expr.$field;
 	const read = pathReader(field);
-	switch (expr.$fn) {
-		case "count": {
-			const all = field === "*";
-			return () => {
-				let n = 0;
-				return {
-					add: (row) => {
-						if (all || read(row) != null) n++;
-					},
-					result: () => n
-				};
-			};
-		}
-		case "sum":
-		case "avg": {
-			const avg = expr.$fn === "avg";
-			return () => {
-				let sum = 0;
-				let n = 0;
-				return {
-					add: (row) => {
-						const v = numericValue(read(row));
-						if (v !== void 0) {
-							sum += v;
-							n++;
-						}
-					},
-					result: () => n === 0 ? null : avg ? sum / n : sum
-				};
-			};
-		}
-		case "countDistinct": return () => {
-			const plain = /* @__PURE__ */ new Set();
-			const tokens = /* @__PURE__ */ new Set();
+	if (expr.$fn === "count") {
+		const all = field === "*";
+		return () => {
+			let n = 0;
 			return {
 				add: (row) => {
-					const v = read(row);
-					if (v == null) return;
-					if (typeof v === "string" || typeof v === "boolean") plain.add(v);
-					else tokens.add(identityToken(v));
+					if (all || read(row) != null) n++;
 				},
-				result: () => plain.size + tokens.size
+				result: () => n
 			};
 		};
-		case "min":
-		case "max": {
-			const sign = expr.$fn === "min" ? -1 : 1;
-			return () => {
-				let best = null;
-				return {
-					add: (row) => {
-						const v = read(row);
-						if (v == null) return;
-						if (best === null || compareLeaves(v, best) * sign > 0) best = v;
-					},
-					result: () => best
-				};
-			};
-		}
-		default: return expr.$fn;
 	}
+	if (expr.$fn === "countDistinct") return () => {
+		const plain = /* @__PURE__ */ new Set();
+		const tokens = /* @__PURE__ */ new Set();
+		return {
+			add: (row) => {
+				const v = read(row);
+				if (v == null) return;
+				if (typeof v === "string" || typeof v === "boolean") plain.add(v);
+				else tokens.add(identityToken(v));
+			},
+			result: () => plain.size + tokens.size
+		};
+	};
+	return fnAccumulator(expr.$fn, read);
 }
 //#endregion
 //#region src/lib/memory-adapter.ts
@@ -1060,6 +1123,22 @@ var MemoryAdapter = class MemoryAdapter extends _atscript_db.BaseDbAdapter {
 			insertedIds
 		};
 	}
+	supportsInsertIgnore() {
+		return true;
+	}
+	/** A row colliding on the primary key or a unique index (`CONFLICT`) becomes a skipped slot. */
+	async insertManyIgnore(data) {
+		this._assertWritable();
+		const state = this._state();
+		return data.map((item) => {
+			try {
+				return { insertedId: this._insertRow(state, item) };
+			} catch (error) {
+				if ((0, _atscript_db.isConflict)(error)) return null;
+				throw error;
+			}
+		});
+	}
 	/**
 	* Selects the stored rows a write should touch, as `{ key, row }` pairs so
 	* callers can mutate in place and re-key. Stored mode scans the table's Map
@@ -1309,10 +1388,14 @@ var MemoryAdapter = class MemoryAdapter extends _atscript_db.BaseDbAdapter {
 	calendarBucketUnits() {
 		return _atscript_db.ALL_BUCKET_UNITS;
 	}
-	/** Every aggregate function, `countDistinct` included. */
+	/** Every aggregate function: `countDistinct`, `first` and `last` included. */
 	aggregateFns() {
 		return _atscript_db.ALL_AGGREGATE_FNS;
 	}
+	/** Arithmetic in an aggregate `$select` (`{ $expr }`, `{ $fn, $expr }`). */
+	supportsAggregateExpressions() {
+		return true;
+	}
 	/** Managed views render nothing (non-goal) — both are accepted like `aggregateFns()`. */
 	viewCapabilities() {
 		return _atscript_db.ALL_VIEW_CAPABILITIES;
@@ -1435,6 +1518,10 @@ function setMemoryProvider(space, type, fn) {
 	if (!(adapter instanceof MemoryAdapter)) throw new Error("setMemoryProvider: table is not backed by MemoryAdapter");
 	adapter.setProvider(fn);
 }
+/** @internal Drops the in-memory database of a closed space (called from `createAdapter`'s `onClose`). */
+function clearMemoryDatabase(space) {
+	databases.get(space)?.clear();
+}
 //#endregion
 //#region src/lib/index.ts
 /**
@@ -1447,7 +1534,8 @@ function setMemoryProvider(space, type, fn) {
 * adapter has been built.
 */
 function createAdapter() {
-	return new _atscript_db.DbSpace(() => new MemoryAdapter());
+	const space = new _atscript_db.DbSpace(() => new MemoryAdapter(), { onClose: () => clearMemoryDatabase(space) });
+	return space;
 }
 //#endregion
 exports.MemoryAdapter = MemoryAdapter;

package/dist/index.d.cts

@@ -1,4 +1,4 @@
-import { AggregateFn, BaseDbAdapter, BucketUnit, DbQuery, DbSpace, FilterExpr, ResolvedRelationFilter, TDbDeleteResult, TDbFieldMeta, TDbInsertManyResult, TDbInsertResult, TDbObjectKind, TDbUpdateResult, TFieldOps, TViewCapability } from "@atscript/db";
+import { AggregateFn, BaseDbAdapter, BucketUnit, DbQuery, DbSpace, FilterExpr, ResolvedRelationFilter, TDbDeleteResult, TDbFieldMeta, TDbInsertIgnoreSlot, TDbInsertManyResult, TDbInsertResult, TDbObjectKind, TDbUpdateResult, TFieldOps, TViewCapability } from "@atscript/db";
 import { TAtscriptAnnotatedType } from "@atscript/typescript/utils";
 
 //#region src/lib/memory-adapter.d.ts
@@ -269,6 +269,9 @@ declare class MemoryAdapter extends BaseDbAdapter {
   private _enforceUniqueIndexes;
   insertOne(data: Record<string, unknown>): Promise<TDbInsertResult>;
   insertMany(data: Array<Record<string, unknown>>): Promise<TDbInsertManyResult>;
+  supportsInsertIgnore(): boolean;
+  /** A row colliding on the primary key or a unique index (`CONFLICT`) becomes a skipped slot. */
+  insertManyIgnore(data: Array<Record<string, unknown>>): Promise<TDbInsertIgnoreSlot[]>;
   /**
    * Selects the stored rows a write should touch, as `{ key, row }` pairs so
    * callers can mutate in place and re-key. Stored mode scans the table's Map
@@ -406,8 +409,10 @@ declare class MemoryAdapter extends BaseDbAdapter {
    * there is no zone this adapter cannot resolve).
    */
   calendarBucketUnits(): ReadonlySet<BucketUnit>;
-  /** Every aggregate function, `countDistinct` included. */
+  /** Every aggregate function: `countDistinct`, `first` and `last` included. */
   aggregateFns(): ReadonlySet<AggregateFn>;
+  /** Arithmetic in an aggregate `$select` (`{ $expr }`, `{ $fn, $expr }`). */
+  supportsAggregateExpressions(): boolean;
   /** Managed views render nothing (non-goal) — both are accepted like `aggregateFns()`. */
   viewCapabilities(): ReadonlySet<TViewCapability>;
   updateMany(filter: FilterExpr, data: Record<string, unknown>, ops?: TFieldOps): Promise<TDbUpdateResult>;
@@ -570,4 +575,4 @@ declare function projectRow(row: Record<string, unknown>, projection?: Record<st
  */
 declare function createAdapter(): DbSpace;
 //#endregion
-export { MemoryAdapter, MemoryProviderFn, buildMemoryPredicate, createAdapter, projectRow, setMemoryProvider, sortRows };
+export { MemoryAdapter, type MemoryProviderFn, buildMemoryPredicate, createAdapter, projectRow, setMemoryProvider, sortRows };

package/dist/index.d.mts

@@ -1,4 +1,4 @@
-import { AggregateFn, BaseDbAdapter, BucketUnit, DbQuery, DbSpace, FilterExpr, ResolvedRelationFilter, TDbDeleteResult, TDbFieldMeta, TDbInsertManyResult, TDbInsertResult, TDbObjectKind, TDbUpdateResult, TFieldOps, TViewCapability } from "@atscript/db";
+import { AggregateFn, BaseDbAdapter, BucketUnit, DbQuery, DbSpace, FilterExpr, ResolvedRelationFilter, TDbDeleteResult, TDbFieldMeta, TDbInsertIgnoreSlot, TDbInsertManyResult, TDbInsertResult, TDbObjectKind, TDbUpdateResult, TFieldOps, TViewCapability } from "@atscript/db";
 import { TAtscriptAnnotatedType } from "@atscript/typescript/utils";
 
 //#region src/lib/memory-adapter.d.ts
@@ -269,6 +269,9 @@ declare class MemoryAdapter extends BaseDbAdapter {
   private _enforceUniqueIndexes;
   insertOne(data: Record<string, unknown>): Promise<TDbInsertResult>;
   insertMany(data: Array<Record<string, unknown>>): Promise<TDbInsertManyResult>;
+  supportsInsertIgnore(): boolean;
+  /** A row colliding on the primary key or a unique index (`CONFLICT`) becomes a skipped slot. */
+  insertManyIgnore(data: Array<Record<string, unknown>>): Promise<TDbInsertIgnoreSlot[]>;
   /**
    * Selects the stored rows a write should touch, as `{ key, row }` pairs so
    * callers can mutate in place and re-key. Stored mode scans the table's Map
@@ -406,8 +409,10 @@ declare class MemoryAdapter extends BaseDbAdapter {
    * there is no zone this adapter cannot resolve).
    */
   calendarBucketUnits(): ReadonlySet<BucketUnit>;
-  /** Every aggregate function, `countDistinct` included. */
+  /** Every aggregate function: `countDistinct`, `first` and `last` included. */
   aggregateFns(): ReadonlySet<AggregateFn>;
+  /** Arithmetic in an aggregate `$select` (`{ $expr }`, `{ $fn, $expr }`). */
+  supportsAggregateExpressions(): boolean;
   /** Managed views render nothing (non-goal) — both are accepted like `aggregateFns()`. */
   viewCapabilities(): ReadonlySet<TViewCapability>;
   updateMany(filter: FilterExpr, data: Record<string, unknown>, ops?: TFieldOps): Promise<TDbUpdateResult>;
@@ -570,4 +575,4 @@ declare function projectRow(row: Record<string, unknown>, projection?: Record<st
  */
 declare function createAdapter(): DbSpace;
 //#endregion
-export { MemoryAdapter, MemoryProviderFn, buildMemoryPredicate, createAdapter, projectRow, setMemoryProvider, sortRows };
+export { MemoryAdapter, type MemoryProviderFn, buildMemoryPredicate, createAdapter, projectRow, setMemoryProvider, sortRows };

package/dist/index.mjs

@@ -1,4 +1,4 @@
-import { ALL_AGGREGATE_FNS, ALL_BUCKET_UNITS, ALL_VIEW_CAPABILITIES, BaseDbAdapter, DbError, DbSpace, containsRelationFilter, deletePath, forEachResolvedRelation, getPath, getPath as getPath$1, isAtscriptDbView, isResolvedRelationFilter, walkFilter } from "@atscript/db";
+import { ALL_AGGREGATE_FNS, ALL_BUCKET_UNITS, ALL_VIEW_CAPABILITIES, BaseDbAdapter, DbError, DbSpace, containsRelationFilter, deletePath, evaluateExpr, forEachResolvedRelation, getPath, getPath as getPath$1, isAtscriptDbView, isConflict, isResolvedRelationFilter, walkFilter } from "@atscript/db";
 import { assertAggregateFn, resolveAlias } from "@atscript/db/agg";
 import { bucketer } from "@uniqu/core";
 //#region src/lib/memory-filter.ts
@@ -73,15 +73,26 @@ function stringifyLeaf(v) {
 /** `$eq` semantics, factored out so `$ne` can be its exact negation. */
 function evalEq(row, field, value) {
 	const fieldValue = getPath$1(row, field);
-	if (value === null) return fieldValue == null;
+	if (value === null) return matchesScalar(fieldValue, null);
 	if (value instanceof RegExp) return fieldValue != null && value.test(stringifyLeaf(fieldValue));
+	return matchesScalar(fieldValue, value);
+}
+/**
+* Mongo containment: a scalar compared with an array field matches when ANY element
+* equals it (`{ labels: "bug" }` matches `["bug", "ui"]`). Non-array fields compare as before.
+* `null` also matches a missing field (`undefined`) and an array holding a `null` element,
+* as `{ labels: null }` / `$in: [null]` do in Mongo.
+*/
+function matchesScalar(fieldValue, value) {
+	if (value === null) return fieldValue == null || Array.isArray(fieldValue) && fieldValue.includes(null);
+	if (Array.isArray(fieldValue) && !Array.isArray(value)) return fieldValue.some((el) => valuesEqual(el, value));
 	return valuesEqual(fieldValue, value);
 }
 /** `$in` membership, factored out so `$nin` can be its exact negation. */
 function evalIn(row, field, value) {
 	if (!Array.isArray(value)) return false;
 	const fieldValue = getPath$1(row, field);
-	return value.some((element) => valuesEqual(fieldValue, element));
+	return value.some((element) => matchesScalar(fieldValue, element));
 }
 /**
 * Coerce a leaf to something the JS relational operators can order. `Date`s
@@ -463,10 +474,28 @@ function projectRow(row, projection, opts) {
 function aggregateRows(rows, controls) {
 	const $select = controls.$select;
 	const groupBy = controls.$groupBy ?? [];
-	const aggregates = $select?.aggregates ?? [];
-	const aliases = aggregates.map((expr) => resolveAlias(expr));
+	const entries = [
+		...($select?.aggregates ?? []).map((expr) => ({
+			alias: resolveAlias(expr),
+			create: accumulatorFactory(expr)
+		})),
+		...($select?.exprAggregates ?? []).map((e) => ({
+			alias: e.alias,
+			create: exprAccumulatorFactory(e)
+		})),
+		...($select?.firstLast ?? []).map((fl) => ({
+			alias: fl.alias,
+			create: firstLastFactory(fl, $select?.rowOrder ?? [])
+		}))
+	];
+	const aliases = entries.map((e) => e.alias);
+	const groupExprs = ($select?.exprs ?? []).map((e) => ({
+		alias: e.alias,
+		expr: e.expr,
+		readers: new Map(e.names.map((name) => [name, pathReader(name)]))
+	}));
 	const keyReaders = groupBy.map((key) => groupKeyReader(key, controls));
-	const accumulators = aggregates.map(accumulatorFactory);
+	const accumulators = entries.map((e) => e.create);
 	const newGroup = (values) => ({
 		values,
 		accs: accumulators.map((create) => create())
@@ -495,6 +524,7 @@ function aggregateRows(rows, controls) {
 		const row = {};
 		for (let i = 0; i < groupBy.length; i++) setPath(row, groupBy[i], values[i]);
 		for (let i = 0; i < aliases.length; i++) row[aliases[i]] = accs[i].result();
+		for (const e of groupExprs) row[e.alias] = evaluateExpr(e.expr, (name) => Object.hasOwn(row, name) ? row[name] : e.readers.get(name)(row));
 		out.push(row);
 	}
 	const having = controls.$having;
@@ -502,7 +532,7 @@ function aggregateRows(rows, controls) {
 	if (controls.$count) return [{ count: out.length }];
 	const paged = paginate(sortRows(out, controls.$sort), controls.$skip, controls.$limit);
 	const fields = ($select === void 0 ? groupBy : $select.asArray ?? []).map((field) => [field, pathReader(field)]);
-	const outputAliases = $select === void 0 ? [] : [...($select.buckets ?? []).map((b) => b.alias), ...aliases];
+	const outputAliases = $select === void 0 ? [] : [...($select.buckets ?? []).map((b) => b.alias), ...$select.computedAliases];
 	return paged.map((row) => {
 		const picked = {};
 		for (const [field, read] of fields) setPath(picked, field, copyValue(read(row) ?? null));
@@ -568,76 +598,109 @@ function numericValue(value) {
 		return Number.isNaN(n) ? void 0 : n;
 	}
 }
+/** `sum` / `avg` / `min` / `max` over a per-row arithmetic expression; NULL results are skipped like NULL fields. */
+function exprAccumulatorFactory(e) {
+	const readers = new Map(e.names.map((name) => [name, pathReader(name)]));
+	return fnAccumulator(e.fn, (row) => evaluateExpr(e.expr, (field) => readers.get(field)(row)));
+}
+/**
+* `first` / `last`: the value of `fl.column` on the group's representative
+* row — the least (`first`) or greatest (`last`) row by `rowOrder` (NULL
+* smallest; the primary key is the final key, so the pick is deterministic).
+*/
+function firstLastFactory(fl, rowOrder) {
+	const keys = rowOrder.map((k) => ({
+		read: pathReader(k.column),
+		sign: k.desc ? -1 : 1
+	}));
+	const read = pathReader(fl.column);
+	const sign = fl.fn === "first" ? -1 : 1;
+	const compare = (a, b) => {
+		for (const k of keys) {
+			const c = compareLeaves(k.read(a), k.read(b)) * k.sign;
+			if (c !== 0) return c;
+		}
+		return 0;
+	};
+	return () => {
+		let best;
+		return {
+			add: (row) => {
+				if (best === void 0 || compare(row, best) * sign > 0) best = row;
+			},
+			result: () => best === void 0 ? null : copyValue(read(best) ?? null)
+		};
+	};
+}
+/**
+* `sum` / `avg` / `min` / `max` over the values `read` yields per row — a
+* field's, or a per-row expression's. `sum` / `avg` skip non-numeric values
+* and are `null` over none; `min` / `max` skip null / missing and order with
+* the `$sort` comparator.
+*/
+function fnAccumulator(fn, read) {
+	if (fn === "sum" || fn === "avg") return () => {
+		let sum = 0;
+		let n = 0;
+		return {
+			add: (row) => {
+				const v = numericValue(read(row));
+				if (v !== void 0) {
+					sum += v;
+					n++;
+				}
+			},
+			result: () => n === 0 ? null : fn === "avg" ? sum / n : sum
+		};
+	};
+	const sign = fn === "min" ? -1 : 1;
+	return () => {
+		let best = null;
+		return {
+			add: (row) => {
+				const v = read(row);
+				if (v == null) return;
+				if (best === null || compareLeaves(v, best) * sign > 0) best = v;
+			},
+			result: () => best
+		};
+	};
+}
 /**
-* Resolves an aggregate expression to an accumulator factory (one accumulator
-* per group). Validated up front, so an unknown `$fn` is rejected even when
-* there are no rows.
+* Resolves a plain aggregate (`first` / `last` are {@link firstLastFactory}'s)
+* to an accumulator factory (one accumulator per group). Validated up front,
+* so an unknown `$fn` is rejected even when there are no rows.
 */
 function accumulatorFactory(expr) {
 	assertAggregateFn(expr.$fn);
 	const field = expr.$field;
 	const read = pathReader(field);
-	switch (expr.$fn) {
-		case "count": {
-			const all = field === "*";
-			return () => {
-				let n = 0;
-				return {
-					add: (row) => {
-						if (all || read(row) != null) n++;
-					},
-					result: () => n
-				};
-			};
-		}
-		case "sum":
-		case "avg": {
-			const avg = expr.$fn === "avg";
-			return () => {
-				let sum = 0;
-				let n = 0;
-				return {
-					add: (row) => {
-						const v = numericValue(read(row));
-						if (v !== void 0) {
-							sum += v;
-							n++;
-						}
-					},
-					result: () => n === 0 ? null : avg ? sum / n : sum
-				};
-			};
-		}
-		case "countDistinct": return () => {
-			const plain = /* @__PURE__ */ new Set();
-			const tokens = /* @__PURE__ */ new Set();
+	if (expr.$fn === "count") {
+		const all = field === "*";
+		return () => {
+			let n = 0;
 			return {
 				add: (row) => {
-					const v = read(row);
-					if (v == null) return;
-					if (typeof v === "string" || typeof v === "boolean") plain.add(v);
-					else tokens.add(identityToken(v));
+					if (all || read(row) != null) n++;
 				},
-				result: () => plain.size + tokens.size
+				result: () => n
 			};
 		};
-		case "min":
-		case "max": {
-			const sign = expr.$fn === "min" ? -1 : 1;
-			return () => {
-				let best = null;
-				return {
-					add: (row) => {
-						const v = read(row);
-						if (v == null) return;
-						if (best === null || compareLeaves(v, best) * sign > 0) best = v;
-					},
-					result: () => best
-				};
-			};
-		}
-		default: return expr.$fn;
 	}
+	if (expr.$fn === "countDistinct") return () => {
+		const plain = /* @__PURE__ */ new Set();
+		const tokens = /* @__PURE__ */ new Set();
+		return {
+			add: (row) => {
+				const v = read(row);
+				if (v == null) return;
+				if (typeof v === "string" || typeof v === "boolean") plain.add(v);
+				else tokens.add(identityToken(v));
+			},
+			result: () => plain.size + tokens.size
+		};
+	};
+	return fnAccumulator(expr.$fn, read);
 }
 //#endregion
 //#region src/lib/memory-adapter.ts
@@ -1059,6 +1122,22 @@ var MemoryAdapter = class MemoryAdapter extends BaseDbAdapter {
 			insertedIds
 		};
 	}
+	supportsInsertIgnore() {
+		return true;
+	}
+	/** A row colliding on the primary key or a unique index (`CONFLICT`) becomes a skipped slot. */
+	async insertManyIgnore(data) {
+		this._assertWritable();
+		const state = this._state();
+		return data.map((item) => {
+			try {
+				return { insertedId: this._insertRow(state, item) };
+			} catch (error) {
+				if (isConflict(error)) return null;
+				throw error;
+			}
+		});
+	}
 	/**
 	* Selects the stored rows a write should touch, as `{ key, row }` pairs so
 	* callers can mutate in place and re-key. Stored mode scans the table's Map
@@ -1308,10 +1387,14 @@ var MemoryAdapter = class MemoryAdapter extends BaseDbAdapter {
 	calendarBucketUnits() {
 		return ALL_BUCKET_UNITS;
 	}
-	/** Every aggregate function, `countDistinct` included. */
+	/** Every aggregate function: `countDistinct`, `first` and `last` included. */
 	aggregateFns() {
 		return ALL_AGGREGATE_FNS;
 	}
+	/** Arithmetic in an aggregate `$select` (`{ $expr }`, `{ $fn, $expr }`). */
+	supportsAggregateExpressions() {
+		return true;
+	}
 	/** Managed views render nothing (non-goal) — both are accepted like `aggregateFns()`. */
 	viewCapabilities() {
 		return ALL_VIEW_CAPABILITIES;
@@ -1434,6 +1517,10 @@ function setMemoryProvider(space, type, fn) {
 	if (!(adapter instanceof MemoryAdapter)) throw new Error("setMemoryProvider: table is not backed by MemoryAdapter");
 	adapter.setProvider(fn);
 }
+/** @internal Drops the in-memory database of a closed space (called from `createAdapter`'s `onClose`). */
+function clearMemoryDatabase(space) {
+	databases.get(space)?.clear();
+}
 //#endregion
 //#region src/lib/index.ts
 /**
@@ -1446,7 +1533,8 @@ function setMemoryProvider(space, type, fn) {
 * adapter has been built.
 */
 function createAdapter() {
-	return new DbSpace(() => new MemoryAdapter());
+	const space = new DbSpace(() => new MemoryAdapter(), { onClose: () => clearMemoryDatabase(space) });
+	return space;
 }
 //#endregion
 export { MemoryAdapter, buildMemoryPredicate, createAdapter, projectRow, setMemoryProvider, sortRows };

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atscript/db-memory",
-  "version": "0.1.147",
+  "version": "0.1.148",
   "description": "In-memory adapter for atscript-db.",
   "keywords": [
     "atscript",
@@ -36,16 +36,16 @@
     "access": "public"
   },
   "devDependencies": {
-    "@atscript/core": "^0.1.99",
-    "@atscript/typescript": "^0.1.99",
-    "@uniqu/core": "^0.1.12",
-    "unplugin-atscript": "^0.1.99"
+    "@atscript/core": "^0.1.100",
+    "@atscript/typescript": "^0.1.100",
+    "@uniqu/core": "^0.1.13",
+    "unplugin-atscript": "^0.1.100"
   },
   "peerDependencies": {
-    "@atscript/core": "^0.1.99",
-    "@atscript/typescript": "^0.1.99",
-    "@uniqu/core": "^0.1.12",
-    "@atscript/db": "^0.1.147"
+    "@atscript/core": "^0.1.100",
+    "@atscript/typescript": "^0.1.100",
+    "@uniqu/core": "^0.1.13",
+    "@atscript/db": "^0.1.148"
   },
   "scripts": {
     "postinstall": "asc -f dts",