doxum 0.1.26 → 0.1.28

package/dist/index.js

@@ -1,4 +1,4 @@
-import { a as ProjectionError, c as snapshotCollectionView, d as isProjection, f as ownProjections, h as profile, i as ProjectionDisposedError, l as defineProcessor, m as projectionRef, n as assertSynchronous, o as collectionView, p as producerOf, r as createScheduler, s as mapRead, t as assertScope, u as defineSource } from "./scheduler--137L3j-.js";
+import { C as defineSource, D as projectionRef, E as producerOf, O as profile, S as defineProcessor, T as ownProjections, _ as compileProjectionDependencies, a as createKeyedDependencyRuntime, b as mapRead, c as assertScope, d as ProjectionDisposedError, f as ProjectionError, g as diffCollection, h as createCollectionChange, i as compileKeyedDependencies, l as assertSynchronous, m as collectionHasStructuralChange, n as keyedAbsent, o as outputKind, p as collectionChange, r as assertKeyedProjection, s as createKeyRelation, t as createKeyedTransform, u as createScheduler, v as snapshotDependencyValue, w as isProjection, x as snapshotCollectionView, y as collectionView } from "./transform-B4T3AcJr.js";
 import { n as isPlainObject, r as isRecord, t as installOwn } from "./record-B2yRhYsc.js";
 import { c as AddressIndex, d as invalidValue, f as children, g as validate, h as parent, i as contextOf, l as MutationRejected, m as is, o as decodeChanges, p as contains$1, r as bindContext, s as sealChanges, t as assertRuntimeWritable, u as fail } from "./driver-B5vdPohL.js";
 //#region core/src/schema/model.ts
@@ -2734,268 +2734,517 @@ const isExternalSource = (source) => {
 	return (candidate.kind === "value" || candidate.kind === "collection") && typeof candidate.current === "function" && typeof candidate.revision === "function" && typeof candidate.subscribe === "function";
 };
 //#endregion
-//#region core/src/projection/derive.ts
-const sourceValue = (source) => source.kind === "value" ? source.value : snapshotCollectionView(source.read);
-const outputKind = (projection) => {
-	const ref = projectionRef(projection);
-	const definition = ref.producer;
-	const output = definition.kind === "source" ? definition.output : definition.outputs[ref.output];
-	if (!output) throw new TypeError("Projection output does not exist.");
-	return output.kind;
-};
-const assertKeyedProjection = (projection, role) => {
-	if (outputKind(projection) !== "collection") throw new TypeError(`${role} must be a keyed collection projection.`);
-};
-const isKeyedDependency = (value) => {
-	if (!value || typeof value !== "object" || isProjection(value)) return false;
-	const candidate = value;
-	return isProjection(candidate.source) && typeof candidate.key === "function";
-};
-const bindKey = (index, outputKey, sourceKey) => {
-	const previous = index.forward.get(outputKey);
-	if (previous === sourceKey) return;
-	if (previous !== void 0) {
-		const dependents = index.reverse.get(previous);
-		dependents?.delete(outputKey);
-		if (dependents?.size === 0) index.reverse.delete(previous);
-		index.forward.delete(outputKey);
+//#region core/src/projection/derive/keyed.ts
+const compileOrderedKeys = (value, role) => {
+	if (!Array.isArray(value)) throw new TypeError(`${role} must be an array of string keys.`);
+	const seen = /* @__PURE__ */ new Set();
+	for (const key of value) {
+		if (typeof key !== "string") throw new TypeError(`${role} must contain only string keys.`);
+		if (seen.has(key)) throw new TypeError(`${role} must not contain duplicate keys.`);
+		seen.add(key);
 	}
-	if (sourceKey === void 0) return;
-	index.forward.set(outputKey, sourceKey);
-	const dependents = index.reverse.get(sourceKey);
-	if (dependents) dependents.add(outputKey);
-	else index.reverse.set(sourceKey, new Set([outputKey]));
-};
-const unbindKey = (indexes, outputKey) => {
-	for (const index of indexes) bindKey(index, outputKey, void 0);
-};
-const createBindingIndex = () => ({
-	forward: /* @__PURE__ */ new Map(),
-	reverse: /* @__PURE__ */ new Map()
-});
-function createValueDerive(dependencies, compute, equality = Object.is) {
-	if (!isPlainObject(dependencies) || isProjection(dependencies)) throw new TypeError("Derive dependencies must be a plain object.");
-	const names = Object.keys(dependencies);
-	const ordered = names.map((name) => dependencies[name]);
-	ordered.forEach(projectionRef);
+	return {
+		keys: value,
+		requested: seen
+	};
+};
+function createKeyedDerive(source, dependenciesOrSelect, selectOrEquality, maybeEquality) {
+	const dependencySpecs = typeof dependenciesOrSelect === "function" ? void 0 : dependenciesOrSelect;
+	const select = dependencySpecs === void 0 ? dependenciesOrSelect : selectOrEquality;
+	const equality = dependencySpecs === void 0 ? selectOrEquality : maybeEquality;
+	if (typeof select !== "function") throw new TypeError("Keyed derive requires a selector.");
+	return createKeyedTransform({
+		source,
+		dependencies: dependencySpecs,
+		equality,
+		name: "derive.keyed",
+		evaluate: ({ value, key, dependencies }) => dependencySpecs === void 0 ? select(value, key) : select(value, key, dependencies)
+	});
+}
+const createKeyedKeys = (source) => {
+	assertKeyedProjection(source, "Keyed keys source");
 	const [projection] = defineProcessor({
-		dependencies: ordered,
+		dependencies: [source],
 		outputs: [{
 			kind: "value",
-			equality
+			equality: Object.is
 		}],
 		create: () => ({ evaluate: (evaluation) => {
+			const driver = evaluation.sources[0];
 			const output = evaluation.outputs[0];
-			if (output.kind !== "value") throw new Error("derive requires a value output.");
-			const values = Object.create(null);
-			for (let index = 0; index < names.length; index++) values[names[index]] = sourceValue(evaluation.sources[index]);
-			const next = compute(Object.freeze(values));
-			assertSynchronous(next);
-			output.output.set(next);
-		} })
+			if (driver.kind !== "collection" || output.kind !== "value") throw new Error("derive.keyed.keys requires collection input and value output.");
+			if (evaluation.reset || !driver.change || collectionHasStructuralChange(driver.change)) output.output.set(driver.read.ids());
+		} }),
+		name: "derive.keyed.keys"
 	});
 	return projection;
+};
+const createOrderedSnapshot = (source, name, make) => {
+	assertKeyedProjection(source, `${name} source`);
+	const [projection] = defineProcessor({
+		dependencies: [source],
+		outputs: [{
+			kind: "value",
+			equality: Object.is
+		}],
+		create: () => {
+			let indexes = /* @__PURE__ */ new Map();
+			const rebuild = (driver) => {
+				const nextIndexes = /* @__PURE__ */ new Map();
+				const result = Object.freeze(driver.read.ids().map((key, index) => {
+					nextIndexes.set(key, index);
+					return make(key, driver.read.get(key));
+				}));
+				indexes = nextIndexes;
+				return result;
+			};
+			const rebuildIncremental = (driver, change, previous) => {
+				const changedValues = /* @__PURE__ */ new Map();
+				for (const entry of change.added) changedValues.set(entry.key, entry.after);
+				for (const entry of change.updated) changedValues.set(entry.key, entry.after);
+				const nextIndexes = /* @__PURE__ */ new Map();
+				const result = Object.freeze(driver.read.ids().map((key, index) => {
+					nextIndexes.set(key, index);
+					if (changedValues.has(key)) return make(key, changedValues.get(key));
+					const previousIndex = indexes.get(key);
+					return previousIndex === void 0 ? make(key, driver.read.get(key)) : previous[previousIndex];
+				}));
+				indexes = nextIndexes;
+				return result;
+			};
+			return {
+				evaluate: (evaluation) => {
+					const driver = evaluation.sources[0];
+					const output = evaluation.outputs[0];
+					if (driver.kind !== "collection" || output.kind !== "value") throw new Error(`${name} requires collection input and value output.`);
+					const change = driver.change;
+					if (evaluation.reset || !change || change.kind === "reset") {
+						output.output.set(rebuild(driver));
+						return;
+					}
+					const previous = output.previous;
+					if (!previous) {
+						output.output.set(rebuild(driver));
+						return;
+					}
+					if (collectionHasStructuralChange(change)) {
+						output.output.set(rebuildIncremental(driver, change, previous));
+						return;
+					}
+					if (!change.updated.length) return;
+					const next = [...previous];
+					for (const entry of change.updated) {
+						const index = indexes.get(entry.key);
+						if (index === void 0) {
+							output.output.set(rebuild(driver));
+							return;
+						}
+						next[index] = make(entry.key, entry.after);
+					}
+					output.output.set(Object.freeze(next));
+				},
+				release: () => indexes.clear()
+			};
+		},
+		name
+	});
+	return projection;
+};
+const createKeyedValues = (source) => createOrderedSnapshot(source, "derive.keyed.values", (_key, value) => value);
+const createKeyedEntries = (source) => createOrderedSnapshot(source, "derive.keyed.entries", (key, value) => Object.freeze([key, value]));
+const createKeyedGet = (source, key, equality = Object.is) => {
+	assertKeyedProjection(source, "derive.keyed.get source");
+	if (outputKind(key) !== "value") throw new TypeError("derive.keyed.get key must be a scalar projection.");
+	const [projection] = defineProcessor({
+		dependencies: [source, key],
+		outputs: [{
+			kind: "value",
+			equality
+		}],
+		create: () => {
+			let sourceRevision = -1;
+			let keyRevision = -1;
+			let selected;
+			return { evaluate: (evaluation) => {
+				const collection = evaluation.sources[0];
+				const selectedKey = evaluation.sources[1];
+				const output = evaluation.outputs[0];
+				if (collection.kind !== "collection" || selectedKey.kind !== "value" || output.kind !== "value") throw new Error("derive.keyed.get resolved invalid input/output kinds.");
+				let affected = evaluation.reset;
+				if (evaluation.reset || keyRevision !== selectedKey.revision) {
+					const candidate = selectedKey.value;
+					if (candidate !== void 0 && typeof candidate !== "string") throw new TypeError("derive.keyed.get key must resolve to a string or undefined.");
+					selected = candidate;
+					affected = true;
+				} else if (sourceRevision !== collection.revision) {
+					const change = collection.change;
+					if (!change || change.kind === "reset") affected = true;
+					else if (selected !== void 0) {
+						for (const changedKey of collectionChange.keys(change)) if (changedKey === selected) {
+							affected = true;
+							break;
+						}
+					}
+				}
+				if (affected) output.output.set(selected === void 0 ? void 0 : collection.read.get(selected));
+				sourceRevision = collection.revision;
+				keyRevision = selectedKey.revision;
+			} };
+		},
+		name: "derive.keyed.get"
+	});
+	return projection;
+};
+function createKeyedFilter(source, dependenciesOrPredicate, maybePredicate) {
+	const dependencySpecs = typeof dependenciesOrPredicate === "function" ? void 0 : dependenciesOrPredicate;
+	const predicate = dependencySpecs === void 0 ? dependenciesOrPredicate : maybePredicate;
+	if (typeof predicate !== "function") throw new TypeError("Keyed filter requires a predicate.");
+	return createKeyedTransform({
+		source,
+		dependencies: dependencySpecs,
+		equality: Object.is,
+		name: "derive.keyed.filter",
+		evaluate: ({ value, key, dependencies }) => {
+			const included = dependencySpecs === void 0 ? predicate(value, key) : predicate(value, key, dependencies);
+			assertSynchronous(included);
+			if (typeof included !== "boolean") throw new TypeError("Keyed filter predicate must return boolean.");
+			return included ? value : keyedAbsent;
+		}
+	});
 }
-function createKeyedDerive(source, dependenciesOrSelect, selectOrEquality, maybeEquality) {
-	assertKeyedProjection(source, "Keyed derive source");
+function createKeyedCompact(source, dependenciesOrSelect, selectOrEquality, maybeEquality) {
 	const dependencySpecs = typeof dependenciesOrSelect === "function" ? void 0 : dependenciesOrSelect;
 	const select = dependencySpecs === void 0 ? dependenciesOrSelect : selectOrEquality;
 	const equality = dependencySpecs === void 0 ? selectOrEquality : maybeEquality;
-	if (typeof select !== "function") throw new TypeError("Keyed derive requires a selector.");
-	const dependencies = [source];
-	const dependencyNames = [];
-	const keyed = [];
-	if (dependencySpecs !== void 0) {
-		if (!isPlainObject(dependencySpecs) || isProjection(dependencySpecs)) throw new TypeError("Keyed derive dependencies must be a plain object.");
-		for (const name of Reflect.ownKeys(dependencySpecs)) {
-			if (typeof name !== "string") throw new TypeError("Keyed derive dependency names must be strings.");
-			const descriptor = Object.getOwnPropertyDescriptor(dependencySpecs, name);
-			if (!descriptor?.enumerable || !("value" in descriptor)) throw new TypeError("Keyed derive dependencies must be enumerable data properties.");
-			const dependency = descriptor.value;
-			dependencyNames.push(name);
-			if (isProjection(dependency)) {
-				dependencies.push(dependency);
-				keyed.push(void 0);
-				continue;
-			}
-			if (!isKeyedDependency(dependency)) throw new TypeError("Keyed derive dependencies must be projections or keyed lookups.");
-			assertKeyedProjection(dependency.source, "Dynamic keyed dependency source");
-			dependencies.push(dependency.source);
-			keyed.push(dependency);
+	if (typeof select !== "function") throw new TypeError("Keyed compact requires a selector.");
+	return createKeyedTransform({
+		source,
+		dependencies: dependencySpecs,
+		equality,
+		name: "derive.keyed.compact",
+		evaluate: ({ value, key, dependencies }) => {
+			const next = dependencySpecs === void 0 ? select(value, key) : select(value, key, dependencies);
+			assertSynchronous(next);
+			return next === void 0 ? keyedAbsent : next;
 		}
+	});
+}
+const createKeyedSubset = (source, orderedKeys) => {
+	assertKeyedProjection(source, "Keyed subset source");
+	const keyProjection = isProjection(orderedKeys) ? orderedKeys : void 0;
+	if (keyProjection && outputKind(keyProjection) !== "value") throw new TypeError("Keyed subset ordered keys must be a value projection.");
+	const staticSelection = keyProjection ? void 0 : (() => {
+		const compiled = compileOrderedKeys(orderedKeys, "Keyed subset ordered keys");
+		return {
+			keys: Object.freeze([...compiled.keys]),
+			requested: compiled.requested
+		};
+	})();
+	const [projection] = defineProcessor({
+		dependencies: keyProjection ? [source, keyProjection] : [source],
+		outputs: [{
+			kind: "collection",
+			equality: Object.is
+		}],
+		create: () => {
+			let keys = staticSelection?.keys;
+			let requested = staticSelection?.requested;
+			let keyRevision = -1;
+			return {
+				evaluate: (evaluation) => {
+					const driver = evaluation.sources[0];
+					const output = evaluation.outputs[0];
+					if (driver.kind !== "collection" || output.kind !== "collection") throw new Error("derive.keyed.subset requires collection input and output.");
+					let keysChanged = false;
+					if (keyProjection) {
+						const sourceContext = evaluation.sources[1];
+						if (sourceContext?.kind !== "value") throw new TypeError("Keyed subset ordered keys resolved to a collection.");
+						if (keys === void 0 || sourceContext.reset || keyRevision !== sourceContext.revision) {
+							const compiled = compileOrderedKeys(sourceContext.value, "Keyed subset ordered keys");
+							keys = compiled.keys;
+							requested = compiled.requested;
+							keyRevision = sourceContext.revision;
+							keysChanged = true;
+						}
+					}
+					if (!keys || !requested) throw new Error("Keyed subset keys were not initialized.");
+					const activeKeys = keys;
+					const activeRequested = requested;
+					const orderedPresentKeys = () => activeKeys.filter((key) => driver.read.has(key));
+					const rebuild = () => {
+						const nextKeys = orderedPresentKeys();
+						for (const key of nextKeys) output.output.set(key, driver.read.get(key));
+						output.output.order(nextKeys);
+					};
+					const reconcileKeys = () => {
+						const nextKeys = orderedPresentKeys();
+						for (const key of output.previous.ids()) if (!activeRequested.has(key) || !driver.read.has(key)) output.output.remove(key);
+						for (const key of nextKeys) if (!output.previous.has(key)) output.output.set(key, driver.read.get(key));
+						output.output.order(nextKeys);
+					};
+					const change = driver.change;
+					if (evaluation.reset || change?.kind === "reset") rebuild();
+					else if (keysChanged) {
+						reconcileKeys();
+						if (change) for (const entry of change.updated) {
+							const key = entry.key;
+							if (activeRequested.has(key) && output.previous.has(key)) output.output.set(key, entry.after);
+						}
+					} else if (change) {
+						let updateOrder = false;
+						for (const entry of change.removed) {
+							const key = entry.key;
+							if (!activeRequested.has(key)) continue;
+							output.output.remove(key);
+							updateOrder = true;
+						}
+						for (const entry of change.added) {
+							const key = entry.key;
+							if (!activeRequested.has(key)) continue;
+							output.output.set(key, entry.after);
+							updateOrder = true;
+						}
+						for (const entry of change.updated) {
+							const key = entry.key;
+							if (activeRequested.has(key)) output.output.set(key, entry.after);
+						}
+						if (updateOrder) output.output.order(orderedPresentKeys());
+					}
+				},
+				release: () => {
+					if (keyProjection) {
+						keys = void 0;
+						requested = void 0;
+						keyRevision = -1;
+					}
+				}
+			};
+		},
+		name: "derive.keyed.subset"
+	});
+	return projection;
+};
+const normalizeGroups = (value) => {
+	const groups = typeof value === "string" ? [value] : value;
+	if (!Array.isArray(groups)) throw new TypeError("derive.keyed.groupBy selector must return a string or an array of strings.");
+	const seen = /* @__PURE__ */ new Set();
+	const result = [];
+	for (const group of groups) {
+		if (typeof group !== "string") throw new TypeError("derive.keyed.groupBy selector must return only string group keys.");
+		if (seen.has(group)) throw new TypeError("derive.keyed.groupBy selector must not return duplicate group keys.");
+		seen.add(group);
+		result.push(group);
 	}
+	return Object.freeze(result);
+};
+function createKeyedGroupBy(source, dependenciesOrSelector, maybeSelector) {
+	assertKeyedProjection(source, "derive.keyed.groupBy source");
+	const dependencySpecs = typeof dependenciesOrSelector === "function" ? void 0 : dependenciesOrSelector;
+	const selector = dependencySpecs === void 0 ? dependenciesOrSelector : maybeSelector;
+	if (typeof selector !== "function") throw new TypeError("derive.keyed.groupBy requires a selector.");
+	const compiled = compileKeyedDependencies(source, dependencySpecs, "derive.keyed.groupBy");
 	const [projection] = defineProcessor({
-		dependencies,
+		dependencies: compiled.projections,
 		outputs: [{
 			kind: "collection",
-			equality: equality ?? Object.is
+			equality: (previous, next) => {
+				const left = previous;
+				const right = next;
+				return left.length === right.length && left.every((key, index) => key === right[index]);
+			}
 		}],
 		create: () => {
-			const bindings = keyed.map((dependency) => dependency ? createBindingIndex() : void 0);
-			const bindingIndexes = bindings.filter((index) => index !== void 0);
-			const globalValues = keyed.map(() => void 0);
-			let revisions = Object.freeze([]);
-			const clearBindings = () => {
-				for (const index of bindings) {
-					index?.forward.clear();
-					index?.reverse.clear();
+			const dependencies = createKeyedDependencyRuntime(compiled);
+			const relation = createKeyRelation();
+			const orderIndex = /* @__PURE__ */ new Map();
+			const groupRanks = /* @__PURE__ */ new Map();
+			const refreshOrderIndex = (driver) => {
+				orderIndex.clear();
+				driver.read.ids().forEach((key, index) => orderIndex.set(key, index));
+			};
+			const selectGroups = (driver, sources, key, affected) => {
+				if (!driver.read.has(key)) return false;
+				const value = driver.read.get(key);
+				const dependencyValues = dependencies.resolve(value, key, sources);
+				const selected = dependencySpecs === void 0 ? selector(value, key) : selector(value, key, dependencyValues);
+				assertSynchronous(selected);
+				const next = normalizeGroups(selected);
+				const previous = relation.forward(key) ?? Object.freeze([]);
+				if (!relation.replace(key, next)) return false;
+				for (const group of previous) affected.add(group);
+				for (const group of next) affected.add(group);
+				return true;
+			};
+			const updateGroup = (group, output) => {
+				const reverse = relation.reverse(group);
+				if (!reverse?.size) {
+					groupRanks.delete(group);
+					output.output.remove(group);
+					return;
 				}
+				const members = [...reverse].sort((left, right) => (orderIndex.get(left) ?? Number.MAX_SAFE_INTEGER) - (orderIndex.get(right) ?? Number.MAX_SAFE_INTEGER));
+				const first = members[0];
+				const source = orderIndex.get(first);
+				const selector = relation.forward(first)?.indexOf(group) ?? -1;
+				if (source === void 0 || selector < 0) throw new Error("derive.keyed.groupBy relation is inconsistent with source order.");
+				groupRanks.set(group, {
+					source,
+					selector
+				});
+				output.output.set(group, Object.freeze(members));
+			};
+			const publishGroupOrder = (output) => {
+				const order = [...groupRanks.entries()].sort(([leftKey, left], [rightKey, right]) => {
+					if (left.source !== right.source) return left.source - right.source;
+					if (left.selector !== right.selector) return left.selector - right.selector;
+					return leftKey < rightKey ? -1 : leftKey > rightKey ? 1 : 0;
+				}).map(([group]) => group);
+				output.output.order(order);
+			};
+			const rebuild = (driver, sources, output) => {
+				dependencies.clearBindings();
+				relation.clear();
+				groupRanks.clear();
+				refreshOrderIndex(driver);
+				const affected = /* @__PURE__ */ new Set();
+				for (const key of driver.read.ids()) selectGroups(driver, sources, key, affected);
+				for (const key of output.previous.ids()) affected.add(key);
+				for (const group of affected) updateGroup(group, output);
+				publishGroupOrder(output);
+			};
+			const publishAffected = (affected, output, orderDirty) => {
+				for (const group of affected) updateGroup(group, output);
+				if (orderDirty) publishGroupOrder(output);
+			};
+			const removeSourceKey = (key, affected) => {
+				const previous = relation.forward(key);
+				if (!previous) return false;
+				for (const group of previous) affected.add(group);
+				return relation.delete(key);
+			};
+			const markAllGroups = (output, affected) => {
+				for (const group of relation.rights()) affected.add(group);
+				for (const group of output.previous.ids()) affected.add(group);
 			};
 			return {
 				evaluate: (evaluation) => {
 					const driver = evaluation.sources[0];
 					const output = evaluation.outputs[0];
-					if (driver.kind !== "collection" || output.kind !== "collection") throw new Error("Keyed derive requires collection input and output.");
-					const currentRevisions = evaluation.sources.map((current) => current.revision);
-					for (let index = 0; index < keyed.length; index++) {
-						if (keyed[index]) continue;
-						if (evaluation.reset || revisions[index + 1] !== currentRevisions[index + 1]) globalValues[index] = sourceValue(evaluation.sources[index + 1]);
-					}
-					const project = (key) => {
-						if (!driver.read.has(key)) return;
-						const value = driver.read.get(key);
-						const dependencyValues = Object.create(null);
-						for (let index = 0; index < keyed.length; index++) {
-							const dependency = keyed[index];
-							if (!dependency) {
-								dependencyValues[dependencyNames[index]] = globalValues[index];
-								continue;
-							}
-							const sourceContext = evaluation.sources[index + 1];
-							if (sourceContext.kind !== "collection") throw new TypeError("Dynamic keyed dependency resolved to a non-collection source.");
-							const selectedKey = dependency.key(value, key);
-							assertSynchronous(selectedKey);
-							if (selectedKey !== void 0 && typeof selectedKey !== "string") throw new TypeError("Dynamic keyed dependency keys must be strings or undefined.");
-							bindKey(bindings[index], key, selectedKey);
-							dependencyValues[dependencyNames[index]] = selectedKey === void 0 ? void 0 : sourceContext.read.get(selectedKey);
-						}
-						const next = dependencySpecs === void 0 ? select(value, key) : select(value, key, Object.freeze(dependencyValues));
-						assertSynchronous(next);
-						output.output.set(key, next);
-					};
+					if (driver.kind !== "collection" || output.kind !== "collection") throw new Error("derive.keyed.groupBy requires collection input and output.");
+					dependencies.prepare(evaluation.sources, evaluation.reset);
 					if (evaluation.reset) {
-						clearBindings();
-						const ids = driver.read.ids();
-						for (const key of ids) project(key);
-						output.output.order(ids);
-						revisions = Object.freeze(currentRevisions);
+						rebuild(driver, evaluation.sources, output);
+						dependencies.remember(evaluation.sources);
 						return;
 					}
 					const dirty = /* @__PURE__ */ new Set();
+					const affected = /* @__PURE__ */ new Set();
 					let all = false;
-					let updateOrder = false;
-					if (revisions[0] !== currentRevisions[0]) {
+					let structural = false;
+					let orderDirty = false;
+					if (dependencies.driverChanged(driver)) {
 						const change = driver.change;
 						if (!change || change.kind === "reset") {
-							all = true;
-							updateOrder = true;
+							rebuild(driver, evaluation.sources, output);
+							dependencies.remember(evaluation.sources);
+							return;
 						} else {
 							for (const entry of change.removed) {
-								output.output.remove(entry.key);
-								unbindKey(bindingIndexes, entry.key);
+								orderDirty ||= removeSourceKey(entry.key, affected);
+								dependencies.remove(entry.key);
 								dirty.delete(entry.key);
 							}
 							for (const entry of change.added) dirty.add(entry.key);
 							for (const entry of change.updated) dirty.add(entry.key);
-							updateOrder = Boolean(change.added.length || change.removed.length || change.order);
-						}
-					}
-					for (let index = 0; index < keyed.length; index++) {
-						if (revisions[index + 1] === currentRevisions[index + 1]) continue;
-						if (!keyed[index]) {
-							all = true;
-							continue;
-						}
-						const sourceContext = evaluation.sources[index + 1];
-						if (sourceContext.kind !== "collection" || !sourceContext.change) {
-							all = true;
-							continue;
+							structural = Boolean(change.added.length || change.removed.length || change.order);
+							orderDirty ||= structural;
+							if (structural) refreshOrderIndex(driver);
 						}
-						if (sourceContext.change.kind === "reset") {
-							all = true;
-							continue;
-						}
-						const reverse = bindings[index].reverse;
-						for (const transition of sourceContext.change.added) for (const outputKey of reverse.get(transition.key) ?? []) dirty.add(outputKey);
-						for (const transition of sourceContext.change.updated) for (const outputKey of reverse.get(transition.key) ?? []) dirty.add(outputKey);
-						for (const transition of sourceContext.change.removed) for (const outputKey of reverse.get(transition.key) ?? []) dirty.add(outputKey);
 					}
+					all ||= dependencies.collectInvalidated(evaluation.sources, dirty);
 					if (all) for (const key of driver.read.ids()) dirty.add(key);
-					for (const key of dirty) if (driver.read.has(key)) project(key);
-					if (updateOrder) output.output.order(driver.read.ids());
-					revisions = Object.freeze(currentRevisions);
+					for (const key of dirty) orderDirty ||= selectGroups(driver, evaluation.sources, key, affected);
+					if (structural) markAllGroups(output, affected);
+					publishAffected(affected, output, orderDirty);
+					dependencies.remember(evaluation.sources);
 				},
 				release: () => {
-					clearBindings();
-					revisions = Object.freeze([]);
+					relation.clear();
+					orderIndex.clear();
+					groupRanks.clear();
+					dependencies.release();
 				}
 			};
 		},
-		name: "derive.keyed"
+		name: "derive.keyed.groupBy"
 	});
 	return projection;
 }
-const derive = Object.assign(createValueDerive, { keyed: createKeyedDerive });
-//#endregion
-//#region core/src/projection/collection/change.ts
-const commonOrderChanged = (before, after, added, removed) => {
-	const beforeCommon = before.filter((key) => !removed.has(key));
-	const afterCommon = after.filter((key) => !added.has(key));
-	return beforeCommon.some((key, index) => afterCommon[index] !== key);
-};
-/** Builds the canonical incremental CollectionChange from already-known net transitions. */
-const createCollectionChange = (input) => {
-	const addedKeys = new Set(input.added.map((entry) => entry.key));
-	const removedKeys = new Set(input.removed.map((entry) => entry.key));
-	const orderChanged = input.beforeOrder !== input.afterOrder && commonOrderChanged(input.beforeOrder, input.afterOrder, addedKeys, removedKeys);
-	if (!input.added.length && !input.updated.length && !input.removed.length && !orderChanged) return void 0;
-	return Object.freeze({
-		kind: "incremental",
-		added: Object.freeze([...input.added]),
-		updated: Object.freeze([...input.updated]),
-		removed: Object.freeze([...input.removed]),
-		...orderChanged ? { order: Object.freeze({
-			before: Object.freeze([...input.beforeOrder]),
-			after: Object.freeze([...input.afterOrder])
-		}) } : {}
+const createKeyedSingleton = (source, keyOf, equality = Object.is) => {
+	if (outputKind(source) !== "value") throw new TypeError("derive.keyed.singleton source must be a scalar projection.");
+	if (typeof keyOf !== "function") throw new TypeError("derive.keyed.singleton requires a key selector.");
+	const [projection] = defineProcessor({
+		dependencies: [source],
+		outputs: [{
+			kind: "collection",
+			equality
+		}],
+		create: () => ({ evaluate: (evaluation) => {
+			const scalar = evaluation.sources[0];
+			const output = evaluation.outputs[0];
+			if (scalar.kind !== "value" || output.kind !== "collection") throw new Error("derive.keyed.singleton resolved invalid input/output kinds.");
+			const previous = output.previous.ids();
+			if (scalar.value === void 0) {
+				for (const key of previous) output.output.remove(key);
+				return;
+			}
+			const key = keyOf(scalar.value);
+			assertSynchronous(key);
+			if (typeof key !== "string") throw new TypeError("derive.keyed.singleton key selector must return a string.");
+			for (const previousKey of previous) if (previousKey !== key) output.output.remove(previousKey);
+			output.output.set(key, scalar.value);
+			if (previous.length !== 1 || previous[0] !== key) output.output.order([key]);
+		} }),
+		name: "derive.keyed.singleton"
 	});
+	return projection;
 };
-/** Exact fallback diff between two published map-like snapshots. */
-const diffCollection = (previous, current, isEqual = Object.is) => {
-	const added = [];
-	const updated = [];
-	const removed = [];
-	for (const [key, before] of previous) if (!current.has(key)) removed.push({
-		key,
-		before
-	});
-	else {
-		const after = current.get(key);
-		if (!isEqual(before, after)) updated.push({
-			key,
-			before,
-			after
-		});
-	}
-	for (const [key, after] of current) if (!previous.has(key)) added.push({
-		key,
-		after
-	});
-	return createCollectionChange({
-		added,
-		updated,
-		removed,
-		beforeOrder: [...previous.keys()],
-		afterOrder: [...current.keys()]
+const keyedDerive = Object.assign(createKeyedDerive, {
+	keys: createKeyedKeys,
+	values: createKeyedValues,
+	entries: createKeyedEntries,
+	get: createKeyedGet,
+	groupBy: createKeyedGroupBy,
+	singleton: createKeyedSingleton,
+	subset: createKeyedSubset,
+	filter: createKeyedFilter,
+	compact: createKeyedCompact
+});
+//#endregion
+//#region core/src/projection/derive.ts
+function createValueDerive(dependencies, compute, equality = Object.is) {
+	const compiled = compileProjectionDependencies(dependencies, "Derive");
+	const names = compiled.names;
+	const ordered = compiled.projections;
+	const [projection] = defineProcessor({
+		dependencies: ordered,
+		outputs: [{
+			kind: "value",
+			equality
+		}],
+		create: () => ({ evaluate: (evaluation) => {
+			const output = evaluation.outputs[0];
+			if (output.kind !== "value") throw new Error("derive requires a value output.");
+			const values = Object.create(null);
+			for (let index = 0; index < names.length; index++) values[names[index]] = snapshotDependencyValue(evaluation.sources[index]);
+			const next = compute(Object.freeze(values));
+			assertSynchronous(next);
+			output.output.set(next);
+		} })
 	});
-};
-const collectionChangedKeys = (change) => change.kind === "reset" ? /* @__PURE__ */ new Set() : new Set([
-	...change.added.map((entry) => entry.key),
-	...change.updated.map((entry) => entry.key),
-	...change.removed.map((entry) => entry.key)
-]);
-const collectionHasStructuralChange = (change) => change.kind === "reset" || Boolean(change.added.length || change.removed.length || change.order);
-const collectionHasAnyChange = (change) => change.kind === "reset" || Boolean(change.added.length || change.updated.length || change.removed.length || change.order);
+	return projection;
+}
+const derive = Object.assign(createValueDerive, { keyed: keyedDerive });
 //#endregion
 //#region core/src/projection/collection/index.ts
 const height = (node) => node?.height ?? 0;
@@ -3208,15 +3457,36 @@ const createCollectionOutput = (binding) => {
 		profile.projection("touchedKeys", staged.size);
 		const added = /* @__PURE__ */ new Set();
 		const removed = /* @__PURE__ */ new Set();
-		const updated = /* @__PURE__ */ new Set();
+		const addedEntries = [];
+		const updatedEntries = [];
+		const removedEntries = [];
 		for (const [key, entry] of staged) {
 			const existed = published.has(key);
 			if (entry.present) {
-				if (!existed) added.add(key);
-				else if (!isEqual(published.get(key), entry.value)) updated.add(key);
+				if (!existed) {
+					added.add(key);
+					addedEntries.push({
+						key,
+						after: entry.value
+					});
+					continue;
+				}
+				const before = published.get(key);
+				if (!isEqual(before, entry.value)) updatedEntries.push({
+					key,
+					before,
+					after: entry.value
+				});
 				else if (!nextReset) staged.delete(key);
-			} else if (existed) removed.add(key);
-			else staged.delete(key);
+				continue;
+			}
+			if (existed) {
+				removed.add(key);
+				removedEntries.push({
+					key,
+					before: published.get(key)
+				});
+			} else staged.delete(key);
 		}
 		const ids = published.ids();
 		if (explicitOrder || added.size || removed.size) {
@@ -3224,35 +3494,7 @@ const createCollectionOutput = (binding) => {
 			if (new Set(order).size !== order.length || order.length !== published.size() + added.size - removed.size || order.some((key) => !hasNext(key))) throw new TypeError("Projection order must contain every key exactly once.");
 			nextIds = ids.length === order.length && ids.every((key, index) => key === order[index]) ? ids : Object.freeze([...order]);
 		} else nextIds = ids;
-		const changedKeys = /* @__PURE__ */ new Set();
-		added.forEach((key) => changedKeys.add(key));
-		removed.forEach((key) => changedKeys.add(key));
-		updated.forEach((key) => changedKeys.add(key));
-		profile.projection("changedKeys", changedKeys.size);
-		const addedEntries = [];
-		const updatedEntries = [];
-		const removedEntries = [];
-		for (const key of changedKeys) {
-			const beforePresent = published.has(key);
-			const afterPresent = hasNext(key);
-			if (beforePresent === afterPresent) {
-				if (!beforePresent) continue;
-				if (isEqual !== Object.is && isEqual(published.get(key), getNext(key))) continue;
-			}
-			if (!beforePresent) addedEntries.push({
-				key,
-				after: getNext(key)
-			});
-			else if (!afterPresent) removedEntries.push({
-				key,
-				before: published.get(key)
-			});
-			else updatedEntries.push({
-				key,
-				before: published.get(key),
-				after: getNext(key)
-			});
-		}
+		profile.projection("changedKeys", addedEntries.length + updatedEntries.length + removedEntries.length);
 		change = nextReset ? Object.freeze({ kind: "reset" }) : createCollectionChange({
 			added: addedEntries,
 			updated: updatedEntries,
@@ -3301,7 +3543,7 @@ const createCollectionOutput = (binding) => {
 			initialized = true;
 		},
 		emit: (call) => {
-			Array.from(listeners).forEach((listener) => call(listener));
+			Array.from(listeners).forEach((listener) => call(listener, change));
 		},
 		hasConsumers: () => consumers.size > 0,
 		forEachConsumer: (run) => consumers.forEach(run),
@@ -3411,7 +3653,7 @@ const createValueOutput = (binding) => {
 		},
 		emit: (call) => {
 			profile.materialized.notification();
-			Array.from(listeners).forEach((listener) => call(listener));
+			Array.from(listeners).forEach((listener) => call(listener, void 0));
 		},
 		hasConsumers: () => consumers.size > 0,
 		forEachConsumer: (run) => consumers.forEach(run),
@@ -3566,6 +3808,20 @@ const createProcessor = (scheduler, definition, dependencies) => {
 	return processor;
 };
 //#endregion
+//#region core/src/projection/readable/listeners.ts
+/** Exhaustively notifies one projection-readable listener snapshot. */
+const notifyProjectionListeners = (listeners, message) => {
+	const snapshot = [...listeners];
+	const failures = [];
+	for (const listener of snapshot) try {
+		listener();
+	} catch (error) {
+		failures.push(error);
+	}
+	if (failures.length === 1) throw failures[0];
+	if (failures.length) throw new AggregateError(failures, message);
+};
+//#endregion
 //#region core/src/projection/readable/selection.ts
 let activeTracker;
 const trackKey = (key) => {
@@ -3617,10 +3873,9 @@ const trackedMap = (source) => {
 };
 const selectionAffects = (selection, change) => {
 	if (!change || change.kind === "reset") return true;
-	if (selection.all && collectionHasAnyChange(change)) return true;
+	if (selection.all) return true;
 	if (selection.structure && collectionHasStructuralChange(change)) return true;
-	const changedKeys = collectionChangedKeys(change);
-	for (const key of selection.keys) if (changedKeys.has(key)) return true;
+	for (const key of collectionChange.keys(change)) if (selection.keys.has(key)) return true;
 	return false;
 };
 const createDirectReadable = (source) => Object.freeze({
@@ -3701,7 +3956,7 @@ const createSelectorReadable = (source, selector, equality = Object.is) => {
 			updateCollectionSnapshot();
 			return;
 		}
-		if (evaluate()) Array.from(listeners).forEach((listener) => listener());
+		if (evaluate()) notifyProjectionListeners(listeners, "Projection selector listeners failed.");
 	};
 	const installSource = () => {
 		if (!unsubscribeSource) unsubscribeSource = source.subscribe(onProjectionChange);
@@ -4162,7 +4417,7 @@ const stageCollectionRead = (state, read, active, options) => {
 		evaluation.output.order(ids);
 	} else {
 		const previous = state.current();
-		const keys = options.candidates ? [...new Set(options.candidates)] : [...new Set([...previous.ids(), ...read.ids()])];
+		const keys = options.candidates ? [...options.candidates] : [...new Set([...previous.ids(), ...read.ids()])];
 		if (!options.candidates) profile.collectionView.idsScanned(keys.length);
 		for (const key of keys) if (read.has(key)) {
 			profile.collectionView.mapped();
@@ -4851,6 +5106,7 @@ const materializeInputSource = (scheduler, definition) => {
 				scheduler.assertIdle();
 				const staged = /* @__PURE__ */ new Map();
 				const operations = [];
+				let structural = false;
 				let active = true;
 				const draft = Object.freeze({
 					get: (key) => {
@@ -4866,6 +5122,8 @@ const materializeInputSource = (scheduler, definition) => {
 					set: (key, value) => {
 						assertScope(() => active);
 						if (typeof key !== "string") throw new TypeError("Projection keys must be strings.");
+						const previous = staged.get(key);
+						structural ||= previous ? !previous.present : !values.has(key);
 						staged.set(key, {
 							present: true,
 							value
@@ -4879,8 +5137,11 @@ const materializeInputSource = (scheduler, definition) => {
 					remove: (key) => {
 						assertScope(() => active);
 						if (typeof key !== "string") throw new TypeError("Projection keys must be strings.");
+						const previous = staged.get(key);
+						const present = previous ? previous.present : values.has(key);
+						structural ||= present;
 						staged.set(key, { present: false });
-						operations.push({
+						if (present) operations.push({
 							kind: "remove",
 							key
 						});
@@ -4891,32 +5152,25 @@ const materializeInputSource = (scheduler, definition) => {
 				} finally {
 					active = false;
 				}
+				if (!operations.length) return;
 				const candidates = /* @__PURE__ */ new Set();
-				let structural = false;
-				const accepted = [];
-				const overlay = /* @__PURE__ */ new Map();
-				for (const operation of operations) {
-					const overlayValue = overlay.get(operation.key);
-					const present = overlayValue ? overlayValue.present : values.has(operation.key);
-					if (operation.kind === "set") {
-						const previous = overlayValue ? overlayValue.present ? overlayValue.value : void 0 : values.get(operation.key);
-						if (present && source.equality(previous, operation.value)) continue;
-						structural ||= !present;
-						overlay.set(operation.key, {
-							present: true,
-							value: operation.value
-						});
-					} else {
-						if (!present) continue;
-						structural = true;
-						overlay.set(operation.key, { present: false });
-					}
-					accepted.push(operation);
-					candidates.add(operation.key);
+				const retained = /* @__PURE__ */ new Map();
+				for (const [key, entry] of staged) {
+					const existed = values.has(key);
+					if (entry.present) {
+						if (!existed) {
+							candidates.add(key);
+							continue;
+						}
+						const previous = values.get(key);
+						if (source.equality(previous, entry.value)) retained.set(key, previous);
+						else candidates.add(key);
+					} else if (existed) candidates.add(key);
 				}
-				if (!accepted.length) return;
-				for (const operation of accepted) if (operation.kind === "set") values.set(operation.key, operation.value);
+				if (!candidates.size && !structural) return;
+				for (const operation of operations) if (operation.kind === "set") values.set(operation.key, operation.value);
 				else values.delete(operation.key);
+				for (const [key, value] of retained) if (values.has(key)) values.set(key, value);
 				boundary.mark({
 					candidates,
 					orderMayChange: structural
@@ -4959,6 +5213,212 @@ const createSourceRegistry = (scheduler) => {
 	};
 };
 //#endregion
+//#region core/src/projection/readable/keyed.ts
+const sameKeys = (previous, next) => previous.length === next.length && previous.every((key, index) => key === next[index]);
+/** Runtime-owned keyed consumer family over one materialized collection output. */
+const createProjectionItems = (source, checkOwner) => {
+	if (source.kind !== "collection") throw new TypeError("Projection items require a keyed collection projection.");
+	let disposed = false;
+	const active = /* @__PURE__ */ new Map();
+	const followers = /* @__PURE__ */ new Map();
+	const waiting = /* @__PURE__ */ new Map();
+	let keysValue = Object.freeze([...source.current().keys()]);
+	let keysRevision = 0;
+	const keyListeners = /* @__PURE__ */ new Set();
+	const check = () => {
+		if (disposed) throw new ProjectionDisposedError();
+		checkOwner();
+	};
+	const notifications = [];
+	const notify = (listeners) => {
+		for (const listener of listeners) notifications.push(listener);
+	};
+	const flushNotifications = () => {
+		notifyProjectionListeners(notifications.splice(0), "Projection item listeners failed.");
+	};
+	const unregisterWaiting = (state) => {
+		const states = waiting.get(state.key);
+		states?.delete(state);
+		if (states?.size === 0) waiting.delete(state.key);
+	};
+	const registerWaiting = (state) => {
+		if (state.tracked || state.ended) return;
+		const states = waiting.get(state.key);
+		if (states) states.add(state);
+		else waiting.set(state.key, new Set([state]));
+	};
+	const publishState = (state, value) => {
+		if (state.ended) return;
+		if (Object.is(state.value, value)) {
+			state.value = value;
+			return;
+		}
+		state.value = value;
+		state.revision++;
+		notify(state.listeners);
+	};
+	const attachActive = (state, value) => {
+		if (state.ended) return;
+		unregisterWaiting(state);
+		state.tracked = true;
+		const canonical = active.get(state.key);
+		if (!canonical) active.set(state.key, state);
+		else if (canonical !== state) {
+			const states = followers.get(state.key);
+			if (states) states.add(state);
+			else followers.set(state.key, new Set([state]));
+		}
+		publishState(state, value);
+	};
+	const terminateState = (state) => {
+		if (state.ended) return;
+		unregisterWaiting(state);
+		state.tracked = false;
+		publishState(state, void 0);
+		state.ended = true;
+	};
+	const statesFor = (key) => {
+		const result = [];
+		const canonical = active.get(key);
+		if (canonical) result.push(canonical);
+		const extra = followers.get(key);
+		if (extra) result.push(...extra);
+		return result;
+	};
+	const terminateKey = (key) => {
+		for (const state of statesFor(key)) terminateState(state);
+		active.delete(key);
+		followers.delete(key);
+	};
+	const activateWaiting = (key, value) => {
+		const states = waiting.get(key);
+		if (!states?.size) return;
+		waiting.delete(key);
+		for (const state of states) attachActive(state, value);
+	};
+	const updateKey = (key, value) => {
+		for (const state of statesFor(key)) publishState(state, value);
+	};
+	const updateKeys = (current) => {
+		const next = Object.freeze([...current.keys()]);
+		if (sameKeys(keysValue, next)) return;
+		keysValue = next;
+		keysRevision++;
+		notify(keyListeners);
+	};
+	const createItem = (key, initial) => {
+		const state = {
+			key,
+			listeners: /* @__PURE__ */ new Set(),
+			tracked: initial !== void 0,
+			ended: false,
+			value: initial?.value,
+			revision: 0
+		};
+		const ensureObserved = () => {
+			if (state.ended || state.tracked) return;
+			const current = source.current();
+			if (current.has(key)) attachActive(state, current.get(key));
+		};
+		state.readable = Object.freeze({
+			current: () => {
+				check();
+				ensureObserved();
+				return state.value;
+			},
+			revision: () => {
+				check();
+				ensureObserved();
+				return state.revision;
+			},
+			subscribe: (listener) => {
+				check();
+				ensureObserved();
+				state.listeners.add(listener);
+				if (!state.tracked && !state.ended) registerWaiting(state);
+				return () => {
+					state.listeners.delete(listener);
+					if (!state.listeners.size && !state.tracked) unregisterWaiting(state);
+				};
+			}
+		});
+		return state;
+	};
+	const reconcile = (current) => {
+		for (const key of [...active.keys()]) if (!current.has(key)) terminateKey(key);
+		else updateKey(key, current.get(key));
+		for (const key of [...waiting.keys()]) if (current.has(key)) activateWaiting(key, current.get(key));
+		updateKeys(current);
+	};
+	const onChange = (change) => {
+		check();
+		const current = source.current();
+		if (!change || change.kind === "reset") {
+			reconcile(current);
+			flushNotifications();
+			return;
+		}
+		for (const entry of change.removed) terminateKey(entry.key);
+		for (const entry of change.added) activateWaiting(entry.key, entry.after);
+		for (const entry of change.updated) updateKey(entry.key, entry.after);
+		if (change.added.length || change.removed.length || change.order) updateKeys(current);
+		flushNotifications();
+	};
+	const stop = source.subscribe(onChange);
+	const keys = Object.freeze({
+		current: () => {
+			check();
+			return keysValue;
+		},
+		revision: () => {
+			check();
+			return keysRevision;
+		},
+		subscribe: (listener) => {
+			check();
+			keyListeners.add(listener);
+			return () => keyListeners.delete(listener);
+		}
+	});
+	return {
+		items: Object.freeze({
+			keys,
+			get: (key) => {
+				check();
+				const canonical = active.get(key);
+				if (canonical) return canonical.readable;
+				const pending = waiting.get(key)?.values().next().value;
+				if (pending) return pending.readable;
+				const current = source.current();
+				if (current.has(key)) {
+					const state = createItem(key, {
+						present: true,
+						value: current.get(key)
+					});
+					active.set(key, state);
+					return state.readable;
+				}
+				return createItem(key).readable;
+			}
+		}),
+		dispose() {
+			if (disposed) return;
+			disposed = true;
+			stop();
+			keyListeners.clear();
+			const known = /* @__PURE__ */ new Set();
+			active.forEach((state) => known.add(state));
+			followers.forEach((states) => states.forEach((state) => known.add(state)));
+			waiting.forEach((states) => states.forEach((state) => known.add(state)));
+			known.forEach((state) => state.listeners.clear());
+			active.clear();
+			followers.clear();
+			waiting.clear();
+			notifications.length = 0;
+		}
+	};
+};
+//#endregion
 //#region core/src/projection/runtime.ts
 const createProjectionRuntime = (options) => {
 	const scheduler = createScheduler(options?.onError ?? (() => void 0));
@@ -4966,6 +5426,30 @@ const createProjectionRuntime = (options) => {
 	const materialized = /* @__PURE__ */ new WeakMap();
 	const publicViews = /* @__PURE__ */ new WeakMap();
 	const scopes = /* @__PURE__ */ new Set();
+	const rootItems = /* @__PURE__ */ new Map();
+	const disposeItemControllers = (registry, failures) => {
+		const controllers = [...registry.values()];
+		registry.clear();
+		for (const controller of controllers) try {
+			controller.dispose();
+		} catch (error) {
+			failures.push(error);
+		}
+	};
+	const disposeScopeConsumers = (state, failures) => {
+		disposeItemControllers(state.items, failures);
+		const subscriptions = [...state.subscriptions];
+		state.subscriptions.clear();
+		for (const unsubscribe of subscriptions) try {
+			unsubscribe();
+		} catch (error) {
+			failures.push(error);
+		}
+	};
+	const throwCleanupFailures = (failures, message) => {
+		if (failures.length === 1) throw failures[0];
+		if (failures.length) throw new AggregateError(failures, message);
+	};
 	const assertAccess = (definition, requester) => {
 		scheduler.assertActive();
 		const owner = definition.owner;
@@ -5051,6 +5535,19 @@ const createProjectionRuntime = (options) => {
 			subscribe: output.subscribe
 		});
 	};
+	const projectionItems = (projection, requester) => {
+		const output = resolveOutput(projection, requester);
+		if (output.kind !== "collection") throw new TypeError("Projection items require a keyed collection projection.");
+		const registry = requester?.items ?? rootItems;
+		const existing = registry.get(output);
+		if (existing) return existing.items;
+		const controller = createProjectionItems(readableSource(projection, requester), () => {
+			if (requester && !requester.active) throw new ProjectionDisposedError();
+			assertOutput(output);
+		});
+		registry.set(output, controller);
+		return controller.items;
+	};
 	const makeReadable = (projection, selector, equality, requester) => {
 		const source = readableSource(projection, requester);
 		return selector ? createSelectorReadable(source, selector, equality) : createDirectReadable(source);
@@ -5084,13 +5581,7 @@ const createProjectionRuntime = (options) => {
 		scheduler.assertIdle();
 		state.active = false;
 		const failures = [];
-		const subscriptions = [...state.subscriptions];
-		state.subscriptions.clear();
-		for (const unsubscribe of subscriptions) try {
-			unsubscribe();
-		} catch (error) {
-			failures.push(error);
-		}
+		disposeScopeConsumers(state, failures);
 		for (let index = state.materialized.length - 1; index >= 0; index--) {
 			const definition = state.materialized[index];
 			const current = materialized.get(definition);
@@ -5105,14 +5596,15 @@ const createProjectionRuntime = (options) => {
 		}
 		state.materialized.length = 0;
 		scopes.delete(state);
-		if (failures.length) throw failures[0];
+		throwCleanupFailures(failures, "Projection scope cleanup failed.");
 	};
 	const createScope = () => {
 		scheduler.assertIdle();
 		const state = {
 			active: true,
 			materialized: [],
-			subscriptions: /* @__PURE__ */ new Set()
+			subscriptions: /* @__PURE__ */ new Set(),
+			items: /* @__PURE__ */ new Map()
 		};
 		scopes.add(state);
 		const assertActive = () => {
@@ -5184,6 +5676,10 @@ const createProjectionRuntime = (options) => {
 				return readProjection(projection, state);
 			},
 			select: scopeSelect,
+			items: (projection) => {
+				assertActive();
+				return projectionItems(projection, state);
+			},
 			update: scopeUpdate,
 			batch: scopeBatch,
 			dispose: () => disposeScope(state)
@@ -5192,6 +5688,7 @@ const createProjectionRuntime = (options) => {
 	return Object.freeze({
 		read: readProjection,
 		select: selectProjection,
+		items: projectionItems,
 		update,
 		batch,
 		scope: createScope,
@@ -5201,16 +5698,11 @@ const createProjectionRuntime = (options) => {
 			const failures = [];
 			for (const scope of scopes) {
 				scope.active = false;
-				const subscriptions = [...scope.subscriptions];
-				scope.subscriptions.clear();
-				for (const unsubscribe of subscriptions) try {
-					unsubscribe();
-				} catch (error) {
-					failures.push(error);
-				}
+				disposeScopeConsumers(scope, failures);
 				scope.materialized.length = 0;
 			}
 			scopes.clear();
+			disposeItemControllers(rootItems, failures);
 			try {
 				sources.dispose();
 			} catch (error) {
@@ -5221,8 +5713,7 @@ const createProjectionRuntime = (options) => {
 			} catch (error) {
 				failures.push(error);
 			}
-			if (failures.length === 1) throw failures[0];
-			if (failures.length) throw new AggregateError(failures, "Projection cleanup failed.");
+			throwCleanupFailures(failures, "Projection cleanup failed.");
 		}
 	});
 };