doxum 0.1.28 → 0.1.30

package/dist/{transform-B4T3AcJr.js → transform-BQY9I6il.js}

@@ -108,14 +108,17 @@ const defineSource = (source, output) => {
 };
 //#endregion
 //#region core/src/projection/collection/view.ts
-const mapRead = (value) => ({
-	get: (key) => value.get(key),
-	has: (key) => value.has(key),
-	ids: () => Object.freeze([...value.keys()])
-});
+const mapRead = (value) => {
+	let ids;
+	return {
+		get: (key) => value.get(key),
+		has: (key) => value.has(key),
+		ids: () => ids ??= Object.freeze([...value.keys()])
+	};
+};
 /** Immutable map-like view over a CollectionRead. */
-const collectionView = (read) => {
-	const ids = read.ids();
+const collectionView = (read, knownIds) => {
+	const ids = knownIds ?? read.ids();
 	const entries = function* () {
 		for (const key of ids) yield [key, read.get(key)];
 	};
@@ -143,7 +146,7 @@ const snapshotCollectionView = (read) => {
 	const ids = read.ids();
 	const values = /* @__PURE__ */ new Map();
 	for (const key of ids) values.set(key, read.get(key));
-	return collectionView(mapRead(values));
+	return collectionView(mapRead(values), ids);
 };
 //#endregion
 //#region core/src/projection/dependency.ts
@@ -180,29 +183,96 @@ const compileProjectionDependencies = (dependencies, label) => {
 	});
 };
 //#endregion
+//#region core/src/value/array.ts
+/** Allocation-free strict equality for ordered readonly arrays. */
+const sameArray = (left, right) => {
+	if (left === right) return true;
+	if (left.length !== right.length) return false;
+	for (let index = 0; index < left.length; index++) if (left[index] !== right[index]) return false;
+	return true;
+};
+/** Owns an immutable shallow snapshot while reusing arrays that are already frozen. */
+const snapshotArray = (values) => Object.isFrozen(values) ? values : Object.freeze([...values]);
+/** Compares an iterable with an ordered array without materializing the iterable. */
+const iterableMatchesArray = (values, expected) => {
+	let index = 0;
+	for (const value of values) {
+		if (index >= expected.length || value !== expected[index]) return false;
+		index++;
+	}
+	return index === expected.length;
+};
+//#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);
+const transitionContains = (entries, key) => {
+	for (const entry of entries) if (entry.key === key) return true;
+	return false;
 };
-/** 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;
+const transitionSet = (entries) => {
+	if (entries.length <= 4) return void 0;
+	const keys = /* @__PURE__ */ new Set();
+	for (const entry of entries) keys.add(entry.key);
+	return keys;
+};
+const nextExcluding = (iterator, excluded, index) => {
+	while (true) {
+		const next = iterator.next();
+		if (next.done || !(index ? index.has(next.value) : transitionContains(excluded, next.value))) return next;
+	}
+};
+/** Compares common-member order from known transitions without materializing common arrays. */
+const transitionOrderChanged = (before, after, removed, added) => {
+	const removedKeys = transitionSet(removed);
+	const addedKeys = transitionSet(added);
+	const beforeIterator = before[Symbol.iterator]();
+	const afterIterator = after[Symbol.iterator]();
+	while (true) {
+		const left = nextExcluding(beforeIterator, removed, removedKeys);
+		const right = nextExcluding(afterIterator, added, addedKeys);
+		if (left.done || right.done) return left.done !== right.done;
+		if (left.value !== right.value) return true;
+	}
+};
+const nextPresentIn = (iterator, membership) => {
+	while (true) {
+		const next = iterator.next();
+		if (next.done || membership.has(next.value)) return next;
+	}
+};
+/** Compares common-member order between two map snapshots without key snapshots or closures. */
+const mapOrderChanged = (before, after) => {
+	const beforeIterator = before.keys();
+	const afterIterator = after.keys();
+	while (true) {
+		const left = nextPresentIn(beforeIterator, after);
+		const right = nextPresentIn(afterIterator, before);
+		if (left.done || right.done) return left.done !== right.done;
+		if (left.value !== right.value) return true;
+	}
+};
+const sealIncrementalChange = (added, updated, removed, order) => {
+	if (!added.length && !updated.length && !removed.length && !order) 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])
+		added: Object.freeze(added),
+		updated: Object.freeze(updated),
+		removed: Object.freeze(removed),
+		...order ? { order: Object.freeze({
+			before: snapshotArray(order.before),
+			after: snapshotArray(order.after)
 		}) } : {}
 	});
 };
+/** Builds the canonical incremental CollectionChange from already-known net transitions. */
+const createCollectionChange = (input) => {
+	let orderChanged = false;
+	if (input.beforeOrder !== input.afterOrder) if (!input.added.length && !input.removed.length) orderChanged = !sameArray(input.beforeOrder, input.afterOrder);
+	else orderChanged = transitionOrderChanged(input.beforeOrder, input.afterOrder, input.removed, input.added);
+	return sealIncrementalChange(input.added, input.updated, input.removed, orderChanged ? {
+		before: input.beforeOrder,
+		after: input.afterOrder
+	} : void 0);
+};
 /** Exact fallback diff between two published map-like snapshots. */
 const diffCollection = (previous, current, isEqual = Object.is) => {
 	const added = [];
@@ -224,13 +294,10 @@ const diffCollection = (previous, current, isEqual = Object.is) => {
 		key,
 		after
 	});
-	return createCollectionChange({
-		added,
-		updated,
-		removed,
-		beforeOrder: [...previous.keys()],
-		afterOrder: [...current.keys()]
-	});
+	return sealIncrementalChange(added, updated, removed, mapOrderChanged(previous, current) ? {
+		before: Object.freeze([...previous.keys()]),
+		after: Object.freeze([...current.keys()])
+	} : void 0);
 };
 const changedKeys = function* (change) {
 	if (change.kind !== "incremental") throw new TypeError("collectionChange.keys requires an incremental CollectionChange.");
@@ -240,6 +307,18 @@ const changedKeys = function* (change) {
 };
 const collectionChange = Object.freeze({ keys: changedKeys });
 const collectionHasStructuralChange = (change) => change.kind === "reset" || Boolean(change.added.length || change.removed.length || change.order);
+const collectionChangeTouchesKey = (change, key) => {
+	for (const entry of change.added) if (entry.key === key) return true;
+	for (const entry of change.updated) if (entry.key === key) return true;
+	for (const entry of change.removed) if (entry.key === key) return true;
+	return false;
+};
+const collectionChangeIntersects = (change, keys) => {
+	for (const entry of change.added) if (keys.has(entry.key)) return true;
+	for (const entry of change.updated) if (keys.has(entry.key)) return true;
+	for (const entry of change.removed) if (keys.has(entry.key)) return true;
+	return false;
+};
 //#endregion
 //#region core/src/projection/contract.ts
 var ProjectionError = class extends Error {
@@ -619,15 +698,30 @@ const createKeyRelation = () => {
 		}
 	};
 	return {
+		replaceOne(left, right) {
+			const previous = forward.get(left);
+			if (right === void 0) {
+				if (!previous) return false;
+				detach(left, previous);
+				forward.delete(left);
+				return true;
+			}
+			if (previous?.length === 1 && previous[0] === right) return false;
+			if (previous) detach(left, previous);
+			const next = Object.freeze([right]);
+			forward.set(left, next);
+			attach(left, next);
+			return true;
+		},
 		replace(left, right) {
-			const previous = forward.get(left) ?? Object.freeze([]);
-			if (previous.length === right.length && previous.every((key, index) => key === right[index])) return false;
-			detach(left, previous);
+			const previous = forward.get(left);
+			if (previous ? sameArray(previous, right) : right.length === 0) return false;
+			if (previous) detach(left, previous);
 			if (!right.length) {
 				forward.delete(left);
 				return true;
 			}
-			const next = Object.freeze([...right]);
+			const next = snapshotArray(right);
 			forward.set(left, next);
 			attach(left, next);
 			return true;
@@ -718,24 +812,24 @@ const compileKeyedDependencies = (driver, dependencySpecs, label) => {
 		projections: Object.freeze(projections)
 	});
 };
+const selectedKey = (dependency, value, key) => {
+	const result = dependency.select(value, key);
+	assertSynchronous(result);
+	if (result === void 0) return void 0;
+	if (typeof result !== "string") throw new TypeError("Dynamic keyed dependency key must be a string or undefined.");
+	return result;
+};
 const selectedKeys = (dependency, value, key) => {
 	const result = dependency.select(value, key);
 	assertSynchronous(result);
-	if (dependency.kind === "one") {
-		if (result === void 0) return Object.freeze([]);
-		if (typeof result !== "string") throw new TypeError("Dynamic keyed dependency key must be a string or undefined.");
-		return Object.freeze([result]);
-	}
 	if (!Array.isArray(result)) throw new TypeError("Dynamic keyed dependency keys must be an array of strings.");
 	const seen = /* @__PURE__ */ new Set();
-	const keys = [];
 	for (const selected of result) {
 		if (typeof selected !== "string") throw new TypeError("Dynamic keyed dependency keys must contain only strings.");
 		if (seen.has(selected)) throw new TypeError("Dynamic keyed dependency keys must not contain duplicates.");
 		seen.add(selected);
-		keys.push(selected);
 	}
-	return Object.freeze(keys);
+	return result;
 };
 const emptyValues = Object.freeze(Object.create(null));
 const createKeyedDependencyRuntime = (compiled) => {
@@ -772,13 +866,14 @@ const createKeyedDependencyRuntime = (compiled) => {
 				const dependency = state.entry;
 				const source = sources[state.sourceIndex];
 				if (source.kind !== "collection") throw new TypeError("Dynamic keyed dependency resolved to a non-collection source.");
-				const keys = selectedKeys(dependency, driverValue, driverKey);
-				state.relation.replace(driverKey, keys);
 				if (dependency.kind === "one") {
-					const selected = keys[0];
+					const selected = selectedKey(dependency, driverValue, driverKey);
+					state.relation.replaceOne(driverKey, selected);
 					values[dependency.name] = selected === void 0 ? void 0 : source.read.get(selected);
 					continue;
 				}
+				const keys = selectedKeys(dependency, driverValue, driverKey);
+				state.relation.replace(driverKey, keys);
 				const selected = /* @__PURE__ */ new Map();
 				for (const key of keys) if (source.read.has(key)) selected.set(key, source.read.get(key));
 				values[dependency.name] = collectionView(mapRead(selected));
@@ -802,7 +897,9 @@ const createKeyedDependencyRuntime = (compiled) => {
 					all = true;
 					continue;
 				}
-				for (const sourceKey of collectionChange.keys(source.change)) for (const dependent of state.relation.reverse(sourceKey) ?? []) dirty.add(dependent);
+				for (const entry of source.change.added) for (const dependent of state.relation.reverse(entry.key) ?? []) dirty.add(dependent);
+				for (const entry of source.change.updated) for (const dependent of state.relation.reverse(entry.key) ?? []) dirty.add(dependent);
+				for (const entry of source.change.removed) for (const dependent of state.relation.reverse(entry.key) ?? []) dirty.add(dependent);
 			}
 			return all;
 		},
@@ -879,8 +976,7 @@ const createKeyedTransform = (definition) => {
 					if (evaluation.reset) {
 						dependencies.clearBindings();
 						const ids = driver.read.ids();
-						const present = new Set(ids);
-						for (const key of [...states.keys()]) if (!present.has(key)) states.delete(key);
+						for (const key of states.keys()) if (!driver.read.has(key)) states.delete(key);
 						for (const key of ids) project(key);
 						output.output.order(ids.filter((key) => output.next.has(key)));
 						dependencies.remember(evaluation.sources);
@@ -933,6 +1029,6 @@ const createKeyedTransform = (definition) => {
 	return projection;
 };
 //#endregion
-export { defineSource as C, projectionRef as D, producerOf as E, profile as O, defineProcessor as S, ownProjections as T, compileProjectionDependencies as _, createKeyedDependencyRuntime as a, mapRead as b, assertScope as c, ProjectionDisposedError as d, ProjectionError as f, diffCollection as g, createCollectionChange as h, compileKeyedDependencies as i, assertSynchronous as l, collectionHasStructuralChange as m, keyedAbsent as n, outputKind as o, collectionChange as p, assertKeyedProjection as r, createKeyRelation as s, createKeyedTransform as t, createScheduler as u, snapshotDependencyValue as v, isProjection as w, snapshotCollectionView as x, collectionView as y };
+export { ownProjections as A, snapshotDependencyValue as C, defineProcessor as D, snapshotCollectionView as E, projectionRef as M, profile as N, defineSource as O, compileProjectionDependencies as S, mapRead as T, createCollectionChange as _, createKeyedDependencyRuntime as a, sameArray as b, assertScope as c, ProjectionDisposedError as d, ProjectionError as f, collectionHasStructuralChange as g, collectionChangeTouchesKey as h, compileKeyedDependencies as i, producerOf as j, isProjection as k, assertSynchronous as l, collectionChangeIntersects as m, keyedAbsent as n, outputKind as o, collectionChange as p, assertKeyedProjection as r, createKeyRelation as s, createKeyedTransform as t, createScheduler as u, diffCollection as v, collectionView as w, snapshotArray as x, iterableMatchesArray as y };
 
-//# sourceMappingURL=transform-B4T3AcJr.js.map
+//# sourceMappingURL=transform-BQY9I6il.js.map

package/dist/transform-BQY9I6il.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transform-BQY9I6il.js","names":[],"sources":["../core/src/profile.ts","../core/src/projection/definition.ts","../core/src/projection/collection/view.ts","../core/src/projection/dependency.ts","../core/src/value/array.ts","../core/src/projection/collection/change.ts","../core/src/projection/contract.ts","../core/src/projection/graph/scheduler.ts","../core/src/projection/keyed/relation.ts","../core/src/projection/keyed/dependency.ts","../core/src/projection/keyed/transform.ts"],"sourcesContent":["const counters = () => ({\n  projection: {\n    sourceEvents: 0,\n    scheduledNodes: 0,\n    processedNodes: 0,\n    touchedKeys: 0,\n    changedKeys: 0,\n    publishedNodes: 0,\n    flushes: 0,\n  },\n  copy: { structures: 0, treeNodes: 0, shallowRecordItems: 0 },\n  equality: { calls: 0, containers: 0 },\n  recorder: {\n    facts: 0,\n    groups: 0,\n    transitions: 0,\n    absorbed: 0,\n    orderSnapshots: 0,\n    orderCaptures: 0,\n    orderItems: 0,\n    publishedOrderItems: 0,\n    treeNodes: 0,\n    sealed: 0,\n    indexedGroups: 0,\n  },\n  access: { scopes: 0, proxies: 0, snapshots: 0, addresses: 0, resolutions: 0 },\n  address: {\n    schemaSteps: 0,\n    documentSteps: 0,\n    prefixComparisons: 0,\n    segmentsCompared: 0,\n    listIndexes: 0,\n    listItems: 0,\n  },\n  impact: { affectsChecks: 0, indexes: 0 },\n  dependency: { comparisons: 0, segmentsCompared: 0 },\n  collectionIndex: { nodes: 0, builds: 0, builtItems: 0 },\n  collectionView: { mappedItems: 0, idsScanned: 0, arraysCopied: 0 },\n  materialized: { updated: 0, rebuilt: 0, notifications: 0 },\n});\ntype Counters = ReturnType<typeof counters>;\ntype DeepReadonly<T> = { readonly [K in keyof T]: T[K] extends object ? DeepReadonly<T[K]> : T[K] };\nexport type ProfileSnapshot = DeepReadonly<Counters>;\nlet active: Counters | undefined;\nconst freeze = <T extends object>(value: T): DeepReadonly<T> => {\n  Object.values(value).forEach(child => {\n    if (child && typeof child === 'object') freeze(child);\n  });\n  return Object.freeze(value) as DeepReadonly<T>;\n};\nexport const profile = {\n  projection: (key: keyof Counters['projection'], amount = 1) => {\n    if (active) active.projection[key] += amount;\n  },\n  recorder: (key: keyof Counters['recorder'], amount = 1) => {\n    if (active) active.recorder[key] += amount;\n  },\n  access: (key: keyof Counters['access']) => {\n    if (active) active.access[key]++;\n  },\n  copy: {\n    structure: () => {\n      if (active) active.copy.structures++;\n    },\n    treeNode: () => {\n      if (active) active.copy.treeNodes++;\n    },\n    shallowRecord: (items: number) => {\n      if (active) active.copy.shallowRecordItems += items;\n    },\n  },\n  equality: {\n    call: () => {\n      if (active) active.equality.calls++;\n    },\n    container: () => {\n      if (active) active.equality.containers++;\n    },\n  },\n  address: {\n    listIndex: (items: number) => {\n      if (active) {\n        active.address.listIndexes++;\n        active.address.listItems += items;\n      }\n    },\n    schemaStep: () => {\n      if (active) active.address.schemaSteps++;\n    },\n    documentStep: () => {\n      if (active) active.address.documentSteps++;\n    },\n    prefixComparison: () => {\n      if (active) active.address.prefixComparisons++;\n    },\n    segmentCompared: () => {\n      if (active) active.address.segmentsCompared++;\n    },\n  },\n  impact: {\n    index: () => {\n      if (active) active.impact.indexes++;\n    },\n    affects: () => {\n      if (active) active.impact.affectsChecks++;\n    },\n  },\n  dependency: {\n    comparison: () => {\n      if (active) active.dependency.comparisons++;\n    },\n    segmentCompared: () => {\n      if (active) active.dependency.segmentsCompared++;\n    },\n  },\n  collectionIndex: {\n    node: () => {\n      if (active) active.collectionIndex.nodes++;\n    },\n    build: (items: number) => {\n      if (active) {\n        active.collectionIndex.builds++;\n        active.collectionIndex.builtItems += items;\n      }\n    },\n  },\n  collectionView: {\n    mapped: () => {\n      if (active) active.collectionView.mappedItems++;\n    },\n    idsScanned: (amount = 1) => {\n      if (active) active.collectionView.idsScanned += amount;\n    },\n    arrayCopied: () => {\n      if (active) active.collectionView.arraysCopied++;\n    },\n  },\n  materialized: {\n    updated: () => {\n      if (active) active.materialized.updated++;\n    },\n    rebuilt: () => {\n      if (active) active.materialized.rebuilt++;\n    },\n    notification: () => {\n      if (active) active.materialized.notifications++;\n    },\n  },\n};\nexport type ProfileSession = { snapshot(): ProfileSnapshot; stop(): ProfileSnapshot };\nexport const startProfile = (): ProfileSession => {\n  if (active) throw new Error('A document profile session is already active.');\n  const value = counters();\n  active = value;\n  const snapshot = () => freeze(structuredClone(value));\n  return {\n    snapshot,\n    stop: () => {\n      if (active === value) active = undefined;\n      return snapshot();\n    },\n  };\n};\nexport const measureProfile = <T>(run: () => T): { value: T; profile: ProfileSnapshot } => {\n  const session = startProfile();\n  try {\n    return { value: run(), profile: session.stop() };\n  } finally {\n    session.stop();\n  }\n};\n","import type { ReadonlyDocument } from '@/runtime/contract';\nimport type { ObjectSchema } from '@/schema/model';\nimport type { CollectionSelector, ValueSelector } from '@/schema/path';\nimport type {\n  CollectionChange,\n  CollectionDraft,\n  CollectionRead,\n  ExternalCollectionSource,\n  ExternalValueSource,\n  SourceContext,\n} from './contract';\nimport type { Readable } from '@/readable';\n\ndeclare const projectionDefinition: unique symbol;\ndeclare const keyedProjection: unique symbol;\ndeclare const writableInput: unique symbol;\ndeclare const writableCollectionInput: unique symbol;\n\n/** A lazy output reference with no materialized Runtime state. */\nexport type Projection<T> = {\n  readonly [projectionDefinition]: T;\n};\n\n/** A projection whose output is a keyed collection with per-key change semantics. */\nexport type KeyedProjection<K extends string, V> = Projection<ReadonlyMap<K, V>> & {\n  readonly [keyedProjection]: { readonly key: K; readonly value: V };\n};\n\n/** A writable source projection. */\nexport type Input<T> = Projection<T> & { readonly [writableInput]: true };\n\n/** A writable keyed collection source projection. */\nexport type CollectionInput<K extends string, V> = KeyedProjection<K, V> & {\n  readonly [writableCollectionInput]: { readonly key: K; readonly value: V };\n};\n\nexport type CollectionInputDraft<K extends string, V> = {\n  get(key: K): V | undefined;\n  has(key: K): boolean;\n  set(key: K, value: V): void;\n  remove(key: K): void;\n};\n\nexport type ProjectionChange<P> =\n  P extends KeyedProjection<infer K, infer V> ? CollectionChange<K, V> : undefined;\n\nexport type Equality = (a: unknown, b: unknown) => boolean;\n\nexport type OutputDefinition =\n  | {\n      readonly kind: 'value';\n      readonly equality: Equality;\n      readonly path?: readonly string[];\n    }\n  | {\n      readonly kind: 'collection';\n      readonly equality: Equality;\n      readonly path?: readonly string[];\n    };\n\nexport type ValueOutputEvaluation = {\n  readonly kind: 'value';\n  readonly previous: unknown;\n  readonly next: () => unknown;\n  readonly output: { set(value: unknown): void };\n};\n\nexport type CollectionOutputEvaluation = {\n  readonly kind: 'collection';\n  readonly previous: CollectionRead<string, unknown>;\n  readonly next: CollectionRead<string, unknown>;\n  readonly output: CollectionDraft<string, unknown>;\n};\n\nexport type OutputEvaluation = ValueOutputEvaluation | CollectionOutputEvaluation;\n\nexport type ProcessorEvaluation = {\n  readonly reset: boolean;\n  readonly cause: unknown;\n  readonly sources: readonly SourceContext[];\n  readonly outputs: readonly OutputEvaluation[];\n};\n\nexport type ProcessorInstance = {\n  evaluate(input: ProcessorEvaluation): void;\n  release?(): void;\n};\n\nexport type SourceAdapter =\n  | {\n      readonly kind: 'value-input';\n      readonly initial: unknown;\n      readonly equality: Equality;\n    }\n  | {\n      readonly kind: 'collection-input';\n      readonly initial: ReadonlyMap<string, unknown>;\n      readonly equality: Equality;\n    }\n  | {\n      readonly kind: 'readable';\n      readonly readable: Readable<unknown>;\n      readonly equality: Equality;\n    }\n  | {\n      readonly kind: 'external-value';\n      readonly source: ExternalValueSource<unknown>;\n      readonly equality: Equality;\n    }\n  | {\n      readonly kind: 'external-collection';\n      readonly source: ExternalCollectionSource<string, unknown>;\n    }\n  | {\n      readonly kind: 'document';\n      readonly document: ReadonlyDocument<ObjectSchema<object>>;\n      readonly selector: ValueSelector | CollectionSelector;\n    };\n\nexport type SourceDefinition = {\n  readonly kind: 'source';\n  readonly source: SourceAdapter;\n  readonly output: OutputDefinition;\n  owner?: object;\n  materialized?: true;\n};\n\nexport type ProcessorDefinition = {\n  readonly kind: 'processor';\n  readonly dependencies: readonly Projection<unknown>[];\n  readonly outputs: readonly OutputDefinition[];\n  readonly create: () => ProcessorInstance;\n  readonly name?: string;\n  owner?: object;\n  materialized?: true;\n};\n\nexport type ProducerDefinition = SourceDefinition | ProcessorDefinition;\n\nexport type ProjectionRef = {\n  readonly producer: ProducerDefinition;\n  readonly output: number;\n};\n\nconst projections = new WeakMap<object, ProjectionRef>();\n\nconst defineRef = <T>(producer: ProducerDefinition, output: number): Projection<T> => {\n  const handle = Object.freeze({}) as Projection<T>;\n  projections.set(handle, Object.freeze({ producer, output }));\n  return handle;\n};\n\nexport const projectionRef = (projection: Projection<unknown>): ProjectionRef => {\n  const ref = projections.get(projection);\n  if (!ref) throw new TypeError('Unknown projection definition.');\n  return ref;\n};\n\nexport const producerOf = (projection: Projection<unknown>): ProducerDefinition =>\n  projectionRef(projection).producer;\n\n/** Resolves the immutable output description owned by a projection definition. */\nexport const outputDefinitionOf = (projection: Projection<unknown>): OutputDefinition => {\n  const ref = projectionRef(projection);\n  const producer = ref.producer;\n  const output = producer.kind === 'source' ? producer.output : producer.outputs[ref.output];\n  if (!output) throw new TypeError('Projection output does not exist.');\n  return output;\n};\n\nexport const isProjection = (value: unknown): value is Projection<unknown> =>\n  value !== null && typeof value === 'object' && projections.has(value);\n\nexport const ownProjections = (\n  projections: readonly Projection<unknown>[],\n  owner: object\n): void => {\n  const producers = new Set(projections.map(producerOf));\n  for (const producer of producers) {\n    if (producer.owner !== undefined && producer.owner !== owner)\n      throw new TypeError('Projection producer already belongs to another scope.');\n    if (producer.owner === undefined && producer.materialized)\n      throw new TypeError('A materialized root projection cannot become scope-owned.');\n    if (producer.kind !== 'processor') continue;\n    for (const dependency of producer.dependencies) {\n      const dependencyOwner = producerOf(dependency).owner;\n      if (dependencyOwner !== undefined && dependencyOwner !== owner)\n        throw new TypeError('A scope cannot depend on another scope.');\n    }\n  }\n  for (const producer of producers) producer.owner = owner;\n};\n\nconst freezeOutput = (output: OutputDefinition): OutputDefinition =>\n  Object.freeze({\n    kind: output.kind,\n    equality: output.equality,\n    ...(output.path ? { path: Object.freeze([...output.path]) } : {}),\n  });\n\nexport const defineProcessor = (definition: {\n  readonly dependencies: readonly Projection<unknown>[];\n  readonly outputs: readonly OutputDefinition[];\n  readonly create: () => ProcessorInstance;\n  readonly name?: string;\n}): readonly Projection<unknown>[] => {\n  if (!Array.isArray(definition.dependencies))\n    throw new TypeError('Projection dependencies must be an array.');\n  definition.dependencies.forEach(projectionRef);\n  if (!definition.outputs.length) throw new TypeError('Projection processor requires an output.');\n  const producer: ProcessorDefinition = {\n    kind: 'processor',\n    dependencies: Object.freeze([...definition.dependencies]),\n    outputs: Object.freeze(definition.outputs.map(freezeOutput)),\n    create: definition.create,\n    ...(definition.name ? { name: definition.name } : {}),\n  };\n  return Object.freeze(producer.outputs.map((_, output) => defineRef<unknown>(producer, output)));\n};\n\nexport const defineSource = <T>(source: SourceAdapter, output: OutputDefinition): Projection<T> => {\n  const producer: SourceDefinition = {\n    kind: 'source',\n    source,\n    output: freezeOutput(output),\n  };\n  return defineRef<T>(producer, 0);\n};\n","import type { CollectionRead } from '@/projection/contract';\n\nexport const mapRead = <K extends string, V>(value: ReadonlyMap<K, V>): CollectionRead<K, V> => {\n  let ids: readonly K[] | undefined;\n  return {\n    get: key => value.get(key),\n    has: key => value.has(key),\n    ids: () => (ids ??= Object.freeze([...value.keys()])),\n  };\n};\n\n/** Immutable map-like view over a CollectionRead. */\nexport const collectionView = <K extends string, V>(\n  read: CollectionRead<K, V>,\n  knownIds?: readonly K[]\n): ReadonlyMap<K, V> => {\n  const ids = knownIds ?? read.ids();\n  const entries = function* (): IterableIterator<[K, V]> {\n    for (const key of ids) yield [key, read.get(key) as V];\n  };\n  const values = function* (): IterableIterator<V> {\n    for (const key of ids) yield read.get(key) as V;\n  };\n  const view: ReadonlyMap<K, V> = {\n    get: key => read.get(key),\n    has: key => read.has(key),\n    get size() {\n      return ids.length;\n    },\n    keys: () => ids[Symbol.iterator](),\n    values,\n    entries,\n    forEach: (callback, thisArg) => {\n      for (const key of ids) callback.call(thisArg, read.get(key) as V, key, view);\n    },\n    [Symbol.iterator]: entries,\n  };\n  return Object.freeze(view);\n};\n\n/** Eager durable view used when a processor result may retain its dependency value. */\nexport const snapshotCollectionView = <K extends string, V>(\n  read: CollectionRead<K, V>\n): ReadonlyMap<K, V> => {\n  const ids = read.ids();\n  const values = new Map<K, V>();\n  for (const key of ids) values.set(key, read.get(key) as V);\n  return collectionView(mapRead(values), ids);\n};\n","import { isPlainObject } from '@/value/record';\nimport { snapshotCollectionView } from '@/projection/collection/view';\nimport type { SourceContext } from './contract';\nimport { isProjection, projectionRef, type Projection } from './definition';\n\nexport type CompiledProjectionDependencies = {\n  readonly names: readonly string[];\n  readonly projections: readonly Projection<unknown>[];\n};\n\nexport type NamedDependencyEntry = {\n  readonly name: string;\n  readonly value: unknown;\n};\n\n/** Owns validation of the shared named dependency object shape. */\nexport const readNamedDependencyEntries = (\n  dependencies: unknown,\n  label: string\n): readonly NamedDependencyEntry[] => {\n  if (!isPlainObject(dependencies) || isProjection(dependencies))\n    throw new TypeError(`${label} dependencies must be a plain object.`);\n  const entries: NamedDependencyEntry[] = [];\n  for (const name of Reflect.ownKeys(dependencies)) {\n    if (typeof name !== 'string') throw new TypeError(`${label} dependency names must be strings.`);\n    const descriptor = Object.getOwnPropertyDescriptor(dependencies, name);\n    if (!descriptor?.enumerable || !('value' in descriptor))\n      throw new TypeError(`${label} dependencies must be enumerable data properties.`);\n    entries.push(Object.freeze({ name, value: descriptor.value }));\n  }\n  return Object.freeze(entries);\n};\n\n/** Creates the durable dependency value exposed to pure derive callbacks. */\nexport const snapshotDependencyValue = (source: SourceContext): unknown =>\n  source.kind === 'value' ? source.value : snapshotCollectionView(source.read);\n\n/** Compiles the shared named Projection dependency declaration contract. */\nexport const compileProjectionDependencies = (\n  dependencies: unknown,\n  label: string\n): CompiledProjectionDependencies => {\n  const names: string[] = [];\n  const projections: Projection<unknown>[] = [];\n  for (const { name, value } of readNamedDependencyEntries(dependencies, label)) {\n    const projection = value as Projection<unknown>;\n    projectionRef(projection);\n    names.push(name);\n    projections.push(projection);\n  }\n  return Object.freeze({\n    names: Object.freeze(names),\n    projections: Object.freeze(projections),\n  });\n};\n","/** Allocation-free strict equality for ordered readonly arrays. */\nexport const sameArray = <T>(left: readonly T[], right: readonly T[]): boolean => {\n  if (left === right) return true;\n  if (left.length !== right.length) return false;\n  for (let index = 0; index < left.length; index++) if (left[index] !== right[index]) return false;\n  return true;\n};\n\n/** Owns an immutable shallow snapshot while reusing arrays that are already frozen. */\nexport const snapshotArray = <T>(values: readonly T[]): readonly T[] =>\n  Object.isFrozen(values) ? values : Object.freeze([...values]);\n\n/** Compares an iterable with an ordered array without materializing the iterable. */\nexport const iterableMatchesArray = <T>(values: Iterable<T>, expected: readonly T[]): boolean => {\n  let index = 0;\n  for (const value of values) {\n    if (index >= expected.length || value !== expected[index]) return false;\n    index++;\n  }\n  return index === expected.length;\n};\n","import type { CollectionChange } from '@/projection/contract';\nimport { sameArray, snapshotArray } from '@/value/array';\n\ntype Added<K extends string, V> = { readonly key: K; readonly after: V };\ntype Updated<K extends string, V> = {\n  readonly key: K;\n  readonly before: V;\n  readonly after: V;\n};\ntype Removed<K extends string, V> = { readonly key: K; readonly before: V };\n\nconst transitionContains = <K extends string>(\n  entries: readonly { readonly key: K }[],\n  key: K\n): boolean => {\n  for (const entry of entries) if (entry.key === key) return true;\n  return false;\n};\n\nconst transitionSet = <K extends string>(\n  entries: readonly { readonly key: K }[]\n): ReadonlySet<K> | undefined => {\n  // Small net membership changes are overwhelmingly common. Linear lookup avoids\n  // allocating a Set while keeping large batches O(n).\n  if (entries.length <= 4) return undefined;\n  const keys = new Set<K>();\n  for (const entry of entries) keys.add(entry.key);\n  return keys;\n};\n\nconst nextExcluding = <K extends string>(\n  iterator: Iterator<K>,\n  excluded: readonly { readonly key: K }[],\n  index: ReadonlySet<K> | undefined\n): IteratorResult<K> => {\n  while (true) {\n    const next = iterator.next();\n    if (next.done || !(index ? index.has(next.value) : transitionContains(excluded, next.value)))\n      return next;\n  }\n};\n\n/** Compares common-member order from known transitions without materializing common arrays. */\nconst transitionOrderChanged = <K extends string>(\n  before: Iterable<K>,\n  after: Iterable<K>,\n  removed: readonly { readonly key: K }[],\n  added: readonly { readonly key: K }[]\n): boolean => {\n  const removedKeys = transitionSet(removed);\n  const addedKeys = transitionSet(added);\n  const beforeIterator = before[Symbol.iterator]();\n  const afterIterator = after[Symbol.iterator]();\n  while (true) {\n    const left = nextExcluding(beforeIterator, removed, removedKeys);\n    const right = nextExcluding(afterIterator, added, addedKeys);\n    if (left.done || right.done) return left.done !== right.done;\n    if (left.value !== right.value) return true;\n  }\n};\n\nconst nextPresentIn = <K, V>(\n  iterator: Iterator<K>,\n  membership: ReadonlyMap<K, V>\n): IteratorResult<K> => {\n  while (true) {\n    const next = iterator.next();\n    if (next.done || membership.has(next.value)) return next;\n  }\n};\n\n/** Compares common-member order between two map snapshots without key snapshots or closures. */\nconst mapOrderChanged = <K, V>(before: ReadonlyMap<K, V>, after: ReadonlyMap<K, V>): boolean => {\n  const beforeIterator = before.keys();\n  const afterIterator = after.keys();\n  while (true) {\n    const left = nextPresentIn(beforeIterator, after);\n    const right = nextPresentIn(afterIterator, before);\n    if (left.done || right.done) return left.done !== right.done;\n    if (left.value !== right.value) return true;\n  }\n};\n\nconst sealIncrementalChange = <K extends string, V>(\n  added: Added<K, V>[],\n  updated: Updated<K, V>[],\n  removed: Removed<K, V>[],\n  order?: { readonly before: readonly K[]; readonly after: readonly K[] }\n): CollectionChange<K, V> | undefined => {\n  if (!added.length && !updated.length && !removed.length && !order) return undefined;\n  return Object.freeze({\n    kind: 'incremental' as const,\n    added: Object.freeze(added),\n    updated: Object.freeze(updated),\n    removed: Object.freeze(removed),\n    ...(order\n      ? {\n          order: Object.freeze({\n            before: snapshotArray(order.before),\n            after: snapshotArray(order.after),\n          }),\n        }\n      : {}),\n  });\n};\n\n/** Builds the canonical incremental CollectionChange from already-known net transitions. */\nexport const createCollectionChange = <K extends string, V>(input: {\n  readonly added: Added<K, V>[];\n  readonly updated: Updated<K, V>[];\n  readonly removed: Removed<K, V>[];\n  readonly beforeOrder: readonly K[];\n  readonly afterOrder: readonly K[];\n}): CollectionChange<K, V> | undefined => {\n  let orderChanged = false;\n  if (input.beforeOrder !== input.afterOrder) {\n    if (!input.added.length && !input.removed.length)\n      orderChanged = !sameArray(input.beforeOrder, input.afterOrder);\n    else\n      orderChanged = transitionOrderChanged(\n        input.beforeOrder,\n        input.afterOrder,\n        input.removed,\n        input.added\n      );\n  }\n  return sealIncrementalChange(\n    input.added,\n    input.updated,\n    input.removed,\n    orderChanged ? { before: input.beforeOrder, after: input.afterOrder } : undefined\n  );\n};\n\n/** Exact fallback diff between two published map-like snapshots. */\nexport const diffCollection = <K extends string, V>(\n  previous: ReadonlyMap<K, V>,\n  current: ReadonlyMap<K, V>,\n  isEqual: (previous: V, next: V) => boolean = Object.is\n): CollectionChange<K, V> | undefined => {\n  const added: Added<K, V>[] = [];\n  const updated: Updated<K, V>[] = [];\n  const removed: Removed<K, V>[] = [];\n  for (const [key, before] of previous) {\n    if (!current.has(key)) removed.push({ key, before });\n    else {\n      const after = current.get(key) as V;\n      if (!isEqual(before, after)) updated.push({ key, before, after });\n    }\n  }\n  for (const [key, after] of current) if (!previous.has(key)) added.push({ key, after });\n  const orderChanged = mapOrderChanged(previous, current);\n  return sealIncrementalChange(\n    added,\n    updated,\n    removed,\n    orderChanged\n      ? {\n          before: Object.freeze([...previous.keys()]),\n          after: Object.freeze([...current.keys()]),\n        }\n      : undefined\n  );\n};\n\nconst changedKeys = function* <K extends string, V>(\n  change: Extract<CollectionChange<K, V>, { readonly kind: 'incremental' }>\n): IterableIterator<K> {\n  if ((change as CollectionChange<K, V>).kind !== 'incremental')\n    throw new TypeError('collectionChange.keys requires an incremental CollectionChange.');\n  for (const entry of change.added) yield entry.key;\n  for (const entry of change.updated) yield entry.key;\n  for (const entry of change.removed) yield entry.key;\n};\n\nexport const collectionChange: {\n  readonly keys: <K extends string, V>(\n    change: Extract<CollectionChange<K, V>, { readonly kind: 'incremental' }>\n  ) => Iterable<K>;\n} = Object.freeze({ keys: changedKeys });\n\nexport const collectionHasStructuralChange = <K extends string, V>(\n  change: CollectionChange<K, V>\n): boolean =>\n  change.kind === 'reset' || Boolean(change.added.length || change.removed.length || change.order);\n\nexport const collectionChangeTouchesKey = <K extends string, V>(\n  change: Extract<CollectionChange<K, V>, { readonly kind: 'incremental' }>,\n  key: K\n): boolean => {\n  for (const entry of change.added) if (entry.key === key) return true;\n  for (const entry of change.updated) if (entry.key === key) return true;\n  for (const entry of change.removed) if (entry.key === key) return true;\n  return false;\n};\n\nexport const collectionChangeIntersects = <K extends string, V>(\n  change: Extract<CollectionChange<K, V>, { readonly kind: 'incremental' }>,\n  keys: ReadonlySet<K>\n): boolean => {\n  for (const entry of change.added) if (keys.has(entry.key)) return true;\n  for (const entry of change.updated) if (keys.has(entry.key)) return true;\n  for (const entry of change.removed) if (keys.has(entry.key)) return true;\n  return false;\n};\n","import type { CollectionImpact } from '@/impact';\nimport type { Unsubscribe } from '@/runtime/contract';\n\n/** Scheduler-owned metadata for one Runtime batch. */\nexport type BatchContext = {\n  readonly id: number;\n  readonly cause?: unknown;\n};\n\n/** The one processor-facing collection transition protocol. */\nexport type CollectionChange<K extends string, V> =\n  | { readonly kind: 'reset' }\n  | {\n      readonly kind: 'incremental';\n      readonly added: readonly { readonly key: K; readonly after: V }[];\n      readonly updated: readonly {\n        readonly key: K;\n        readonly before: V;\n        readonly after: V;\n      }[];\n      readonly removed: readonly { readonly key: K; readonly before: V }[];\n      readonly order?: {\n        readonly before: readonly K[];\n        readonly after: readonly K[];\n      };\n    };\n\nexport type ValueContext<T> = {\n  readonly kind: 'value';\n  readonly value: T;\n  readonly revision: number;\n  readonly reset: boolean;\n  readonly cause?: unknown;\n};\n\nexport type CollectionRead<K extends string, V> = {\n  get(key: K): V | undefined;\n  has(key: K): boolean;\n  ids(): readonly K[];\n};\n\nexport type ExternalCollectionRead<K extends string, V> = {\n  readonly get: (key: K) => V | undefined;\n  readonly has: (key: K) => boolean;\n  readonly ids: () => readonly K[];\n};\n\nexport type CollectionContext<K extends string, V> = {\n  readonly kind: 'collection';\n  readonly read: CollectionRead<K, V>;\n  readonly change: CollectionChange<K, V> | undefined;\n  readonly revision: number;\n  readonly reset: boolean;\n  readonly cause?: unknown;\n};\n\nexport type SourceContext = ValueContext<unknown> | CollectionContext<string, unknown>;\n\nexport type ExternalValueSource<T> = {\n  readonly kind: 'value';\n  current(): T;\n  revision(): number;\n  subscribe(listener: (event: ExternalValueEvent<T>) => void): Unsubscribe;\n};\n\nexport type ExternalCollectionSource<K extends string, V> = {\n  readonly kind: 'collection';\n  current(): ExternalCollectionRead<K, V>;\n  revision(): number;\n  subscribe(listener: (event: ExternalCollectionEvent<K, V>) => void): Unsubscribe;\n};\n\nexport type ExternalValueEvent<T> = {\n  readonly value: T;\n  readonly revision: number;\n  readonly reset?: boolean;\n  readonly cause?: unknown;\n};\n\nexport type ExternalCollectionEvent<K extends string, V> = {\n  /** Stable read from the source before this event or external batch. */\n  readonly previous: ExternalCollectionRead<K, V>;\n  readonly revision: number;\n  /** Optional document-style hint; the adapter resolves the canonical change. */\n  readonly impact?: CollectionImpact<K>;\n  readonly cause?: unknown;\n};\n\nexport type CollectionDraft<K extends string, V> = {\n  set(key: K, value: V): void;\n  remove(key: K): void;\n  order(ids: readonly K[]): void;\n};\n\nexport class ProjectionError extends Error {\n  readonly cause: unknown;\n\n  constructor(\n    readonly phase: 'processor' | 'listener' | 'source' | 'blocked',\n    cause: unknown\n  ) {\n    super(`Projection ${phase} failed.`, { cause });\n    this.name = 'ProjectionError';\n    this.cause = cause;\n  }\n}\n\nexport class ProjectionDisposedError extends Error {\n  constructor() {\n    super('Projection has been disposed.');\n    this.name = 'ProjectionDisposedError';\n  }\n}\n","import { profile } from '@/profile';\nimport type { ObserverError, Unsubscribe } from '@/runtime/contract';\nimport type { BatchContext, CollectionChange, SourceContext } from '@/projection/contract';\nimport { ProjectionDisposedError, ProjectionError } from '@/projection/contract';\n\ntype BatchOptions = { readonly cause?: unknown };\n\ntype ProducerBase = {\n  readonly name: string;\n  readonly outputs: readonly OutputRecord[];\n  fault: ProjectionError | undefined;\n  disposed: boolean;\n  clear(): void;\n  release(): void;\n};\n\nexport type OutputListener = (change?: CollectionChange<string, unknown>) => void;\n\nexport type OutputRecord = {\n  readonly kind: 'value' | 'collection';\n  readonly owner: ProducerRecord;\n  context(active: () => boolean): SourceContext;\n  current(): unknown;\n  revision(): number;\n  reset(): boolean;\n  subscribe(listener: OutputListener): Unsubscribe;\n  emit(call: (listener: OutputListener, change?: CollectionChange<string, unknown>) => void): void;\n  hasConsumers(): boolean;\n  forEachConsumer(run: (consumer: ProcessorRecord) => void): void;\n  attachConsumer(consumer: ProcessorRecord): void;\n  detachConsumer(consumer: ProcessorRecord): void;\n  clear(): void;\n  release(): void;\n};\n\nexport type SourceBoundaryRecord = ProducerBase & {\n  readonly kind: 'source';\n  readonly outputs: readonly [OutputRecord];\n  pendingCause(): unknown;\n  recovering(): boolean;\n  prepare(cause: unknown): { readonly changed: boolean; readonly force: boolean };\n  publish(): void;\n};\n\nexport type ProcessorRecord = ProducerBase & {\n  readonly kind: 'processor';\n  readonly dependencies: readonly OutputRecord[];\n  readonly order: number;\n  evaluate(reset: boolean, cause: unknown, recreate?: boolean): readonly OutputRecord[];\n  publish(): void;\n};\n\nexport type ProducerRecord = SourceBoundaryRecord | ProcessorRecord;\n\nexport const createScheduler = (onError: (error: ProjectionError) => void) => {\n  let disposed = false;\n  let depth = 0;\n  let batchSequence = 0;\n  let activeBatch: BatchContext | undefined;\n  let phase: 'idle' | 'compute' | 'notify' = 'idle';\n  let sequence = 0;\n  const sources = new Set<SourceBoundaryRecord>();\n  const processors = new Set<ProcessorRecord>();\n  const pendingSources = new Set<SourceBoundaryRecord>();\n  const heap: ProcessorRecord[] = [];\n  const queued = new Set<ProcessorRecord>();\n  const completed = new Set<ProcessorRecord>();\n  const emissions = new Set<OutputRecord>();\n  const errors: ProjectionError[] = [];\n  let reportingFailures: unknown[] = [];\n  const guards = new Set<(locked: boolean) => void>();\n\n  const assertActive = () => {\n    if (disposed) throw new ProjectionDisposedError();\n  };\n  const assertIdle = () => {\n    assertActive();\n    if (phase !== 'idle')\n      throw new Error('Projection cannot be re-entered during processing or notification.');\n  };\n  const lock = (value: boolean) => guards.forEach(guard => guard(value));\n\n  const enqueue = (processor: ProcessorRecord) => {\n    if (processor.disposed || queued.has(processor)) return;\n    queued.add(processor);\n    profile.projection('scheduledNodes');\n    let index = heap.length;\n    heap.push(processor);\n    while (index > 0) {\n      const parent = (index - 1) >> 1;\n      if (heap[parent].order < processor.order) break;\n      heap[index] = heap[parent];\n      index = parent;\n    }\n    heap[index] = processor;\n  };\n\n  const pop = (): ProcessorRecord => {\n    const first = heap[0];\n    const last = heap.pop()!;\n    if (heap.length) {\n      let index = 0;\n      while (index * 2 + 1 < heap.length) {\n        let child = index * 2 + 1;\n        if (child + 1 < heap.length && heap[child + 1].order < heap[child].order) child++;\n        if (last.order < heap[child].order) break;\n        heap[index] = heap[child];\n        index = child;\n      }\n      heap[index] = last;\n    }\n    return first;\n  };\n\n  const errorFor = (\n    producer: ProducerRecord,\n    cause: unknown,\n    kind: ProjectionError['phase'] = producer.kind === 'source' ? 'source' : 'processor'\n  ) => new ProjectionError(kind, cause);\n\n  const capture = (source: SourceBoundaryRecord) => {\n    if (disposed) return;\n    if (phase !== 'idle') {\n      source.fault = errorFor(\n        source,\n        new Error('Source changed while projection was running.'),\n        'source'\n      );\n      errors.push(source.fault);\n      throw source.fault;\n    }\n    pendingSources.add(source);\n    profile.projection('sourceEvents');\n    if (source.fault) errors.push(source.fault);\n  };\n\n  const settleCause = (): unknown => {\n    if (activeBatch?.cause !== undefined) return activeBatch.cause;\n    for (const source of pendingSources) {\n      const cause = source.pendingCause();\n      if (cause !== undefined) return cause;\n    }\n    return undefined;\n  };\n\n  const settle = () => {\n    if (disposed || depth || phase !== 'idle') return;\n    phase = 'compute';\n    lock(true);\n    const cause = settleCause();\n    try {\n      for (const source of pendingSources) {\n        if (source.disposed) continue;\n        const wasFaulted = source.fault !== undefined;\n        let changed = false;\n        let force = false;\n        if (!source.fault || source.recovering()) {\n          try {\n            const prepared = source.prepare(cause);\n            changed = prepared.changed;\n            force = prepared.force;\n            source.fault = undefined;\n          } catch (failure) {\n            source.fault = errorFor(source, failure, 'source');\n            errors.push(source.fault);\n          }\n        }\n        const recovered = wasFaulted && !source.fault;\n        if (changed) source.publish();\n        if (source.fault || changed || force || recovered) {\n          const output = source.outputs[0];\n          emissions.add(output);\n          output.forEachConsumer(enqueue);\n        }\n      }\n\n      while (heap.length) {\n        const processor = pop();\n        if (processor.disposed) continue;\n        const wasFaulted = processor.fault !== undefined;\n        profile.projection('processedNodes');\n        let changedOutputs: readonly OutputRecord[] = Object.freeze([]);\n        const blocked = processor.dependencies.find(\n          output => output.owner.fault || output.owner.disposed\n        );\n        if (blocked) {\n          processor.fault = errorFor(\n            processor,\n            blocked.owner.fault ?? new ProjectionDisposedError(),\n            'blocked'\n          );\n        } else {\n          const reset = wasFaulted || processor.dependencies.some(output => output.reset());\n          try {\n            changedOutputs = processor.evaluate(reset, cause, wasFaulted);\n            const dependencyFailure = processor.dependencies.find(output => output.owner.fault)\n              ?.owner.fault;\n            if (dependencyFailure) throw dependencyFailure;\n            processor.fault = undefined;\n          } catch (failure) {\n            const error = errorFor(processor, failure);\n            processor.fault = error;\n            if (!reset) {\n              try {\n                changedOutputs = processor.evaluate(true, cause, true);\n                const dependencyFailure = processor.dependencies.find(output => output.owner.fault)\n                  ?.owner.fault;\n                if (dependencyFailure) throw dependencyFailure;\n                processor.fault = undefined;\n                errors.push(error);\n              } catch (rebuildFailure) {\n                processor.fault = errorFor(processor, rebuildFailure);\n                errors.push(processor.fault);\n              }\n            } else errors.push(error);\n          }\n        }\n        completed.add(processor);\n        const recovered = wasFaulted && !processor.fault;\n        if (processor.fault) {\n          processor.outputs.forEach(output => {\n            emissions.add(output);\n            output.forEachConsumer(enqueue);\n          });\n        } else {\n          if (changedOutputs.length) {\n            processor.publish();\n            changedOutputs.forEach(output => emissions.add(output));\n          }\n          const propagated = recovered ? processor.outputs : changedOutputs;\n          propagated.forEach(output => output.forEachConsumer(enqueue));\n        }\n        if (processor.fault || changedOutputs.length) {\n          profile.projection('publishedNodes');\n        }\n      }\n    } finally {\n      lock(false);\n      phase = 'idle';\n    }\n  };\n\n  const flush = (): readonly ObserverError[] => {\n    if (disposed || depth) return [];\n    if (pendingSources.size || completed.size) profile.projection('flushes');\n    phase = 'notify';\n    lock(true);\n    const reportFailures: unknown[] = [];\n    try {\n      emissions.forEach(output =>\n        output.emit((listener, change) => {\n          try {\n            listener(change);\n          } catch (cause) {\n            errors.push(errorFor(output.owner, cause, 'listener'));\n          }\n        })\n      );\n      for (const error of errors.slice()) {\n        try {\n          onError(error);\n        } catch (cause) {\n          reportFailures.push(cause);\n        }\n      }\n      return Object.freeze([\n        ...errors.map(error =>\n          Object.freeze({\n            phase: error.phase === 'listener' ? ('listener' as const) : ('processor' as const),\n            error,\n          })\n        ),\n        ...reportFailures.map(error => Object.freeze({ phase: 'listener' as const, error })),\n      ]);\n    } finally {\n      pendingSources.forEach(source => source.clear());\n      completed.forEach(processor => processor.clear());\n      pendingSources.clear();\n      queued.clear();\n      completed.clear();\n      emissions.clear();\n      errors.length = 0;\n      reportingFailures = reportFailures;\n      lock(false);\n      phase = 'idle';\n    }\n  };\n\n  const run = () => {\n    settle();\n    const result = flush();\n    const failures = reportingFailures;\n    reportingFailures = [];\n    if (failures.length) throw new AggregateError(failures, 'Projection error reporter failed.');\n    return result;\n  };\n\n  const batch = <T>(callback: () => T, options?: BatchOptions): T => {\n    assertIdle();\n    const outer = depth === 0;\n    if (outer)\n      activeBatch = Object.freeze({\n        id: ++batchSequence,\n        ...(options?.cause === undefined ? {} : { cause: options.cause }),\n      });\n    depth++;\n    let failed = false;\n    try {\n      const value = callback();\n      assertSynchronous(value);\n      return value;\n    } catch (error) {\n      failed = true;\n      throw error;\n    } finally {\n      depth--;\n      if (!depth) {\n        try {\n          if (failed) {\n            try {\n              run();\n            } catch {\n              /* The original application error retains priority. */\n            }\n          } else run();\n        } finally {\n          activeBatch = undefined;\n        }\n      }\n    }\n  };\n\n  const releaseProducer = (producer: ProducerRecord) => {\n    assertIdle();\n    if (producer.outputs.some(output => output.hasConsumers()))\n      throw new Error('Projection producer is still used by another processor.');\n    producer.disposed = true;\n    if (producer.kind === 'processor') {\n      producer.dependencies.forEach(output => output.detachConsumer(producer));\n      processors.delete(producer);\n      queued.delete(producer);\n      completed.delete(producer);\n    } else {\n      sources.delete(producer);\n      pendingSources.delete(producer);\n    }\n    const failures: unknown[] = [];\n    try {\n      producer.release();\n    } catch (error) {\n      failures.push(error);\n    }\n    try {\n      producer.clear();\n    } catch (error) {\n      failures.push(error);\n    }\n    producer.outputs.forEach(output => emissions.delete(output));\n    if (failures.length) throw failures[0];\n  };\n\n  return {\n    assertActive,\n    assertIdle,\n    capture,\n    settle,\n    flush,\n    run,\n    registerGuard(guard: (locked: boolean) => void): Unsubscribe {\n      assertActive();\n      guards.add(guard);\n      let registered = true;\n      return () => {\n        if (!registered) return;\n        registered = false;\n        guards.delete(guard);\n      };\n    },\n    get active() {\n      return !disposed;\n    },\n    addSource(source: SourceBoundaryRecord) {\n      assertIdle();\n      sources.add(source);\n    },\n    addProcessor(processor: ProcessorRecord) {\n      assertIdle();\n      processors.add(processor);\n      processor.dependencies.forEach(output => output.attachConsumer(processor));\n    },\n    releaseProducer,\n    order: () => sequence++,\n    initialize<T>(callback: () => T): T {\n      assertIdle();\n      phase = 'compute';\n      lock(true);\n      try {\n        return callback();\n      } finally {\n        lock(false);\n        phase = 'idle';\n      }\n    },\n    batch,\n    batchContext: () => activeBatch,\n    dispose() {\n      if (disposed) return;\n      assertIdle();\n      disposed = true;\n      const failures: unknown[] = [];\n      processors.forEach(processor => {\n        processor.disposed = true;\n        try {\n          processor.release();\n        } catch (error) {\n          failures.push(error);\n        }\n      });\n      sources.forEach(source => {\n        source.disposed = true;\n        try {\n          source.release();\n        } catch (error) {\n          failures.push(error);\n        }\n      });\n      processors.clear();\n      sources.clear();\n      pendingSources.clear();\n      heap.length = 0;\n      queued.clear();\n      completed.clear();\n      emissions.clear();\n      guards.clear();\n      errors.length = 0;\n      reportingFailures = [];\n      if (failures.length) throw new AggregateError(failures, 'Projection cleanup failed.');\n    },\n  };\n};\n\nexport type Scheduler = ReturnType<typeof createScheduler>;\n\nexport const assertSynchronous = (value: unknown): void => {\n  if (\n    value != null &&\n    (typeof value === 'object' || typeof value === 'function') &&\n    'then' in value &&\n    typeof value.then === 'function'\n  )\n    throw new TypeError('Projection callbacks must be synchronous.');\n};\n\nexport const assertScope = (active: () => boolean) => {\n  if (!active()) throw new Error('Projection reader or writer is no longer active.');\n};\n","import { sameArray, snapshotArray } from '@/value/array';\n\nexport type KeyRelation = {\n  replaceOne(left: string, right: string | undefined): boolean;\n  replace(left: string, right: readonly string[]): boolean;\n  delete(left: string): boolean;\n  forward(left: string): readonly string[] | undefined;\n  reverse(right: string): ReadonlySet<string> | undefined;\n  lefts(): IterableIterator<string>;\n  rights(): IterableIterator<string>;\n  clear(): void;\n};\n\n/** Runtime-local domain-neutral many-to-many keyed relation. */\nexport const createKeyRelation = (): KeyRelation => {\n  const forward = new Map<string, readonly string[]>();\n  const reverse = new Map<string, Set<string>>();\n\n  const detach = (left: string, right: readonly string[]): void => {\n    for (const key of right) {\n      const dependents = reverse.get(key);\n      dependents?.delete(left);\n      if (dependents?.size === 0) reverse.delete(key);\n    }\n  };\n\n  const attach = (left: string, right: readonly string[]): void => {\n    for (const key of right) {\n      const dependents = reverse.get(key);\n      if (dependents) dependents.add(left);\n      else reverse.set(key, new Set([left]));\n    }\n  };\n\n  return {\n    replaceOne(left, right) {\n      const previous = forward.get(left);\n      if (right === undefined) {\n        if (!previous) return false;\n        detach(left, previous);\n        forward.delete(left);\n        return true;\n      }\n      if (previous?.length === 1 && previous[0] === right) return false;\n      if (previous) detach(left, previous);\n      const next = Object.freeze([right]);\n      forward.set(left, next);\n      attach(left, next);\n      return true;\n    },\n    replace(left, right) {\n      const previous = forward.get(left);\n      if (previous ? sameArray(previous, right) : right.length === 0) return false;\n      if (previous) detach(left, previous);\n      if (!right.length) {\n        forward.delete(left);\n        return true;\n      }\n      const next = snapshotArray(right);\n      forward.set(left, next);\n      attach(left, next);\n      return true;\n    },\n    delete(left) {\n      const previous = forward.get(left);\n      if (!previous) return false;\n      detach(left, previous);\n      forward.delete(left);\n      return true;\n    },\n    forward: left => forward.get(left),\n    reverse: right => reverse.get(right),\n    lefts: () => forward.keys(),\n    rights: () => reverse.keys(),\n    clear() {\n      forward.clear();\n      reverse.clear();\n    },\n  };\n};\n","import type { Synchronous } from '@/runtime/contract';\nimport { isPlainObject } from '@/value/record';\nimport { collectionView, mapRead } from '@/projection/collection/view';\nimport type { SourceContext } from '@/projection/contract';\nimport { readNamedDependencyEntries, snapshotDependencyValue } from '@/projection/dependency';\nimport {\n  isProjection,\n  outputDefinitionOf,\n  type KeyedProjection,\n  type Projection,\n} from '@/projection/definition';\nimport { assertSynchronous } from '@/projection/graph/scheduler';\nimport { createKeyRelation, type KeyRelation } from './relation';\n\nexport type SingularKeyedDependency<\n  DriverKey extends string,\n  DriverValue,\n  SourceKey extends string,\n  SourceValue,\n> = {\n  readonly source: KeyedProjection<SourceKey, SourceValue>;\n  readonly key: (value: DriverValue, key: DriverKey) => Synchronous<SourceKey | undefined>;\n  readonly keys?: never;\n};\n\nexport type PluralKeyedDependency<\n  DriverKey extends string,\n  DriverValue,\n  SourceKey extends string,\n  SourceValue,\n> = {\n  readonly source: KeyedProjection<SourceKey, SourceValue>;\n  readonly keys: (value: DriverValue, key: DriverKey) => Synchronous<readonly SourceKey[]>;\n  readonly key?: never;\n};\n\nexport type KeyedDependency<DriverKey extends string, DriverValue> =\n  | (Projection<unknown> & {\n      readonly source?: never;\n      readonly key?: never;\n      readonly keys?: never;\n    })\n  | SingularKeyedDependency<DriverKey, DriverValue, string, unknown>\n  | PluralKeyedDependency<DriverKey, DriverValue, string, unknown>;\n\nexport type KeyedDependencyRecord<DriverKey extends string, DriverValue> = Readonly<\n  Record<string, KeyedDependency<DriverKey, DriverValue>>\n>;\n\nexport type KeyedDependencies<DriverKey extends string, DriverValue, D extends object> = {\n  readonly [P in keyof D]: P extends string ? KeyedDependency<DriverKey, DriverValue> : never;\n};\n\nexport type KeyedDependencyValues<D extends object> = {\n  readonly [P in keyof D]: D[P] extends {\n    readonly source: KeyedProjection<infer K extends string, infer V>;\n    readonly keys: (...args: never[]) => unknown;\n  }\n    ? ReadonlyMap<K, V>\n    : D[P] extends {\n          readonly source: KeyedProjection<infer _K extends string, infer V>;\n        }\n      ? V | undefined\n      : D[P] extends Projection<infer T>\n        ? T\n        : never;\n};\n\ntype CompiledDynamicKeyedDependency =\n  | {\n      readonly kind: 'one';\n      readonly projection: Projection<unknown>;\n      readonly select: (value: unknown, key: string) => unknown;\n    }\n  | {\n      readonly kind: 'many';\n      readonly projection: Projection<unknown>;\n      readonly select: (value: unknown, key: string) => unknown;\n    };\n\ntype CompiledKeyedDependency =\n  | {\n      readonly name: string;\n      readonly kind: 'global';\n      readonly projection: Projection<unknown>;\n    }\n  | ({ readonly name: string } & CompiledDynamicKeyedDependency);\n\nexport type CompiledKeyedDependencies = {\n  readonly entries: readonly CompiledKeyedDependency[];\n  readonly projections: readonly Projection<unknown>[];\n};\n\nexport const outputKind = (projection: Projection<unknown>): 'value' | 'collection' =>\n  outputDefinitionOf(projection).kind;\n\nexport const assertKeyedProjection = (projection: Projection<unknown>, role: string): void => {\n  if (outputKind(projection) !== 'collection')\n    throw new TypeError(`${role} must be a keyed collection projection.`);\n};\n\nconst compileDynamicDependency = (\n  value: unknown,\n  label: string\n): CompiledDynamicKeyedDependency => {\n  if (!isPlainObject(value) || isProjection(value))\n    throw new TypeError(\n      `${label} dependencies must be projections or singular/plural keyed lookups.`\n    );\n  const candidate: { source?: unknown; key?: unknown; keys?: unknown } = {};\n  const allowed = new Set(['source', 'key', 'keys']);\n  let hasKey = false;\n  let hasKeys = false;\n  for (const name of Reflect.ownKeys(value)) {\n    if (typeof name !== 'string' || !allowed.has(name))\n      throw new TypeError(`${label} dynamic keyed dependency contains an unknown property.`);\n    const descriptor = Object.getOwnPropertyDescriptor(value, name);\n    if (!descriptor?.enumerable || !('value' in descriptor))\n      throw new TypeError(`${label} dynamic keyed dependency must use enumerable data properties.`);\n    candidate[name as 'source' | 'key' | 'keys'] = descriptor.value;\n    if (name === 'key') hasKey = true;\n    if (name === 'keys') hasKeys = true;\n  }\n  if (!isProjection(candidate.source))\n    throw new TypeError(`${label} dynamic keyed dependency source must be a projection.`);\n  if (hasKey === hasKeys)\n    throw new TypeError(\n      `${label} dynamic keyed dependency must declare exactly one of key or keys.`\n    );\n  const singular = hasKey;\n  const selector = singular ? candidate.key : candidate.keys;\n  if (typeof selector !== 'function')\n    throw new TypeError(`${label} dynamic keyed dependency selector must be a function.`);\n  assertKeyedProjection(candidate.source, `${label} dynamic keyed dependency source`);\n  return singular\n    ? {\n        kind: 'one',\n        projection: candidate.source,\n        select: selector as (value: unknown, key: string) => unknown,\n      }\n    : {\n        kind: 'many',\n        projection: candidate.source,\n        select: selector as (value: unknown, key: string) => unknown,\n      };\n};\n\nexport const compileKeyedDependencies = (\n  driver: Projection<unknown>,\n  dependencySpecs: KeyedDependencyRecord<string, unknown> | undefined,\n  label: string\n): CompiledKeyedDependencies => {\n  const entries: CompiledKeyedDependency[] = [];\n  const projections: Projection<unknown>[] = [driver];\n  if (dependencySpecs === undefined)\n    return Object.freeze({\n      entries: Object.freeze(entries),\n      projections: Object.freeze(projections),\n    });\n  for (const { name, value: dependency } of readNamedDependencyEntries(dependencySpecs, label)) {\n    if (isProjection(dependency)) {\n      entries.push(Object.freeze({ name, kind: 'global' as const, projection: dependency }));\n      projections.push(dependency);\n      continue;\n    }\n    const dynamic = compileDynamicDependency(dependency, label);\n    entries.push(Object.freeze({ name, ...dynamic }));\n    projections.push(dynamic.projection);\n  }\n  return Object.freeze({\n    entries: Object.freeze(entries),\n    projections: Object.freeze(projections),\n  });\n};\n\nconst selectedKey = (\n  dependency: Extract<CompiledDynamicKeyedDependency, { readonly kind: 'one' }>,\n  value: unknown,\n  key: string\n): string | undefined => {\n  const result = dependency.select(value, key);\n  assertSynchronous(result);\n  if (result === undefined) return undefined;\n  if (typeof result !== 'string')\n    throw new TypeError('Dynamic keyed dependency key must be a string or undefined.');\n  return result;\n};\n\nconst selectedKeys = (\n  dependency: Extract<CompiledDynamicKeyedDependency, { readonly kind: 'many' }>,\n  value: unknown,\n  key: string\n): readonly string[] => {\n  const result = dependency.select(value, key);\n  assertSynchronous(result);\n  if (!Array.isArray(result))\n    throw new TypeError('Dynamic keyed dependency keys must be an array of strings.');\n  const seen = new Set<string>();\n  for (const selected of result) {\n    if (typeof selected !== 'string')\n      throw new TypeError('Dynamic keyed dependency keys must contain only strings.');\n    if (seen.has(selected))\n      throw new TypeError('Dynamic keyed dependency keys must not contain duplicates.');\n    seen.add(selected);\n  }\n  return result as readonly string[];\n};\n\nexport type KeyedDependencyRuntime = {\n  prepare(sources: readonly SourceContext[], reset: boolean): void;\n  resolve(\n    driverValue: unknown,\n    driverKey: string,\n    sources: readonly SourceContext[]\n  ): Readonly<Record<string, unknown>>;\n  driverChanged(source: SourceContext): boolean;\n  collectInvalidated(sources: readonly SourceContext[], dirty: Set<string>): boolean;\n  remove(driverKey: string): void;\n  clearBindings(): void;\n  remember(sources: readonly SourceContext[]): void;\n  release(): void;\n};\n\nconst emptyValues: Readonly<Record<string, unknown>> = Object.freeze(\n  Object.create(null) as Record<string, unknown>\n);\n\nexport const createKeyedDependencyRuntime = (\n  compiled: CompiledKeyedDependencies\n): KeyedDependencyRuntime => {\n  type GlobalDependencyState = {\n    readonly kind: 'global';\n    readonly entry: Extract<CompiledKeyedDependency, { readonly kind: 'global' }>;\n    readonly sourceIndex: number;\n    revision: number;\n    globalValue: unknown;\n  };\n  type DynamicDependencyState = {\n    readonly kind: 'dynamic';\n    readonly entry: Exclude<CompiledKeyedDependency, { readonly kind: 'global' }>;\n    readonly sourceIndex: number;\n    readonly relation: KeyRelation;\n    revision: number;\n  };\n  type DependencyState = GlobalDependencyState | DynamicDependencyState;\n  const states: DependencyState[] = compiled.entries.map((entry, index) =>\n    entry.kind === 'global'\n      ? { kind: 'global', entry, sourceIndex: index + 1, revision: -1, globalValue: undefined }\n      : {\n          kind: 'dynamic',\n          entry,\n          sourceIndex: index + 1,\n          relation: createKeyRelation(),\n          revision: -1,\n        }\n  );\n  let driverRevision = -1;\n\n  return {\n    prepare(sources, reset) {\n      for (const state of states) {\n        if (state.kind !== 'global') continue;\n        const source = sources[state.sourceIndex];\n        if (reset || state.revision !== source.revision)\n          state.globalValue = snapshotDependencyValue(source);\n      }\n    },\n    resolve(driverValue, driverKey, sources) {\n      if (!states.length) return emptyValues;\n      const values = Object.create(null) as Record<string, unknown>;\n      for (const state of states) {\n        if (state.kind === 'global') {\n          values[state.entry.name] = state.globalValue;\n          continue;\n        }\n        const dependency = state.entry;\n        const source = sources[state.sourceIndex];\n        if (source.kind !== 'collection')\n          throw new TypeError('Dynamic keyed dependency resolved to a non-collection source.');\n        if (dependency.kind === 'one') {\n          const selected = selectedKey(dependency, driverValue, driverKey);\n          state.relation.replaceOne(driverKey, selected);\n          values[dependency.name] = selected === undefined ? undefined : source.read.get(selected);\n          continue;\n        }\n        const keys = selectedKeys(dependency, driverValue, driverKey);\n        state.relation.replace(driverKey, keys);\n        const selected = new Map<string, unknown>();\n        for (const key of keys) if (source.read.has(key)) selected.set(key, source.read.get(key));\n        values[dependency.name] = collectionView(mapRead(selected));\n      }\n      return Object.freeze(values);\n    },\n    driverChanged(source) {\n      return driverRevision !== source.revision;\n    },\n    collectInvalidated(sources, dirty) {\n      let all = false;\n      for (const state of states) {\n        const source = sources[state.sourceIndex];\n        if (state.revision === source.revision) continue;\n        const dependency = state.entry;\n        if (state.kind === 'global') {\n          all = true;\n          continue;\n        }\n        if (source.kind !== 'collection' || !source.change || source.change.kind === 'reset') {\n          all = true;\n          continue;\n        }\n        for (const entry of source.change.added)\n          for (const dependent of state.relation.reverse(entry.key) ?? []) dirty.add(dependent);\n        for (const entry of source.change.updated)\n          for (const dependent of state.relation.reverse(entry.key) ?? []) dirty.add(dependent);\n        for (const entry of source.change.removed)\n          for (const dependent of state.relation.reverse(entry.key) ?? []) dirty.add(dependent);\n      }\n      return all;\n    },\n    remove(driverKey) {\n      for (const state of states) if (state.kind === 'dynamic') state.relation.delete(driverKey);\n    },\n    clearBindings() {\n      for (const state of states) if (state.kind === 'dynamic') state.relation.clear();\n    },\n    remember(sources) {\n      driverRevision = sources[0]?.revision ?? -1;\n      for (const state of states) state.revision = sources[state.sourceIndex].revision;\n    },\n    release() {\n      for (const state of states) {\n        state.revision = -1;\n        if (state.kind === 'global') state.globalValue = undefined;\n        else state.relation.clear();\n      }\n      driverRevision = -1;\n    },\n  };\n};\n","import type { CollectionRead, SourceContext } from '@/projection/contract';\nimport { defineProcessor, type KeyedProjection } from '@/projection/definition';\nimport { assertSynchronous } from '@/projection/graph/scheduler';\nimport {\n  assertKeyedProjection,\n  compileKeyedDependencies,\n  createKeyedDependencyRuntime,\n  type KeyedDependencyRecord,\n} from './dependency';\n\nexport const keyedAbsent = Symbol('keyed-transform-absent');\nexport type KeyedTransformResult<T> = T | typeof keyedAbsent;\n\nexport type KeyedTransformContext<K extends string, V, State> = {\n  readonly key: K;\n  readonly value: V;\n  readonly dependencies: Readonly<Record<string, unknown>>;\n  readonly state: State;\n  readonly reset: boolean;\n  readonly cause: unknown;\n};\n\nexport type KeyedTransformDefinition<K extends string, V, T, State> = {\n  readonly source: KeyedProjection<K, V>;\n  readonly dependencies?: KeyedDependencyRecord<K, V>;\n  readonly equality?: (previous: T, next: T) => boolean;\n  readonly name: string;\n  readonly state?: (value: V, key: K) => State;\n  readonly evaluate: (context: KeyedTransformContext<K, V, State>) => KeyedTransformResult<T>;\n};\n\n/** Shared driver-keyed lifecycle for pure and retained keyed transforms. */\nexport const createKeyedTransform = <K extends string, V, T, State = undefined>(\n  definition: KeyedTransformDefinition<K, V, T, State>\n): KeyedProjection<K, T> => {\n  assertKeyedProjection(definition.source, `${definition.name} source`);\n  const compiled = compileKeyedDependencies(\n    definition.source,\n    definition.dependencies as KeyedDependencyRecord<string, unknown> | undefined,\n    definition.name\n  );\n  const [projection] = defineProcessor({\n    dependencies: compiled.projections,\n    outputs: [\n      {\n        kind: 'collection',\n        equality: (definition.equality ?? Object.is) as (\n          previous: unknown,\n          next: unknown\n        ) => boolean,\n      },\n    ],\n    create: () => {\n      const dependencies = createKeyedDependencyRuntime(compiled);\n      const states = new Map<string, State>();\n\n      const dropState = (key: string): void => {\n        states.delete(key);\n        dependencies.remove(key);\n      };\n\n      return {\n        evaluate: evaluation => {\n          const driver = evaluation.sources[0];\n          const output = evaluation.outputs[0];\n          if (driver.kind !== 'collection' || output.kind !== 'collection')\n            throw new Error(`${definition.name} requires collection input and output.`);\n          dependencies.prepare(evaluation.sources, evaluation.reset);\n\n          const stateFor = (key: string, value: V): State => {\n            if (states.has(key)) return states.get(key) as State;\n            const state = definition.state\n              ? definition.state(value, key as K)\n              : (undefined as State);\n            assertSynchronous(state);\n            if (definition.state) states.set(key, state);\n            return state;\n          };\n\n          const project = (key: string): boolean => {\n            if (!driver.read.has(key)) return false;\n            const value = driver.read.get(key) as V;\n            const beforePresent = output.previous.has(key);\n            const next = definition.evaluate({\n              key: key as K,\n              value,\n              dependencies: dependencies.resolve(value, key, evaluation.sources),\n              state: stateFor(key, value),\n              reset: evaluation.reset,\n              cause: evaluation.cause,\n            });\n            assertSynchronous(next);\n            if (next === keyedAbsent) output.output.remove(key);\n            else output.output.set(key, next);\n            return beforePresent !== output.next.has(key);\n          };\n\n          if (evaluation.reset) {\n            dependencies.clearBindings();\n            const ids = driver.read.ids();\n            for (const key of states.keys()) if (!driver.read.has(key)) states.delete(key);\n            for (const key of ids) project(key);\n            output.output.order(ids.filter(key => output.next.has(key)));\n            dependencies.remember(evaluation.sources);\n            return;\n          }\n\n          const dirty = new Set<string>();\n          let all = false;\n          let updateOrder = false;\n          let membershipChanged = false;\n          if (dependencies.driverChanged(driver)) {\n            const change = driver.change;\n            if (!change || change.kind === 'reset') {\n              all = true;\n              updateOrder = true;\n              for (const key of output.previous.ids()) {\n                if (driver.read.has(key)) continue;\n                output.output.remove(key);\n                dropState(key);\n                membershipChanged = true;\n              }\n            } else {\n              for (const entry of change.removed) {\n                membershipChanged ||= output.previous.has(entry.key);\n                output.output.remove(entry.key);\n                dropState(entry.key);\n                dirty.delete(entry.key);\n              }\n              for (const entry of change.added) dirty.add(entry.key);\n              for (const entry of change.updated) dirty.add(entry.key);\n              updateOrder = Boolean(change.order);\n            }\n          }\n\n          all ||= dependencies.collectInvalidated(evaluation.sources, dirty);\n          if (all) for (const key of driver.read.ids()) dirty.add(key);\n          for (const key of dirty) {\n            const changedMembership = project(key);\n            membershipChanged ||= changedMembership;\n          }\n          if (updateOrder || membershipChanged)\n            output.output.order(driver.read.ids().filter(key => output.next.has(key)));\n          dependencies.remember(evaluation.sources);\n        },\n        release: () => {\n          states.clear();\n          dependencies.release();\n        },\n      };\n    },\n    name: definition.name,\n  });\n  return projection as KeyedProjection<K, T>;\n};\n"],"mappings":";AAkDA,MAAa,UAAU;CACrB,aAAa,KAAmC,SAAS,MAAM;CAG/D,WAAW,KAAiC,SAAS,MAAM;CAG3D,SAAS,QAAkC;CAG3C,MAAM;EACJ,iBAAiB;EAGjB,gBAAgB;EAGhB,gBAAgB,UAAkB;EAGnC;CACD,UAAU;EACR,YAAY;EAGZ,iBAAiB;EAGlB;CACD,SAAS;EACP,YAAY,UAAkB;EAM9B,kBAAkB;EAGlB,oBAAoB;EAGpB,wBAAwB;EAGxB,uBAAuB;EAGxB;CACD,QAAQ;EACN,aAAa;EAGb,eAAe;EAGhB;CACD,YAAY;EACV,kBAAkB;EAGlB,uBAAuB;EAGxB;CACD,iBAAiB;EACf,YAAY;EAGZ,QAAQ,UAAkB;EAM3B;CACD,gBAAgB;EACd,cAAc;EAGd,aAAa,SAAS,MAAM;EAG5B,mBAAmB;EAGpB;CACD,cAAc;EACZ,eAAe;EAGf,eAAe;EAGf,oBAAoB;EAGrB;CACF;;;ACJD,MAAM,8BAAc,IAAI,SAAgC;AAExD,MAAM,aAAgB,UAA8B,WAAkC;CACpF,MAAM,SAAS,OAAO,OAAO,EAAE,CAAC;AAChC,aAAY,IAAI,QAAQ,OAAO,OAAO;EAAE;EAAU;EAAQ,CAAC,CAAC;AAC5D,QAAO;;AAGT,MAAa,iBAAiB,eAAmD;CAC/E,MAAM,MAAM,YAAY,IAAI,WAAW;AACvC,KAAI,CAAC,IAAK,OAAM,IAAI,UAAU,iCAAiC;AAC/D,QAAO;;AAGT,MAAa,cAAc,eACzB,cAAc,WAAW,CAAC;;AAG5B,MAAa,sBAAsB,eAAsD;CACvF,MAAM,MAAM,cAAc,WAAW;CACrC,MAAM,WAAW,IAAI;CACrB,MAAM,SAAS,SAAS,SAAS,WAAW,SAAS,SAAS,SAAS,QAAQ,IAAI;AACnF,KAAI,CAAC,OAAQ,OAAM,IAAI,UAAU,oCAAoC;AACrE,QAAO;;AAGT,MAAa,gBAAgB,UAC3B,UAAU,QAAQ,OAAO,UAAU,YAAY,YAAY,IAAI,MAAM;AAEvE,MAAa,kBACX,aACA,UACS;CACT,MAAM,YAAY,IAAI,IAAI,YAAY,IAAI,WAAW,CAAC;AACtD,MAAK,MAAM,YAAY,WAAW;AAChC,MAAI,SAAS,UAAU,KAAA,KAAa,SAAS,UAAU,MACrD,OAAM,IAAI,UAAU,wDAAwD;AAC9E,MAAI,SAAS,UAAU,KAAA,KAAa,SAAS,aAC3C,OAAM,IAAI,UAAU,4DAA4D;AAClF,MAAI,SAAS,SAAS,YAAa;AACnC,OAAK,MAAM,cAAc,SAAS,cAAc;GAC9C,MAAM,kBAAkB,WAAW,WAAW,CAAC;AAC/C,OAAI,oBAAoB,KAAA,KAAa,oBAAoB,MACvD,OAAM,IAAI,UAAU,0CAA0C;;;AAGpE,MAAK,MAAM,YAAY,UAAW,UAAS,QAAQ;;AAGrD,MAAM,gBAAgB,WACpB,OAAO,OAAO;CACZ,MAAM,OAAO;CACb,UAAU,OAAO;CACjB,GAAI,OAAO,OAAO,EAAE,MAAM,OAAO,OAAO,CAAC,GAAG,OAAO,KAAK,CAAC,EAAE,GAAG,EAAE;CACjE,CAAC;AAEJ,MAAa,mBAAmB,eAKM;AACpC,KAAI,CAAC,MAAM,QAAQ,WAAW,aAAa,CACzC,OAAM,IAAI,UAAU,4CAA4C;AAClE,YAAW,aAAa,QAAQ,cAAc;AAC9C,KAAI,CAAC,WAAW,QAAQ,OAAQ,OAAM,IAAI,UAAU,2CAA2C;CAC/F,MAAM,WAAgC;EACpC,MAAM;EACN,cAAc,OAAO,OAAO,CAAC,GAAG,WAAW,aAAa,CAAC;EACzD,SAAS,OAAO,OAAO,WAAW,QAAQ,IAAI,aAAa,CAAC;EAC5D,QAAQ,WAAW;EACnB,GAAI,WAAW,OAAO,EAAE,MAAM,WAAW,MAAM,GAAG,EAAE;EACrD;AACD,QAAO,OAAO,OAAO,SAAS,QAAQ,KAAK,GAAG,WAAW,UAAmB,UAAU,OAAO,CAAC,CAAC;;AAGjG,MAAa,gBAAmB,QAAuB,WAA4C;AAMjG,QAAO,UAAa;EAJlB,MAAM;EACN;EACA,QAAQ,aAAa,OAAO;EAEF,EAAE,EAAE;;;;AChOlC,MAAa,WAAgC,UAAmD;CAC9F,IAAI;AACJ,QAAO;EACL,MAAK,QAAO,MAAM,IAAI,IAAI;EAC1B,MAAK,QAAO,MAAM,IAAI,IAAI;EAC1B,WAAY,QAAQ,OAAO,OAAO,CAAC,GAAG,MAAM,MAAM,CAAC,CAAC;EACrD;;;AAIH,MAAa,kBACX,MACA,aACsB;CACtB,MAAM,MAAM,YAAY,KAAK,KAAK;CAClC,MAAM,UAAU,aAAuC;AACrD,OAAK,MAAM,OAAO,IAAK,OAAM,CAAC,KAAK,KAAK,IAAI,IAAI,CAAM;;CAExD,MAAM,SAAS,aAAkC;AAC/C,OAAK,MAAM,OAAO,IAAK,OAAM,KAAK,IAAI,IAAI;;CAE5C,MAAM,OAA0B;EAC9B,MAAK,QAAO,KAAK,IAAI,IAAI;EACzB,MAAK,QAAO,KAAK,IAAI,IAAI;EACzB,IAAI,OAAO;AACT,UAAO,IAAI;;EAEb,YAAY,IAAI,OAAO,WAAW;EAClC;EACA;EACA,UAAU,UAAU,YAAY;AAC9B,QAAK,MAAM,OAAO,IAAK,UAAS,KAAK,SAAS,KAAK,IAAI,IAAI,EAAO,KAAK,KAAK;;GAE7E,OAAO,WAAW;EACpB;AACD,QAAO,OAAO,OAAO,KAAK;;;AAI5B,MAAa,0BACX,SACsB;CACtB,MAAM,MAAM,KAAK,KAAK;CACtB,MAAM,yBAAS,IAAI,KAAW;AAC9B,MAAK,MAAM,OAAO,IAAK,QAAO,IAAI,KAAK,KAAK,IAAI,IAAI,CAAM;AAC1D,QAAO,eAAe,QAAQ,OAAO,EAAE,IAAI;;;;;AC/B7C,MAAa,8BACX,cACA,UACoC;AACpC,KAAI,CAAC,cAAc,aAAa,IAAI,aAAa,aAAa,CAC5D,OAAM,IAAI,UAAU,GAAG,MAAM,uCAAuC;CACtE,MAAM,UAAkC,EAAE;AAC1C,MAAK,MAAM,QAAQ,QAAQ,QAAQ,aAAa,EAAE;AAChD,MAAI,OAAO,SAAS,SAAU,OAAM,IAAI,UAAU,GAAG,MAAM,oCAAoC;EAC/F,MAAM,aAAa,OAAO,yBAAyB,cAAc,KAAK;AACtE,MAAI,CAAC,YAAY,cAAc,EAAE,WAAW,YAC1C,OAAM,IAAI,UAAU,GAAG,MAAM,mDAAmD;AAClF,UAAQ,KAAK,OAAO,OAAO;GAAE;GAAM,OAAO,WAAW;GAAO,CAAC,CAAC;;AAEhE,QAAO,OAAO,OAAO,QAAQ;;;AAI/B,MAAa,2BAA2B,WACtC,OAAO,SAAS,UAAU,OAAO,QAAQ,uBAAuB,OAAO,KAAK;;AAG9E,MAAa,iCACX,cACA,UACmC;CACnC,MAAM,QAAkB,EAAE;CAC1B,MAAM,cAAqC,EAAE;AAC7C,MAAK,MAAM,EAAE,MAAM,WAAW,2BAA2B,cAAc,MAAM,EAAE;EAC7E,MAAM,aAAa;AACnB,gBAAc,WAAW;AACzB,QAAM,KAAK,KAAK;AAChB,cAAY,KAAK,WAAW;;AAE9B,QAAO,OAAO,OAAO;EACnB,OAAO,OAAO,OAAO,MAAM;EAC3B,aAAa,OAAO,OAAO,YAAY;EACxC,CAAC;;;;;ACpDJ,MAAa,aAAgB,MAAoB,UAAiC;AAChF,KAAI,SAAS,MAAO,QAAO;AAC3B,KAAI,KAAK,WAAW,MAAM,OAAQ,QAAO;AACzC,MAAK,IAAI,QAAQ,GAAG,QAAQ,KAAK,QAAQ,QAAS,KAAI,KAAK,WAAW,MAAM,OAAQ,QAAO;AAC3F,QAAO;;;AAIT,MAAa,iBAAoB,WAC/B,OAAO,SAAS,OAAO,GAAG,SAAS,OAAO,OAAO,CAAC,GAAG,OAAO,CAAC;;AAG/D,MAAa,wBAA2B,QAAqB,aAAoC;CAC/F,IAAI,QAAQ;AACZ,MAAK,MAAM,SAAS,QAAQ;AAC1B,MAAI,SAAS,SAAS,UAAU,UAAU,SAAS,OAAQ,QAAO;AAClE;;AAEF,QAAO,UAAU,SAAS;;;;ACR5B,MAAM,sBACJ,SACA,QACY;AACZ,MAAK,MAAM,SAAS,QAAS,KAAI,MAAM,QAAQ,IAAK,QAAO;AAC3D,QAAO;;AAGT,MAAM,iBACJ,YAC+B;AAG/B,KAAI,QAAQ,UAAU,EAAG,QAAO,KAAA;CAChC,MAAM,uBAAO,IAAI,KAAQ;AACzB,MAAK,MAAM,SAAS,QAAS,MAAK,IAAI,MAAM,IAAI;AAChD,QAAO;;AAGT,MAAM,iBACJ,UACA,UACA,UACsB;AACtB,QAAO,MAAM;EACX,MAAM,OAAO,SAAS,MAAM;AAC5B,MAAI,KAAK,QAAQ,EAAE,QAAQ,MAAM,IAAI,KAAK,MAAM,GAAG,mBAAmB,UAAU,KAAK,MAAM,EACzF,QAAO;;;;AAKb,MAAM,0BACJ,QACA,OACA,SACA,UACY;CACZ,MAAM,cAAc,cAAc,QAAQ;CAC1C,MAAM,YAAY,cAAc,MAAM;CACtC,MAAM,iBAAiB,OAAO,OAAO,WAAW;CAChD,MAAM,gBAAgB,MAAM,OAAO,WAAW;AAC9C,QAAO,MAAM;EACX,MAAM,OAAO,cAAc,gBAAgB,SAAS,YAAY;EAChE,MAAM,QAAQ,cAAc,eAAe,OAAO,UAAU;AAC5D,MAAI,KAAK,QAAQ,MAAM,KAAM,QAAO,KAAK,SAAS,MAAM;AACxD,MAAI,KAAK,UAAU,MAAM,MAAO,QAAO;;;AAI3C,MAAM,iBACJ,UACA,eACsB;AACtB,QAAO,MAAM;EACX,MAAM,OAAO,SAAS,MAAM;AAC5B,MAAI,KAAK,QAAQ,WAAW,IAAI,KAAK,MAAM,CAAE,QAAO;;;;AAKxD,MAAM,mBAAyB,QAA2B,UAAsC;CAC9F,MAAM,iBAAiB,OAAO,MAAM;CACpC,MAAM,gBAAgB,MAAM,MAAM;AAClC,QAAO,MAAM;EACX,MAAM,OAAO,cAAc,gBAAgB,MAAM;EACjD,MAAM,QAAQ,cAAc,eAAe,OAAO;AAClD,MAAI,KAAK,QAAQ,MAAM,KAAM,QAAO,KAAK,SAAS,MAAM;AACxD,MAAI,KAAK,UAAU,MAAM,MAAO,QAAO;;;AAI3C,MAAM,yBACJ,OACA,SACA,SACA,UACuC;AACvC,KAAI,CAAC,MAAM,UAAU,CAAC,QAAQ,UAAU,CAAC,QAAQ,UAAU,CAAC,MAAO,QAAO,KAAA;AAC1E,QAAO,OAAO,OAAO;EACnB,MAAM;EACN,OAAO,OAAO,OAAO,MAAM;EAC3B,SAAS,OAAO,OAAO,QAAQ;EAC/B,SAAS,OAAO,OAAO,QAAQ;EAC/B,GAAI,QACA,EACE,OAAO,OAAO,OAAO;GACnB,QAAQ,cAAc,MAAM,OAAO;GACnC,OAAO,cAAc,MAAM,MAAM;GAClC,CAAC,EACH,GACD,EAAE;EACP,CAAC;;;AAIJ,MAAa,0BAA+C,UAMlB;CACxC,IAAI,eAAe;AACnB,KAAI,MAAM,gBAAgB,MAAM,WAC9B,KAAI,CAAC,MAAM,MAAM,UAAU,CAAC,MAAM,QAAQ,OACxC,gBAAe,CAAC,UAAU,MAAM,aAAa,MAAM,WAAW;KAE9D,gBAAe,uBACb,MAAM,aACN,MAAM,YACN,MAAM,SACN,MAAM,MACP;AAEL,QAAO,sBACL,MAAM,OACN,MAAM,SACN,MAAM,SACN,eAAe;EAAE,QAAQ,MAAM;EAAa,OAAO,MAAM;EAAY,GAAG,KAAA,EACzE;;;AAIH,MAAa,kBACX,UACA,SACA,UAA6C,OAAO,OACb;CACvC,MAAM,QAAuB,EAAE;CAC/B,MAAM,UAA2B,EAAE;CACnC,MAAM,UAA2B,EAAE;AACnC,MAAK,MAAM,CAAC,KAAK,WAAW,SAC1B,KAAI,CAAC,QAAQ,IAAI,IAAI,CAAE,SAAQ,KAAK;EAAE;EAAK;EAAQ,CAAC;MAC/C;EACH,MAAM,QAAQ,QAAQ,IAAI,IAAI;AAC9B,MAAI,CAAC,QAAQ,QAAQ,MAAM,CAAE,SAAQ,KAAK;GAAE;GAAK;GAAQ;GAAO,CAAC;;AAGrE,MAAK,MAAM,CAAC,KAAK,UAAU,QAAS,KAAI,CAAC,SAAS,IAAI,IAAI,CAAE,OAAM,KAAK;EAAE;EAAK;EAAO,CAAC;AAEtF,QAAO,sBACL,OACA,SACA,SAJmB,gBAAgB,UAAU,QAKjC,GACR;EACE,QAAQ,OAAO,OAAO,CAAC,GAAG,SAAS,MAAM,CAAC,CAAC;EAC3C,OAAO,OAAO,OAAO,CAAC,GAAG,QAAQ,MAAM,CAAC,CAAC;EAC1C,GACD,KAAA,EACL;;AAGH,MAAM,cAAc,WAClB,QACqB;AACrB,KAAK,OAAkC,SAAS,cAC9C,OAAM,IAAI,UAAU,kEAAkE;AACxF,MAAK,MAAM,SAAS,OAAO,MAAO,OAAM,MAAM;AAC9C,MAAK,MAAM,SAAS,OAAO,QAAS,OAAM,MAAM;AAChD,MAAK,MAAM,SAAS,OAAO,QAAS,OAAM,MAAM;;AAGlD,MAAa,mBAIT,OAAO,OAAO,EAAE,MAAM,aAAa,CAAC;AAExC,MAAa,iCACX,WAEA,OAAO,SAAS,WAAW,QAAQ,OAAO,MAAM,UAAU,OAAO,QAAQ,UAAU,OAAO,MAAM;AAElG,MAAa,8BACX,QACA,QACY;AACZ,MAAK,MAAM,SAAS,OAAO,MAAO,KAAI,MAAM,QAAQ,IAAK,QAAO;AAChE,MAAK,MAAM,SAAS,OAAO,QAAS,KAAI,MAAM,QAAQ,IAAK,QAAO;AAClE,MAAK,MAAM,SAAS,OAAO,QAAS,KAAI,MAAM,QAAQ,IAAK,QAAO;AAClE,QAAO;;AAGT,MAAa,8BACX,QACA,SACY;AACZ,MAAK,MAAM,SAAS,OAAO,MAAO,KAAI,KAAK,IAAI,MAAM,IAAI,CAAE,QAAO;AAClE,MAAK,MAAM,SAAS,OAAO,QAAS,KAAI,KAAK,IAAI,MAAM,IAAI,CAAE,QAAO;AACpE,MAAK,MAAM,SAAS,OAAO,QAAS,KAAI,KAAK,IAAI,MAAM,IAAI,CAAE,QAAO;AACpE,QAAO;;;;AC7GT,IAAa,kBAAb,cAAqC,MAAM;CACzC;CAEA,YACE,OACA,OACA;AACA,QAAM,cAAc,MAAM,WAAW,EAAE,OAAO,CAAC;AAHtC,OAAA,QAAA;AAIT,OAAK,OAAO;AACZ,OAAK,QAAQ;;;AAIjB,IAAa,0BAAb,cAA6C,MAAM;CACjD,cAAc;AACZ,QAAM,gCAAgC;AACtC,OAAK,OAAO;;;;;ACxDhB,MAAa,mBAAmB,YAA8C;CAC5E,IAAI,WAAW;CACf,IAAI,QAAQ;CACZ,IAAI,gBAAgB;CACpB,IAAI;CACJ,IAAI,QAAuC;CAC3C,IAAI,WAAW;CACf,MAAM,0BAAU,IAAI,KAA2B;CAC/C,MAAM,6BAAa,IAAI,KAAsB;CAC7C,MAAM,iCAAiB,IAAI,KAA2B;CACtD,MAAM,OAA0B,EAAE;CAClC,MAAM,yBAAS,IAAI,KAAsB;CACzC,MAAM,4BAAY,IAAI,KAAsB;CAC5C,MAAM,4BAAY,IAAI,KAAmB;CACzC,MAAM,SAA4B,EAAE;CACpC,IAAI,oBAA+B,EAAE;CACrC,MAAM,yBAAS,IAAI,KAAgC;CAEnD,MAAM,qBAAqB;AACzB,MAAI,SAAU,OAAM,IAAI,yBAAyB;;CAEnD,MAAM,mBAAmB;AACvB,gBAAc;AACd,MAAI,UAAU,OACZ,OAAM,IAAI,MAAM,qEAAqE;;CAEzF,MAAM,QAAQ,UAAmB,OAAO,SAAQ,UAAS,MAAM,MAAM,CAAC;CAEtE,MAAM,WAAW,cAA+B;AAC9C,MAAI,UAAU,YAAY,OAAO,IAAI,UAAU,CAAE;AACjD,SAAO,IAAI,UAAU;AACrB,UAAQ,WAAW,iBAAiB;EACpC,IAAI,QAAQ,KAAK;AACjB,OAAK,KAAK,UAAU;AACpB,SAAO,QAAQ,GAAG;GAChB,MAAM,SAAU,QAAQ,KAAM;AAC9B,OAAI,KAAK,QAAQ,QAAQ,UAAU,MAAO;AAC1C,QAAK,SAAS,KAAK;AACnB,WAAQ;;AAEV,OAAK,SAAS;;CAGhB,MAAM,YAA6B;EACjC,MAAM,QAAQ,KAAK;EACnB,MAAM,OAAO,KAAK,KAAK;AACvB,MAAI,KAAK,QAAQ;GACf,IAAI,QAAQ;AACZ,UAAO,QAAQ,IAAI,IAAI,KAAK,QAAQ;IAClC,IAAI,QAAQ,QAAQ,IAAI;AACxB,QAAI,QAAQ,IAAI,KAAK,UAAU,KAAK,QAAQ,GAAG,QAAQ,KAAK,OAAO,MAAO;AAC1E,QAAI,KAAK,QAAQ,KAAK,OAAO,MAAO;AACpC,SAAK,SAAS,KAAK;AACnB,YAAQ;;AAEV,QAAK,SAAS;;AAEhB,SAAO;;CAGT,MAAM,YACJ,UACA,OACA,OAAiC,SAAS,SAAS,WAAW,WAAW,gBACtE,IAAI,gBAAgB,MAAM,MAAM;CAErC,MAAM,WAAW,WAAiC;AAChD,MAAI,SAAU;AACd,MAAI,UAAU,QAAQ;AACpB,UAAO,QAAQ,SACb,wBACA,IAAI,MAAM,+CAA+C,EACzD,SACD;AACD,UAAO,KAAK,OAAO,MAAM;AACzB,SAAM,OAAO;;AAEf,iBAAe,IAAI,OAAO;AAC1B,UAAQ,WAAW,eAAe;AAClC,MAAI,OAAO,MAAO,QAAO,KAAK,OAAO,MAAM;;CAG7C,MAAM,oBAA6B;AACjC,MAAI,aAAa,UAAU,KAAA,EAAW,QAAO,YAAY;AACzD,OAAK,MAAM,UAAU,gBAAgB;GACnC,MAAM,QAAQ,OAAO,cAAc;AACnC,OAAI,UAAU,KAAA,EAAW,QAAO;;;CAKpC,MAAM,eAAe;AACnB,MAAI,YAAY,SAAS,UAAU,OAAQ;AAC3C,UAAQ;AACR,OAAK,KAAK;EACV,MAAM,QAAQ,aAAa;AAC3B,MAAI;AACF,QAAK,MAAM,UAAU,gBAAgB;AACnC,QAAI,OAAO,SAAU;IACrB,MAAM,aAAa,OAAO,UAAU,KAAA;IACpC,IAAI,UAAU;IACd,IAAI,QAAQ;AACZ,QAAI,CAAC,OAAO,SAAS,OAAO,YAAY,CACtC,KAAI;KACF,MAAM,WAAW,OAAO,QAAQ,MAAM;AACtC,eAAU,SAAS;AACnB,aAAQ,SAAS;AACjB,YAAO,QAAQ,KAAA;aACR,SAAS;AAChB,YAAO,QAAQ,SAAS,QAAQ,SAAS,SAAS;AAClD,YAAO,KAAK,OAAO,MAAM;;IAG7B,MAAM,YAAY,cAAc,CAAC,OAAO;AACxC,QAAI,QAAS,QAAO,SAAS;AAC7B,QAAI,OAAO,SAAS,WAAW,SAAS,WAAW;KACjD,MAAM,SAAS,OAAO,QAAQ;AAC9B,eAAU,IAAI,OAAO;AACrB,YAAO,gBAAgB,QAAQ;;;AAInC,UAAO,KAAK,QAAQ;IAClB,MAAM,YAAY,KAAK;AACvB,QAAI,UAAU,SAAU;IACxB,MAAM,aAAa,UAAU,UAAU,KAAA;AACvC,YAAQ,WAAW,iBAAiB;IACpC,IAAI,iBAA0C,OAAO,OAAO,EAAE,CAAC;IAC/D,MAAM,UAAU,UAAU,aAAa,MACrC,WAAU,OAAO,MAAM,SAAS,OAAO,MAAM,SAC9C;AACD,QAAI,QACF,WAAU,QAAQ,SAChB,WACA,QAAQ,MAAM,SAAS,IAAI,yBAAyB,EACpD,UACD;SACI;KACL,MAAM,QAAQ,cAAc,UAAU,aAAa,MAAK,WAAU,OAAO,OAAO,CAAC;AACjF,SAAI;AACF,uBAAiB,UAAU,SAAS,OAAO,OAAO,WAAW;MAC7D,MAAM,oBAAoB,UAAU,aAAa,MAAK,WAAU,OAAO,MAAM,MAAM,EAC/E,MAAM;AACV,UAAI,kBAAmB,OAAM;AAC7B,gBAAU,QAAQ,KAAA;cACX,SAAS;MAChB,MAAM,QAAQ,SAAS,WAAW,QAAQ;AAC1C,gBAAU,QAAQ;AAClB,UAAI,CAAC,MACH,KAAI;AACF,wBAAiB,UAAU,SAAS,MAAM,OAAO,KAAK;OACtD,MAAM,oBAAoB,UAAU,aAAa,MAAK,WAAU,OAAO,MAAM,MAAM,EAC/E,MAAM;AACV,WAAI,kBAAmB,OAAM;AAC7B,iBAAU,QAAQ,KAAA;AAClB,cAAO,KAAK,MAAM;eACX,gBAAgB;AACvB,iBAAU,QAAQ,SAAS,WAAW,eAAe;AACrD,cAAO,KAAK,UAAU,MAAM;;UAEzB,QAAO,KAAK,MAAM;;;AAG7B,cAAU,IAAI,UAAU;IACxB,MAAM,YAAY,cAAc,CAAC,UAAU;AAC3C,QAAI,UAAU,MACZ,WAAU,QAAQ,SAAQ,WAAU;AAClC,eAAU,IAAI,OAAO;AACrB,YAAO,gBAAgB,QAAQ;MAC/B;SACG;AACL,SAAI,eAAe,QAAQ;AACzB,gBAAU,SAAS;AACnB,qBAAe,SAAQ,WAAU,UAAU,IAAI,OAAO,CAAC;;AAGzD,MADmB,YAAY,UAAU,UAAU,gBACxC,SAAQ,WAAU,OAAO,gBAAgB,QAAQ,CAAC;;AAE/D,QAAI,UAAU,SAAS,eAAe,OACpC,SAAQ,WAAW,iBAAiB;;YAGhC;AACR,QAAK,MAAM;AACX,WAAQ;;;CAIZ,MAAM,cAAwC;AAC5C,MAAI,YAAY,MAAO,QAAO,EAAE;AAChC,MAAI,eAAe,QAAQ,UAAU,KAAM,SAAQ,WAAW,UAAU;AACxE,UAAQ;AACR,OAAK,KAAK;EACV,MAAM,iBAA4B,EAAE;AACpC,MAAI;AACF,aAAU,SAAQ,WAChB,OAAO,MAAM,UAAU,WAAW;AAChC,QAAI;AACF,cAAS,OAAO;aACT,OAAO;AACd,YAAO,KAAK,SAAS,OAAO,OAAO,OAAO,WAAW,CAAC;;KAExD,CACH;AACD,QAAK,MAAM,SAAS,OAAO,OAAO,CAChC,KAAI;AACF,YAAQ,MAAM;YACP,OAAO;AACd,mBAAe,KAAK,MAAM;;AAG9B,UAAO,OAAO,OAAO,CACnB,GAAG,OAAO,KAAI,UACZ,OAAO,OAAO;IACZ,OAAO,MAAM,UAAU,aAAc,aAAwB;IAC7D;IACD,CAAC,CACH,EACD,GAAG,eAAe,KAAI,UAAS,OAAO,OAAO;IAAE,OAAO;IAAqB;IAAO,CAAC,CAAC,CACrF,CAAC;YACM;AACR,kBAAe,SAAQ,WAAU,OAAO,OAAO,CAAC;AAChD,aAAU,SAAQ,cAAa,UAAU,OAAO,CAAC;AACjD,kBAAe,OAAO;AACtB,UAAO,OAAO;AACd,aAAU,OAAO;AACjB,aAAU,OAAO;AACjB,UAAO,SAAS;AAChB,uBAAoB;AACpB,QAAK,MAAM;AACX,WAAQ;;;CAIZ,MAAM,YAAY;AAChB,UAAQ;EACR,MAAM,SAAS,OAAO;EACtB,MAAM,WAAW;AACjB,sBAAoB,EAAE;AACtB,MAAI,SAAS,OAAQ,OAAM,IAAI,eAAe,UAAU,oCAAoC;AAC5F,SAAO;;CAGT,MAAM,SAAY,UAAmB,YAA8B;AACjE,cAAY;AAEZ,MADc,UAAU,EAEtB,eAAc,OAAO,OAAO;GAC1B,IAAI,EAAE;GACN,GAAI,SAAS,UAAU,KAAA,IAAY,EAAE,GAAG,EAAE,OAAO,QAAQ,OAAO;GACjE,CAAC;AACJ;EACA,IAAI,SAAS;AACb,MAAI;GACF,MAAM,QAAQ,UAAU;AACxB,qBAAkB,MAAM;AACxB,UAAO;WACA,OAAO;AACd,YAAS;AACT,SAAM;YACE;AACR;AACA,OAAI,CAAC,MACH,KAAI;AACF,QAAI,OACF,KAAI;AACF,UAAK;YACC;QAGH,MAAK;aACJ;AACR,kBAAc,KAAA;;;;CAMtB,MAAM,mBAAmB,aAA6B;AACpD,cAAY;AACZ,MAAI,SAAS,QAAQ,MAAK,WAAU,OAAO,cAAc,CAAC,CACxD,OAAM,IAAI,MAAM,0DAA0D;AAC5E,WAAS,WAAW;AACpB,MAAI,SAAS,SAAS,aAAa;AACjC,YAAS,aAAa,SAAQ,WAAU,OAAO,eAAe,SAAS,CAAC;AACxE,cAAW,OAAO,SAAS;AAC3B,UAAO,OAAO,SAAS;AACvB,aAAU,OAAO,SAAS;SACrB;AACL,WAAQ,OAAO,SAAS;AACxB,kBAAe,OAAO,SAAS;;EAEjC,MAAM,WAAsB,EAAE;AAC9B,MAAI;AACF,YAAS,SAAS;WACX,OAAO;AACd,YAAS,KAAK,MAAM;;AAEtB,MAAI;AACF,YAAS,OAAO;WACT,OAAO;AACd,YAAS,KAAK,MAAM;;AAEtB,WAAS,QAAQ,SAAQ,WAAU,UAAU,OAAO,OAAO,CAAC;AAC5D,MAAI,SAAS,OAAQ,OAAM,SAAS;;AAGtC,QAAO;EACL;EACA;EACA;EACA;EACA;EACA;EACA,cAAc,OAA+C;AAC3D,iBAAc;AACd,UAAO,IAAI,MAAM;GACjB,IAAI,aAAa;AACjB,gBAAa;AACX,QAAI,CAAC,WAAY;AACjB,iBAAa;AACb,WAAO,OAAO,MAAM;;;EAGxB,IAAI,SAAS;AACX,UAAO,CAAC;;EAEV,UAAU,QAA8B;AACtC,eAAY;AACZ,WAAQ,IAAI,OAAO;;EAErB,aAAa,WAA4B;AACvC,eAAY;AACZ,cAAW,IAAI,UAAU;AACzB,aAAU,aAAa,SAAQ,WAAU,OAAO,eAAe,UAAU,CAAC;;EAE5E;EACA,aAAa;EACb,WAAc,UAAsB;AAClC,eAAY;AACZ,WAAQ;AACR,QAAK,KAAK;AACV,OAAI;AACF,WAAO,UAAU;aACT;AACR,SAAK,MAAM;AACX,YAAQ;;;EAGZ;EACA,oBAAoB;EACpB,UAAU;AACR,OAAI,SAAU;AACd,eAAY;AACZ,cAAW;GACX,MAAM,WAAsB,EAAE;AAC9B,cAAW,SAAQ,cAAa;AAC9B,cAAU,WAAW;AACrB,QAAI;AACF,eAAU,SAAS;aACZ,OAAO;AACd,cAAS,KAAK,MAAM;;KAEtB;AACF,WAAQ,SAAQ,WAAU;AACxB,WAAO,WAAW;AAClB,QAAI;AACF,YAAO,SAAS;aACT,OAAO;AACd,cAAS,KAAK,MAAM;;KAEtB;AACF,cAAW,OAAO;AAClB,WAAQ,OAAO;AACf,kBAAe,OAAO;AACtB,QAAK,SAAS;AACd,UAAO,OAAO;AACd,aAAU,OAAO;AACjB,aAAU,OAAO;AACjB,UAAO,OAAO;AACd,UAAO,SAAS;AAChB,uBAAoB,EAAE;AACtB,OAAI,SAAS,OAAQ,OAAM,IAAI,eAAe,UAAU,6BAA6B;;EAExF;;AAKH,MAAa,qBAAqB,UAAyB;AACzD,KACE,SAAS,SACR,OAAO,UAAU,YAAY,OAAO,UAAU,eAC/C,UAAU,SACV,OAAO,MAAM,SAAS,WAEtB,OAAM,IAAI,UAAU,4CAA4C;;AAGpE,MAAa,eAAe,WAA0B;AACpD,KAAI,CAAC,QAAQ,CAAE,OAAM,IAAI,MAAM,mDAAmD;;;;;ACxbpF,MAAa,0BAAuC;CAClD,MAAM,0BAAU,IAAI,KAAgC;CACpD,MAAM,0BAAU,IAAI,KAA0B;CAE9C,MAAM,UAAU,MAAc,UAAmC;AAC/D,OAAK,MAAM,OAAO,OAAO;GACvB,MAAM,aAAa,QAAQ,IAAI,IAAI;AACnC,eAAY,OAAO,KAAK;AACxB,OAAI,YAAY,SAAS,EAAG,SAAQ,OAAO,IAAI;;;CAInD,MAAM,UAAU,MAAc,UAAmC;AAC/D,OAAK,MAAM,OAAO,OAAO;GACvB,MAAM,aAAa,QAAQ,IAAI,IAAI;AACnC,OAAI,WAAY,YAAW,IAAI,KAAK;OAC/B,SAAQ,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC;;;AAI1C,QAAO;EACL,WAAW,MAAM,OAAO;GACtB,MAAM,WAAW,QAAQ,IAAI,KAAK;AAClC,OAAI,UAAU,KAAA,GAAW;AACvB,QAAI,CAAC,SAAU,QAAO;AACtB,WAAO,MAAM,SAAS;AACtB,YAAQ,OAAO,KAAK;AACpB,WAAO;;AAET,OAAI,UAAU,WAAW,KAAK,SAAS,OAAO,MAAO,QAAO;AAC5D,OAAI,SAAU,QAAO,MAAM,SAAS;GACpC,MAAM,OAAO,OAAO,OAAO,CAAC,MAAM,CAAC;AACnC,WAAQ,IAAI,MAAM,KAAK;AACvB,UAAO,MAAM,KAAK;AAClB,UAAO;;EAET,QAAQ,MAAM,OAAO;GACnB,MAAM,WAAW,QAAQ,IAAI,KAAK;AAClC,OAAI,WAAW,UAAU,UAAU,MAAM,GAAG,MAAM,WAAW,EAAG,QAAO;AACvE,OAAI,SAAU,QAAO,MAAM,SAAS;AACpC,OAAI,CAAC,MAAM,QAAQ;AACjB,YAAQ,OAAO,KAAK;AACpB,WAAO;;GAET,MAAM,OAAO,cAAc,MAAM;AACjC,WAAQ,IAAI,MAAM,KAAK;AACvB,UAAO,MAAM,KAAK;AAClB,UAAO;;EAET,OAAO,MAAM;GACX,MAAM,WAAW,QAAQ,IAAI,KAAK;AAClC,OAAI,CAAC,SAAU,QAAO;AACtB,UAAO,MAAM,SAAS;AACtB,WAAQ,OAAO,KAAK;AACpB,UAAO;;EAET,UAAS,SAAQ,QAAQ,IAAI,KAAK;EAClC,UAAS,UAAS,QAAQ,IAAI,MAAM;EACpC,aAAa,QAAQ,MAAM;EAC3B,cAAc,QAAQ,MAAM;EAC5B,QAAQ;AACN,WAAQ,OAAO;AACf,WAAQ,OAAO;;EAElB;;;;ACeH,MAAa,cAAc,eACzB,mBAAmB,WAAW,CAAC;AAEjC,MAAa,yBAAyB,YAAiC,SAAuB;AAC5F,KAAI,WAAW,WAAW,KAAK,aAC7B,OAAM,IAAI,UAAU,GAAG,KAAK,yCAAyC;;AAGzE,MAAM,4BACJ,OACA,UACmC;AACnC,KAAI,CAAC,cAAc,MAAM,IAAI,aAAa,MAAM,CAC9C,OAAM,IAAI,UACR,GAAG,MAAM,qEACV;CACH,MAAM,YAAiE,EAAE;CACzE,MAAM,UAAU,IAAI,IAAI;EAAC;EAAU;EAAO;EAAO,CAAC;CAClD,IAAI,SAAS;CACb,IAAI,UAAU;AACd,MAAK,MAAM,QAAQ,QAAQ,QAAQ,MAAM,EAAE;AACzC,MAAI,OAAO,SAAS,YAAY,CAAC,QAAQ,IAAI,KAAK,CAChD,OAAM,IAAI,UAAU,GAAG,MAAM,yDAAyD;EACxF,MAAM,aAAa,OAAO,yBAAyB,OAAO,KAAK;AAC/D,MAAI,CAAC,YAAY,cAAc,EAAE,WAAW,YAC1C,OAAM,IAAI,UAAU,GAAG,MAAM,gEAAgE;AAC/F,YAAU,QAAqC,WAAW;AAC1D,MAAI,SAAS,MAAO,UAAS;AAC7B,MAAI,SAAS,OAAQ,WAAU;;AAEjC,KAAI,CAAC,aAAa,UAAU,OAAO,CACjC,OAAM,IAAI,UAAU,GAAG,MAAM,wDAAwD;AACvF,KAAI,WAAW,QACb,OAAM,IAAI,UACR,GAAG,MAAM,oEACV;CACH,MAAM,WAAW;CACjB,MAAM,WAAW,WAAW,UAAU,MAAM,UAAU;AACtD,KAAI,OAAO,aAAa,WACtB,OAAM,IAAI,UAAU,GAAG,MAAM,wDAAwD;AACvF,uBAAsB,UAAU,QAAQ,GAAG,MAAM,kCAAkC;AACnF,QAAO,WACH;EACE,MAAM;EACN,YAAY,UAAU;EACtB,QAAQ;EACT,GACD;EACE,MAAM;EACN,YAAY,UAAU;EACtB,QAAQ;EACT;;AAGP,MAAa,4BACX,QACA,iBACA,UAC8B;CAC9B,MAAM,UAAqC,EAAE;CAC7C,MAAM,cAAqC,CAAC,OAAO;AACnD,KAAI,oBAAoB,KAAA,EACtB,QAAO,OAAO,OAAO;EACnB,SAAS,OAAO,OAAO,QAAQ;EAC/B,aAAa,OAAO,OAAO,YAAY;EACxC,CAAC;AACJ,MAAK,MAAM,EAAE,MAAM,OAAO,gBAAgB,2BAA2B,iBAAiB,MAAM,EAAE;AAC5F,MAAI,aAAa,WAAW,EAAE;AAC5B,WAAQ,KAAK,OAAO,OAAO;IAAE;IAAM,MAAM;IAAmB,YAAY;IAAY,CAAC,CAAC;AACtF,eAAY,KAAK,WAAW;AAC5B;;EAEF,MAAM,UAAU,yBAAyB,YAAY,MAAM;AAC3D,UAAQ,KAAK,OAAO,OAAO;GAAE;GAAM,GAAG;GAAS,CAAC,CAAC;AACjD,cAAY,KAAK,QAAQ,WAAW;;AAEtC,QAAO,OAAO,OAAO;EACnB,SAAS,OAAO,OAAO,QAAQ;EAC/B,aAAa,OAAO,OAAO,YAAY;EACxC,CAAC;;AAGJ,MAAM,eACJ,YACA,OACA,QACuB;CACvB,MAAM,SAAS,WAAW,OAAO,OAAO,IAAI;AAC5C,mBAAkB,OAAO;AACzB,KAAI,WAAW,KAAA,EAAW,QAAO,KAAA;AACjC,KAAI,OAAO,WAAW,SACpB,OAAM,IAAI,UAAU,8DAA8D;AACpF,QAAO;;AAGT,MAAM,gBACJ,YACA,OACA,QACsB;CACtB,MAAM,SAAS,WAAW,OAAO,OAAO,IAAI;AAC5C,mBAAkB,OAAO;AACzB,KAAI,CAAC,MAAM,QAAQ,OAAO,CACxB,OAAM,IAAI,UAAU,6DAA6D;CACnF,MAAM,uBAAO,IAAI,KAAa;AAC9B,MAAK,MAAM,YAAY,QAAQ;AAC7B,MAAI,OAAO,aAAa,SACtB,OAAM,IAAI,UAAU,2DAA2D;AACjF,MAAI,KAAK,IAAI,SAAS,CACpB,OAAM,IAAI,UAAU,6DAA6D;AACnF,OAAK,IAAI,SAAS;;AAEpB,QAAO;;AAkBT,MAAM,cAAiD,OAAO,OAC5D,OAAO,OAAO,KAAK,CACpB;AAED,MAAa,gCACX,aAC2B;CAgB3B,MAAM,SAA4B,SAAS,QAAQ,KAAK,OAAO,UAC7D,MAAM,SAAS,WACX;EAAE,MAAM;EAAU;EAAO,aAAa,QAAQ;EAAG,UAAU;EAAI,aAAa,KAAA;EAAW,GACvF;EACE,MAAM;EACN;EACA,aAAa,QAAQ;EACrB,UAAU,mBAAmB;EAC7B,UAAU;EACX,CACN;CACD,IAAI,iBAAiB;AAErB,QAAO;EACL,QAAQ,SAAS,OAAO;AACtB,QAAK,MAAM,SAAS,QAAQ;AAC1B,QAAI,MAAM,SAAS,SAAU;IAC7B,MAAM,SAAS,QAAQ,MAAM;AAC7B,QAAI,SAAS,MAAM,aAAa,OAAO,SACrC,OAAM,cAAc,wBAAwB,OAAO;;;EAGzD,QAAQ,aAAa,WAAW,SAAS;AACvC,OAAI,CAAC,OAAO,OAAQ,QAAO;GAC3B,MAAM,SAAS,OAAO,OAAO,KAAK;AAClC,QAAK,MAAM,SAAS,QAAQ;AAC1B,QAAI,MAAM,SAAS,UAAU;AAC3B,YAAO,MAAM,MAAM,QAAQ,MAAM;AACjC;;IAEF,MAAM,aAAa,MAAM;IACzB,MAAM,SAAS,QAAQ,MAAM;AAC7B,QAAI,OAAO,SAAS,aAClB,OAAM,IAAI,UAAU,gEAAgE;AACtF,QAAI,WAAW,SAAS,OAAO;KAC7B,MAAM,WAAW,YAAY,YAAY,aAAa,UAAU;AAChE,WAAM,SAAS,WAAW,WAAW,SAAS;AAC9C,YAAO,WAAW,QAAQ,aAAa,KAAA,IAAY,KAAA,IAAY,OAAO,KAAK,IAAI,SAAS;AACxF;;IAEF,MAAM,OAAO,aAAa,YAAY,aAAa,UAAU;AAC7D,UAAM,SAAS,QAAQ,WAAW,KAAK;IACvC,MAAM,2BAAW,IAAI,KAAsB;AAC3C,SAAK,MAAM,OAAO,KAAM,KAAI,OAAO,KAAK,IAAI,IAAI,CAAE,UAAS,IAAI,KAAK,OAAO,KAAK,IAAI,IAAI,CAAC;AACzF,WAAO,WAAW,QAAQ,eAAe,QAAQ,SAAS,CAAC;;AAE7D,UAAO,OAAO,OAAO,OAAO;;EAE9B,cAAc,QAAQ;AACpB,UAAO,mBAAmB,OAAO;;EAEnC,mBAAmB,SAAS,OAAO;GACjC,IAAI,MAAM;AACV,QAAK,MAAM,SAAS,QAAQ;IAC1B,MAAM,SAAS,QAAQ,MAAM;AAC7B,QAAI,MAAM,aAAa,OAAO,SAAU;AACrB,UAAM;AACzB,QAAI,MAAM,SAAS,UAAU;AAC3B,WAAM;AACN;;AAEF,QAAI,OAAO,SAAS,gBAAgB,CAAC,OAAO,UAAU,OAAO,OAAO,SAAS,SAAS;AACpF,WAAM;AACN;;AAEF,SAAK,MAAM,SAAS,OAAO,OAAO,MAChC,MAAK,MAAM,aAAa,MAAM,SAAS,QAAQ,MAAM,IAAI,IAAI,EAAE,CAAE,OAAM,IAAI,UAAU;AACvF,SAAK,MAAM,SAAS,OAAO,OAAO,QAChC,MAAK,MAAM,aAAa,MAAM,SAAS,QAAQ,MAAM,IAAI,IAAI,EAAE,CAAE,OAAM,IAAI,UAAU;AACvF,SAAK,MAAM,SAAS,OAAO,OAAO,QAChC,MAAK,MAAM,aAAa,MAAM,SAAS,QAAQ,MAAM,IAAI,IAAI,EAAE,CAAE,OAAM,IAAI,UAAU;;AAEzF,UAAO;;EAET,OAAO,WAAW;AAChB,QAAK,MAAM,SAAS,OAAQ,KAAI,MAAM,SAAS,UAAW,OAAM,SAAS,OAAO,UAAU;;EAE5F,gBAAgB;AACd,QAAK,MAAM,SAAS,OAAQ,KAAI,MAAM,SAAS,UAAW,OAAM,SAAS,OAAO;;EAElF,SAAS,SAAS;AAChB,oBAAiB,QAAQ,IAAI,YAAY;AACzC,QAAK,MAAM,SAAS,OAAQ,OAAM,WAAW,QAAQ,MAAM,aAAa;;EAE1E,UAAU;AACR,QAAK,MAAM,SAAS,QAAQ;AAC1B,UAAM,WAAW;AACjB,QAAI,MAAM,SAAS,SAAU,OAAM,cAAc,KAAA;QAC5C,OAAM,SAAS,OAAO;;AAE7B,oBAAiB;;EAEpB;;;;ACvUH,MAAa,cAAc,OAAO,yBAAyB;;AAsB3D,MAAa,wBACX,eAC0B;AAC1B,uBAAsB,WAAW,QAAQ,GAAG,WAAW,KAAK,SAAS;CACrE,MAAM,WAAW,yBACf,WAAW,QACX,WAAW,cACX,WAAW,KACZ;CACD,MAAM,CAAC,cAAc,gBAAgB;EACnC,cAAc,SAAS;EACvB,SAAS,CACP;GACE,MAAM;GACN,UAAW,WAAW,YAAY,OAAO;GAI1C,CACF;EACD,cAAc;GACZ,MAAM,eAAe,6BAA6B,SAAS;GAC3D,MAAM,yBAAS,IAAI,KAAoB;GAEvC,MAAM,aAAa,QAAsB;AACvC,WAAO,OAAO,IAAI;AAClB,iBAAa,OAAO,IAAI;;AAG1B,UAAO;IACL,WAAU,eAAc;KACtB,MAAM,SAAS,WAAW,QAAQ;KAClC,MAAM,SAAS,WAAW,QAAQ;AAClC,SAAI,OAAO,SAAS,gBAAgB,OAAO,SAAS,aAClD,OAAM,IAAI,MAAM,GAAG,WAAW,KAAK,wCAAwC;AAC7E,kBAAa,QAAQ,WAAW,SAAS,WAAW,MAAM;KAE1D,MAAM,YAAY,KAAa,UAAoB;AACjD,UAAI,OAAO,IAAI,IAAI,CAAE,QAAO,OAAO,IAAI,IAAI;MAC3C,MAAM,QAAQ,WAAW,QACrB,WAAW,MAAM,OAAO,IAAS,GAChC,KAAA;AACL,wBAAkB,MAAM;AACxB,UAAI,WAAW,MAAO,QAAO,IAAI,KAAK,MAAM;AAC5C,aAAO;;KAGT,MAAM,WAAW,QAAyB;AACxC,UAAI,CAAC,OAAO,KAAK,IAAI,IAAI,CAAE,QAAO;MAClC,MAAM,QAAQ,OAAO,KAAK,IAAI,IAAI;MAClC,MAAM,gBAAgB,OAAO,SAAS,IAAI,IAAI;MAC9C,MAAM,OAAO,WAAW,SAAS;OAC1B;OACL;OACA,cAAc,aAAa,QAAQ,OAAO,KAAK,WAAW,QAAQ;OAClE,OAAO,SAAS,KAAK,MAAM;OAC3B,OAAO,WAAW;OAClB,OAAO,WAAW;OACnB,CAAC;AACF,wBAAkB,KAAK;AACvB,UAAI,SAAS,YAAa,QAAO,OAAO,OAAO,IAAI;UAC9C,QAAO,OAAO,IAAI,KAAK,KAAK;AACjC,aAAO,kBAAkB,OAAO,KAAK,IAAI,IAAI;;AAG/C,SAAI,WAAW,OAAO;AACpB,mBAAa,eAAe;MAC5B,MAAM,MAAM,OAAO,KAAK,KAAK;AAC7B,WAAK,MAAM,OAAO,OAAO,MAAM,CAAE,KAAI,CAAC,OAAO,KAAK,IAAI,IAAI,CAAE,QAAO,OAAO,IAAI;AAC9E,WAAK,MAAM,OAAO,IAAK,SAAQ,IAAI;AACnC,aAAO,OAAO,MAAM,IAAI,QAAO,QAAO,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC;AAC5D,mBAAa,SAAS,WAAW,QAAQ;AACzC;;KAGF,MAAM,wBAAQ,IAAI,KAAa;KAC/B,IAAI,MAAM;KACV,IAAI,cAAc;KAClB,IAAI,oBAAoB;AACxB,SAAI,aAAa,cAAc,OAAO,EAAE;MACtC,MAAM,SAAS,OAAO;AACtB,UAAI,CAAC,UAAU,OAAO,SAAS,SAAS;AACtC,aAAM;AACN,qBAAc;AACd,YAAK,MAAM,OAAO,OAAO,SAAS,KAAK,EAAE;AACvC,YAAI,OAAO,KAAK,IAAI,IAAI,CAAE;AAC1B,eAAO,OAAO,OAAO,IAAI;AACzB,kBAAU,IAAI;AACd,4BAAoB;;aAEjB;AACL,YAAK,MAAM,SAAS,OAAO,SAAS;AAClC,8BAAsB,OAAO,SAAS,IAAI,MAAM,IAAI;AACpD,eAAO,OAAO,OAAO,MAAM,IAAI;AAC/B,kBAAU,MAAM,IAAI;AACpB,cAAM,OAAO,MAAM,IAAI;;AAEzB,YAAK,MAAM,SAAS,OAAO,MAAO,OAAM,IAAI,MAAM,IAAI;AACtD,YAAK,MAAM,SAAS,OAAO,QAAS,OAAM,IAAI,MAAM,IAAI;AACxD,qBAAc,QAAQ,OAAO,MAAM;;;AAIvC,aAAQ,aAAa,mBAAmB,WAAW,SAAS,MAAM;AAClE,SAAI,IAAK,MAAK,MAAM,OAAO,OAAO,KAAK,KAAK,CAAE,OAAM,IAAI,IAAI;AAC5D,UAAK,MAAM,OAAO,OAAO;MACvB,MAAM,oBAAoB,QAAQ,IAAI;AACtC,4BAAsB;;AAExB,SAAI,eAAe,kBACjB,QAAO,OAAO,MAAM,OAAO,KAAK,KAAK,CAAC,QAAO,QAAO,OAAO,KAAK,IAAI,IAAI,CAAC,CAAC;AAC5E,kBAAa,SAAS,WAAW,QAAQ;;IAE3C,eAAe;AACb,YAAO,OAAO;AACd,kBAAa,SAAS;;IAEzB;;EAEH,MAAM,WAAW;EAClB,CAAC;AACF,QAAO"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "doxum",
-  "version": "0.1.28",
+  "version": "0.1.30",
   "private": false,
   "license": "MIT",
   "description": "Doxum is a typed runtime for complex mutable documents.",
@@ -82,7 +82,8 @@
     "build": "tsdown --config tsdown.config.ts && node scripts/check-build-exports.mjs && pnpm run check:declaration-portability",
     "typecheck": "tsc -p tsconfig.json --noEmit",
     "test": "vitest run --config vitest.config.ts",
-    "check": "pnpm run format:check && pnpm run lint && pnpm run typecheck && pnpm run check:public-types && pnpm run test && pnpm run check:projection-surface && pnpm run check:runtime-imports",
+    "check": "pnpm run format:check && pnpm run lint && pnpm run typecheck && pnpm run check:public-types && pnpm run test && pnpm run check:runtime-skill && pnpm run check:projection-surface && pnpm run check:runtime-imports",
+    "check:runtime-skill": "node scripts/check-runtime-skill.mjs",
     "check:projection-surface": "node scripts/check-projection-surface.mjs",
     "check:runtime-imports": "node scripts/check-runtime-imports.mjs",
     "check:public-types": "tsc -p tsconfig.public-api.json --noEmit",