@prisma-idb/client-idb 0.11.0 → 0.12.0

package/dist/{idb-orm-BitJ-EMq.mjs → idb-orm-B1Br1C0F.mjs}

@@ -1,8 +1,7 @@
-import { C as assertEnumValues, D as getRelation, E as getKeyPath, O as getStoreName, S as createMutationDefaultsCache, T as fieldValueToken, _ as requireTransactionExecutor, a as collectScalarFkStoreNames, b as applyCreateDefaults, c as executeDeleteWithReferentialActions, d as executeScalarCreateAllWithFkValidation, f as executeScalarCreateWithFkValidation, g as hasScalarFkFields, h as hasNestedMutationCallbacks, i as collectOnUpdateEnforcementStoreNames, l as executeNestedCreateMutation, m as hasEnforceableChildRelations, n as applyReferentialActionsForRowOnUpdate, o as executeBulkUpdateWithFkValidation, p as executeScalarUpdateWithFkValidation, s as executeDeleteAllWithReferentialActions, u as executeNestedUpdateMutation, v as validateScalarFks, w as extractKeyFromRow, x as applyUpdateDefaults, y as withMutationScope } from "./mutation-executor-SJqTuSbb.mjs";
+import { A as combineFilterExprs, C as planQuery, D as createMutationDefaultsCache, E as applyUpdateDefaults, F as getStoreName, M as fieldValueToken, N as getKeyPath, O as assertEnumValues, P as getRelation, S as lowerRows, T as applyCreateDefaults, _ as readMutationRows, a as collectScalarFkStoreNames, b as withMutationScope, c as executeDeleteWithReferentialActions, d as executeScalarCreateAllWithFkValidation, f as executeScalarCreateWithFkValidation, g as hasScalarFkFields, h as hasNestedMutationCallbacks, i as collectOnUpdateEnforcementStoreNames, j as extractKeyFromRow, k as buildRowComparator, l as executeNestedCreateMutation, m as hasEnforceableChildRelations, n as applyReferentialActionsForRowOnUpdate, o as executeBulkUpdateWithFkValidation, p as executeScalarUpdateWithFkValidation, s as executeDeleteAllWithReferentialActions, u as executeNestedUpdateMutation, v as requireTransactionExecutor, w as buildCatalog, x as lowerCount, y as validateScalarFks } from "./mutation-executor-inLFb0TE.mjs";
 import { AsyncIterableResult } from "@prisma/orm-framework/components/runtime";
-import { andExpr, evaluateFilter, fieldFilter, nullCheckExpr, shorthandToFilterExpr } from "@prisma-idb/adapter-idb/runtime";
+import { andExpr, fieldFilter, nullCheckExpr, shorthandToFilterExpr } from "@prisma-idb/adapter-idb/runtime";
 import { domainModelsAtDefaultNamespace } from "@prisma/orm-framework/contract/types";
-import { compareFieldValues, isValidIdbKey, keyEquals } from "@prisma-idb/target-idb/runtime";
 //#region src/core/model-accessor.ts
 /**
 * Proxy-based typed accessor handed to `where(fn)` callbacks.
@@ -94,39 +93,6 @@ function mergeAccessorState(state, overrides) {
 	};
 }
 //#endregion
-//#region src/core/query-shaping.ts
-/**
-* Combine accumulated filter expressions with AND.
-*
-* Returns `undefined` when no filter is present so callers can skip building a
-* row-filter closure. Shared by {@link IdbStoreAccessorImpl} (top-level scans)
-* and the relation loader (refined `include()` child scans).
-*/
-function combineFilterExprs(filters) {
-	if (filters.length === 0) return void 0;
-	if (filters.length === 1) return filters[0];
-	return andExpr(filters);
-}
-/**
-* Build an in-memory comparator from an `orderBy` spec (field → direction).
-*
-* Returns `undefined` when there is nothing to sort by. Compares fields in
-* declaration order, with {@link compareFieldValues}: the same order an
-* IndexedDB index uses, so equal `Date`s tie and fall through to the next
-* field, and `null`s sort last (first when descending).
-*/
-function buildRowComparator(orderBy) {
-	if (orderBy === void 0) return void 0;
-	return (a, b) => {
-		for (const [field, dir] of Object.entries(orderBy)) {
-			const cmp = compareFieldValues(a[field], b[field]);
-			if (cmp === 0) continue;
-			return dir === "desc" ? -cmp : cmp;
-		}
-		return 0;
-	};
-}
-//#endregion
 //#region src/core/aggregate-builder.ts
 /**
 * Build the aggregate selector factory handed to `.aggregate(agg => …)` and
@@ -282,461 +248,6 @@ function createGroupedAccessor(init) {
 	} };
 }
 //#endregion
-//#region src/core/planner/catalog.ts
-const catalogs = /* @__PURE__ */ new WeakMap();
-/** Build a catalog once per contract identity and store name. Contracts are immutable. */
-function buildCatalog(contract, storeName) {
-	const cached = catalogs.get(contract)?.get(storeName);
-	if (cached) return cached;
-	const store = contract.storage.stores[storeName];
-	if (!store) throw new Error(`Store "${storeName}" is not in the contract`);
-	const fields = {};
-	for (const model of Object.values(domainModelsAtDefaultNamespace(contract.domain))) {
-		if (model.storage.storeName !== storeName) continue;
-		for (const [name, field] of Object.entries(model.fields)) fields[name] = Object.freeze({
-			codecId: field.type.kind === "scalar" ? field.type.codecId : void 0,
-			nullable: field.nullable,
-			collection: field.many === true || field.dict === true
-		});
-	}
-	const catalog = Object.freeze({
-		storeName,
-		primaryKey: source(store.keyPath, true, false),
-		indexes: Object.freeze(Object.entries(store.indexes ?? {}).map(([name, index]) => source(index.keyPath, index.unique, index.multiEntry ?? false, name))),
-		fields: Object.freeze(fields)
-	});
-	let byStore = catalogs.get(contract);
-	if (!byStore) {
-		byStore = /* @__PURE__ */ new Map();
-		catalogs.set(contract, byStore);
-	}
-	byStore.set(storeName, catalog);
-	return catalog;
-}
-function source(keyPath, unique, multiEntry, indexName) {
-	const path = typeof keyPath === "string" ? keyPath : Object.freeze([...keyPath]);
-	return Object.freeze({
-		keyPath: path,
-		fields: Object.freeze(typeof path === "string" ? [path] : [...path]),
-		unique,
-		multiEntry,
-		...indexName === void 0 ? {} : { indexName }
-	});
-}
-//#endregion
-//#region src/core/planner/plan.ts
-const COST = {
-	UNIQUE_POINT: 0,
-	PRIMARY_POINT: 1,
-	INDEX_POINT: 2,
-	PREFIX_POINT: 3,
-	TWO_SIDED_RANGE: 4,
-	ONE_SIDED_RANGE: 5,
-	ORDER_ONLY_SCAN: 6
-};
-const KEY_PARTIAL_CODECS = /* @__PURE__ */ new Set(["idb/double@1", "idb/date@1"]);
-const KEY_CODECS = /* @__PURE__ */ new Set([
-	"idb/string@1",
-	"idb/int32@1",
-	"idb/double@1",
-	"idb/date@1",
-	"idb/decimal@1",
-	"idb/bytes@1"
-]);
-/** Choose the cheapest safe access without opening IndexedDB or probing cardinality. */
-function planQuery(catalog, request) {
-	const normalized = normalize(request.where);
-	if (normalized.empty) return {
-		access: { kind: "empty" },
-		exact: true
-	};
-	const orders = Object.entries(request.orderBy ?? {});
-	if (normalized.excluded || request.hasRelationFilter || orders.length > 1) return full(false);
-	const constraints = /* @__PURE__ */ new Map();
-	for (const atom of normalized.atoms) {
-		let constraint = constraints.get(atom.field);
-		if (!constraint) {
-			constraint = { consumed: 0 };
-			constraints.set(atom.field, constraint);
-		}
-		addAtom(constraint, atom, catalog.fields[atom.field]);
-	}
-	for (const [name, constraint] of constraints) {
-		if (keyPartial(catalog.fields[name]) && !constraint.rejectsNonKeys) {
-			delete constraint.lower;
-			delete constraint.upper;
-			constraint.consumed = 0;
-		}
-		if (contradictory(constraint)) return {
-			access: { kind: "empty" },
-			exact: true
-		};
-	}
-	const sources = [catalog.primaryKey, ...catalog.indexes];
-	const candidates = sources.flatMap((source, declaration) => {
-		const candidate = filteringCandidate(catalog, source, constraints, declaration);
-		return candidate ? [candidate] : [];
-	});
-	candidates.sort((a, b) => a.cost - b.cost || a.ranges.length - b.ranges.length || Number(a.source.indexName !== void 0) - Number(b.source.indexName !== void 0) || a.declaration - b.declaration);
-	let selected = candidates[0];
-	let direction;
-	if (orders.length === 1 && request.take !== void 0) {
-		const [field, order] = orders[0];
-		if (selected) {
-			if (singleFieldSource(selected.source, field)) direction = order === "asc" ? "next" : "prev";
-		} else {
-			const ordering = sources.find((source) => !source.multiEntry && singleFieldSource(source, field) && completeKeyField(catalog.fields[field]));
-			if (ordering) {
-				selected = {
-					source: ordering,
-					ranges: [void 0],
-					cost: COST.ORDER_ONLY_SCAN,
-					consumed: 0,
-					declaration: sources.indexOf(ordering)
-				};
-				direction = order === "asc" ? "next" : "prev";
-			}
-		}
-	}
-	if (!selected) {
-		const partialOrder = orders.length === 1 && request.take !== void 0 && keyPartial(catalog.fields[orders[0][0]]);
-		return full(normalized.atoms.length + normalized.residual === 0 && !partialOrder);
-	}
-	return {
-		access: {
-			kind: "ranges",
-			source: selected.source,
-			ranges: selected.ranges
-		},
-		exact: selected.consumed === normalized.atoms.length && normalized.residual === 0,
-		...direction === void 0 ? {} : { direction }
-	};
-}
-function full(exact) {
-	return {
-		access: { kind: "full" },
-		exact
-	};
-}
-function normalize(where) {
-	const result = {
-		atoms: [],
-		residual: 0,
-		excluded: false,
-		empty: false
-	};
-	function visit(expr) {
-		switch (expr.kind) {
-			case "field":
-				if (expr.op === "in" && (!Array.isArray(expr.value) || expr.value.length === 0)) result.empty = true;
-				result.atoms.push(expr);
-				break;
-			case "and":
-				expr.exprs.forEach(visit);
-				break;
-			case "or": {
-				if (expr.exprs.length === 0) {
-					result.empty = true;
-					break;
-				}
-				const branches = expr.exprs;
-				const first = branches[0];
-				if (first.kind !== "field" || !branches.every((branch) => branch.kind === "field" && branch.field === first.field && (branch.op === "eq" || branch.op === "in"))) {
-					result.excluded = true;
-					break;
-				}
-				const values = branches.flatMap((branch) => {
-					const atom = branch;
-					return atom.op === "eq" ? [atom.value] : Array.isArray(atom.value) ? atom.value : [];
-				});
-				visit({
-					kind: "field",
-					field: first.field,
-					op: "in",
-					value: values
-				});
-				break;
-			}
-			case "not":
-				result.excluded = true;
-				break;
-			case "null-check": result.residual++;
-		}
-	}
-	if (where) visit(where);
-	return result;
-}
-function keyTyped(field) {
-	return field !== void 0 && !field.collection && KEY_CODECS.has(field.codecId ?? "");
-}
-function keyPartial(field) {
-	return KEY_PARTIAL_CODECS.has(field?.codecId ?? "");
-}
-function completeKeyField(field, constraint) {
-	return keyTyped(field) && field?.nullable === false && (!keyPartial(field) || constraint?.rejectsNonKeys === true);
-}
-function singleFieldSource(source, field) {
-	return source.fields.length === 1 && source.fields[0] === field;
-}
-function addAtom(constraint, atom, field) {
-	if (atom.op === "eq" || atom.op === "in") {
-		const values = atom.op === "eq" ? [atom.value] : Array.isArray(atom.value) ? atom.value : [];
-		if (!values.every(isValidIdbKey)) return;
-		const points = uniqueKeys(values);
-		constraint.points = constraint.points === void 0 ? points : constraint.points.filter((point) => points.some((value) => keyEquals(point, value)));
-		constraint.rejectsNonKeys = true;
-		constraint.consumed++;
-		return;
-	}
-	if (!keyTyped(field)) return;
-	if (atom.op === "startsWith") {
-		if (field?.codecId !== "idb/string@1" || typeof atom.value !== "string") return;
-		intersectBound(constraint, "lower", {
-			value: atom.value,
-			open: false
-		});
-		const upper = stringSuccessor(atom.value);
-		if (upper !== void 0) intersectBound(constraint, "upper", {
-			value: upper,
-			open: true
-		});
-		constraint.startsWith = true;
-		constraint.consumed++;
-	} else if ([
-		"gt",
-		"gte",
-		"lt",
-		"lte"
-	].includes(atom.op) && isValidIdbKey(atom.value)) {
-		const side = atom.op === "gt" || atom.op === "gte" ? "lower" : "upper";
-		const strict = atom.op === "gt" || atom.op === "lt";
-		intersectBound(constraint, side, {
-			value: atom.value,
-			open: strict
-		});
-		if (strict) constraint.rejectsNonKeys = true;
-		constraint.consumed++;
-	}
-}
-function uniqueKeys(values) {
-	const sorted = [...values].sort(compareFieldValues);
-	return sorted.filter((value, i) => i === 0 || compareFieldValues(sorted[i - 1], value) !== 0);
-}
-function intersectBound(constraint, side, bound) {
-	const previous = constraint[side];
-	const comparison = previous === void 0 ? 0 : compareFieldValues(bound.value, previous.value);
-	if (!previous || (side === "lower" ? comparison > 0 : comparison < 0) || comparison === 0 && bound.open) constraint[side] = bound;
-}
-function insideBounds(value, constraint) {
-	const lower = constraint.lower;
-	const upper = constraint.upper;
-	if (lower && (compareFieldValues(value, lower.value) < 0 || lower.open && keyEquals(value, lower.value))) return false;
-	if (upper && (compareFieldValues(value, upper.value) > 0 || upper.open && keyEquals(value, upper.value))) return false;
-	return true;
-}
-function contradictory(constraint) {
-	if (constraint.points) {
-		constraint.points = constraint.points.filter((value) => insideBounds(value, constraint));
-		return constraint.points.length === 0;
-	}
-	if (!constraint.lower || !constraint.upper) return false;
-	const comparison = compareFieldValues(constraint.lower.value, constraint.upper.value);
-	return comparison > 0 || comparison === 0 && (constraint.lower.open || constraint.upper.open);
-}
-function filteringCandidate(catalog, source, constraints, declaration) {
-	if (source.multiEntry || source.fields.length === 0) return void 0;
-	if (source.fields.some((name) => keyPartial(catalog.fields[name]) && !constraints.get(name)?.rejectsNonKeys)) return void 0;
-	let prefixes = [[]];
-	let consumed = 0;
-	let position = 0;
-	while (position < source.fields.length) {
-		const constraint = constraints.get(source.fields[position]);
-		if (constraint?.points === void 0) break;
-		if (prefixes.length * constraint.points.length > 1024) return void 0;
-		prefixes = prefixes.flatMap((prefix) => constraint.points.map((point) => [...prefix, point]));
-		consumed += constraint.consumed;
-		position++;
-	}
-	const constraint = constraints.get(source.fields[position] ?? "");
-	const hasRange = constraint !== void 0 && (constraint.lower !== void 0 || constraint.upper !== void 0);
-	if (position === 0 && !hasRange) return void 0;
-	const used = position + Number(hasRange);
-	if (!source.fields.slice(used).every((field) => completeKeyField(catalog.fields[field], constraints.get(field)))) return void 0;
-	const compound = typeof source.keyPath !== "string";
-	if (position === source.fields.length) return {
-		source,
-		ranges: prefixes.map((prefix) => ({
-			kind: "only",
-			key: compound ? prefix : prefix[0]
-		})),
-		cost: source.indexName !== void 0 && source.unique ? COST.UNIQUE_POINT : source.indexName === void 0 ? COST.PRIMARY_POINT : COST.INDEX_POINT,
-		consumed,
-		declaration
-	};
-	if (hasRange) consumed += constraint.consumed;
-	const ranges = prefixes.map((prefix) => compound ? compoundRange(prefix, constraint, source.fields.length - used) : scalarRange(constraint));
-	if (ranges.some((range) => range.kind === "bound" && (compareFieldValues(range.lower, range.upper) > 0 || keyEquals(range.lower, range.upper) && (range.lowerOpen || range.upperOpen)))) return void 0;
-	return {
-		source,
-		ranges,
-		cost: hasRange ? constraint.lower && constraint.upper && !constraint.startsWith ? COST.TWO_SIDED_RANGE : COST.ONE_SIDED_RANGE : COST.PREFIX_POINT,
-		consumed,
-		declaration
-	};
-}
-function scalarRange(constraint) {
-	if (constraint.lower && constraint.upper) return {
-		kind: "bound",
-		lower: constraint.lower.value,
-		upper: constraint.upper.value,
-		lowerOpen: constraint.lower.open,
-		upperOpen: constraint.upper.open
-	};
-	if (constraint.lower) return {
-		kind: "lower",
-		key: constraint.lower.value,
-		open: constraint.lower.open
-	};
-	return {
-		kind: "upper",
-		key: constraint.upper.value,
-		open: constraint.upper.open
-	};
-}
-function compoundRange(prefix, constraint, trailing) {
-	const lower = constraint?.lower;
-	const upper = constraint?.upper;
-	return {
-		kind: "bound",
-		lower: lower ? [
-			...prefix,
-			lower.value,
-			...lower.open && trailing > 0 ? [[]] : []
-		] : prefix.length ? prefix : [-Infinity],
-		upper: upper ? [
-			...prefix,
-			upper.value,
-			...!upper.open && trailing > 0 ? [[]] : []
-		] : [...prefix, []],
-		lowerOpen: lower?.open ?? false,
-		upperOpen: upper ? upper.open || trailing > 0 : true
-	};
-}
-function stringSuccessor(prefix) {
-	for (let i = prefix.length - 1; i >= 0; i--) {
-		const code = prefix.charCodeAt(i);
-		if (code < 65535) return prefix.slice(0, i) + String.fromCharCode(code + 1);
-	}
-}
-//#endregion
-//#region src/core/planner/lower.ts
-/**
-* Lower row access without creating IDBKeyRange objects or awaiting work.
-* Run `finish` after the executor has materialized all returned rows.
-* Without `orderBy`, row order and pagination selection are unspecified.
-* Rows tied on every ordering field may appear in any order, including at
-* pagination boundaries. Add a unique ordering field for deterministic pages.
-*/
-function lowerRows(catalog, logical, meta, request, additionalFilter) {
-	const filter = (row) => (request.where === void 0 || evaluateFilter(request.where, row)) && (additionalFilter === void 0 || additionalFilter(row));
-	const comparator = logical.direction === void 0 ? buildRowComparator(request.orderBy) : void 0;
-	const base = {
-		meta,
-		storeName: catalog.storeName
-	};
-	const pagination = {
-		...request.skip === void 0 ? {} : { skip: request.skip },
-		...request.take === void 0 ? {} : { take: request.take }
-	};
-	let shapedByDriver = false;
-	let idbPlan;
-	switch (logical.access.kind) {
-		case "empty":
-			idbPlan = {
-				meta,
-				kind: "batch",
-				storeNames: [catalog.storeName],
-				ops: []
-			};
-			break;
-		case "full":
-			idbPlan = {
-				...base,
-				kind: "cursor-scan",
-				filter,
-				...comparator === void 0 ? {} : { comparator },
-				...pagination
-			};
-			shapedByDriver = true;
-			break;
-		case "ranges": {
-			const { source } = logical.access;
-			const ranges = [...logical.access.ranges];
-			if (logical.direction === "prev") ranges.reverse();
-			const single = ranges.length === 1;
-			const ops = ranges.map((range) => {
-				if (range?.kind === "only" && source.indexName === void 0) return {
-					...base,
-					kind: "key-get",
-					key: range.key
-				};
-				const access = {
-					...base,
-					...source.indexName === void 0 ? {} : { indexName: source.indexName },
-					...range === void 0 ? {} : { range }
-				};
-				if (!single && logical.direction !== void 0 && request.take !== void 0) return {
-					...access,
-					kind: "cursor-scan",
-					direction: logical.direction,
-					filter,
-					take: (request.skip ?? 0) + request.take
-				};
-				if (single && request.take !== void 0) {
-					shapedByDriver = true;
-					return {
-						...access,
-						kind: "cursor-scan",
-						filter,
-						...logical.direction === void 0 ? {} : { direction: logical.direction },
-						...comparator === void 0 ? {} : { comparator },
-						...pagination
-					};
-				}
-				if (logical.direction === "prev") return {
-					...access,
-					kind: "cursor-scan",
-					direction: "prev",
-					filter
-				};
-				return {
-					...access,
-					kind: "get-all"
-				};
-			});
-			idbPlan = single ? ops[0] : {
-				meta,
-				kind: "batch",
-				storeNames: [catalog.storeName],
-				ops
-			};
-			break;
-		}
-	}
-	return {
-		idbPlan,
-		finish(rows) {
-			let result = rows.filter(filter);
-			if (!shapedByDriver) {
-				if (comparator !== void 0) result.sort(comparator);
-				const skip = request.skip ?? 0;
-				result = result.slice(skip, request.take === void 0 ? void 0 : skip + request.take);
-			}
-			return result;
-		}
-	};
-}
-//#endregion
 //#region src/core/relation-loader.ts
 /**
 * Batch-load a single named relation for all rows in `rows` and attach the
@@ -1106,7 +617,6 @@ var IdbStoreAccessorImpl = class IdbStoreAccessorImpl {
 	async upsert(args) {
 		const keyPath = getKeyPath(this.#contract, this.#modelName);
 		const whereExpr = shorthandToFilterExpr(args.where);
-		const matches = (row) => whereExpr === void 0 || evaluateFilter(whereExpr, row);
 		const meta = this.#planMeta(this.#newGroupingKey());
 		const createRecord = args.create;
 		const patchRecord = args.update;
@@ -1125,13 +635,7 @@ var IdbStoreAccessorImpl = class IdbStoreAccessorImpl {
 			...collectScalarFkStoreNames(this.#contract, this.#modelName, effectivePatch)
 		])];
 		return withMutationScope(exec, storeNames, async (scope) => {
-			const existing = (await scope.execute({
-				meta,
-				kind: "cursor-scan",
-				storeName,
-				filter: matches,
-				take: 1
-			}))[0];
+			const existing = (await readMutationRows(scope, this.#contract, this.#modelName, whereExpr, 1))[0];
 			if (existing === void 0) {
 				await validateScalarFks(scope, this.#contract, this.#modelName, createWithDefaults);
 				return (await scope.execute({
@@ -1215,7 +719,6 @@ var IdbStoreAccessorImpl = class IdbStoreAccessorImpl {
 	*/
 	deleteAll() {
 		const combined = this.#combinedFilterExpr();
-		const filter = combined !== void 0 ? (row) => evaluateFilter(combined, row) : void 0;
 		const contract = this.#contract;
 		const modelName = this.#modelName;
 		const executor = requireTransactionExecutor(this.#executor);
@@ -1224,7 +727,7 @@ var IdbStoreAccessorImpl = class IdbStoreAccessorImpl {
 				executor,
 				contract,
 				modelName,
-				...filter !== void 0 ? { filter } : {}
+				...combined === void 0 ? {} : { where: combined }
 			});
 			for (const row of rows) yield row;
 		})());
@@ -1237,18 +740,27 @@ var IdbStoreAccessorImpl = class IdbStoreAccessorImpl {
 		return this.#countTerminal();
 	}
 	async #countTerminal() {
-		const scan = this.#buildScanPlan(this.#newGroupingKey());
 		const combined = this.#combinedFilterExpr();
+		const { skip, take } = this.#state;
+		const request = {
+			...combined === void 0 ? {} : { where: combined },
+			...skip === void 0 ? {} : { skip },
+			...take === void 0 ? {} : { take }
+		};
+		const meta = this.#planMeta(this.#newGroupingKey());
+		const catalog = buildCatalog(this.#contract, this.#storeName);
+		const lowered = lowerCount(catalog, planQuery(catalog, request), meta, request);
 		const ast = {
 			kind: "count",
 			modelName: this.#modelName,
 			...combined !== void 0 ? { where: combined } : {}
 		};
 		const rows = await this.#executor.query({
-			...scan.plan,
-			ast
+			meta,
+			ast,
+			idbPlan: lowered.idbPlan
 		}).toArray();
-		return scan.finish(rows).length;
+		return lowered.finish(rows);
 	}
 	/**
 	* Resolve an `include()` argument pair into an {@link IncludeEntry}: run the
@@ -1398,4 +910,4 @@ function idbOrm(options) {
 //#endregion
 export { idbOrm as t };
 
-//# sourceMappingURL=idb-orm-BitJ-EMq.mjs.map
+//# sourceMappingURL=idb-orm-B1Br1C0F.mjs.map