doxum 0.1.7 → 0.1.9

package/dist/issue-DVaGQGeP.js

@@ -0,0 +1,576 @@
+const profile = {
+	projection: (key, amount = 1) => {},
+	recorder: (key, amount = 1) => {},
+	access: (key) => {},
+	copy: { structure: () => {} },
+	equality: {
+		call: () => {},
+		container: () => {}
+	},
+	address: {
+		listIndex: (items) => {},
+		schemaStep: () => {},
+		documentStep: () => {},
+		arrayCopied: () => {},
+		prefixComparison: () => {},
+		segmentCompared: () => {}
+	},
+	impact: {
+		index: () => {},
+		affects: () => {}
+	},
+	collectionView: {
+		mapped: () => {},
+		idsScanned: (amount = 1) => {},
+		arrayCopied: () => {}
+	},
+	materialized: {
+		updated: () => {},
+		rebuilt: () => {},
+		notification: () => {}
+	}
+};
+//#endregion
+//#region core/src/mutation/anchor.ts
+const equal = (left, right) => {
+	profile.equality.call();
+	if (left === right) return true;
+	profile.equality.container();
+	if (left.length !== right.length) return false;
+	for (let i = 0; i < left.length; i++) if (left[i] !== keyAt(right, i)) return false;
+	return true;
+};
+const length = (keys) => keys.length;
+const keyAt = (keys, index) => Array.isArray(keys) ? keys[index] : keys.at(index);
+const keyIndex = (keys, key) => Array.isArray(keys) ? keys.indexOf(key) : keys.index(key);
+const keys = (values, keyOf) => ({
+	length: values.length,
+	at: (index) => index >= 0 && index < values.length ? keyOf(values[index]) : void 0,
+	index: (key) => {
+		for (let index = 0; index < values.length; index += 1) if (keyOf(values[index]) === key) return index;
+		return -1;
+	}
+});
+const listIndexes = /* @__PURE__ */ new WeakMap();
+/** Canonical lists keep their key positions until a structural write invalidates them. */
+const indexedKeys = (values, keyOf) => {
+	const cached = listIndexes.get(values);
+	if (cached?.keyOf === keyOf) return cached.order;
+	let positions;
+	const order = {
+		length: values.length,
+		at: (index) => index >= 0 && index < values.length ? keyOf(values[index]) : void 0,
+		index: (key) => {
+			if (!positions) {
+				positions = /* @__PURE__ */ new Map();
+				for (let i = 0; i < values.length; i++) positions.set(keyOf(values[i]), i);
+				profile.address.listIndex(values.length);
+			}
+			return positions.get(key) ?? -1;
+		}
+	};
+	listIndexes.set(values, {
+		keyOf,
+		order
+	});
+	return order;
+};
+/** Structural sequence writes own invalidation, including rollback writes. */
+const insert = (values, index, value) => {
+	values.splice(index, 0, value);
+	listIndexes.delete(values);
+};
+const remove = (values, index) => {
+	values.splice(index, 1);
+	listIndexes.delete(values);
+};
+const move = (values, from, to) => {
+	const [value] = values.splice(from, 1);
+	values.splice(to, 0, value);
+	listIndexes.delete(values);
+};
+const install = (values, keyOf, order) => {
+	const byKey = /* @__PURE__ */ new Map();
+	for (const value of values) byKey.set(keyOf(value), value);
+	values.length = order.length;
+	for (let index = 0; index < order.length; index++) values[index] = byKey.get(order[index]);
+	listIndexes.delete(values);
+};
+const matches = (order, members) => {
+	if (order.length !== members.length) return false;
+	const ids = new Set(order);
+	return ids.size === order.length && members.every((id) => ids.has(id));
+};
+const index = (keys, anchor) => {
+	if (!anchor) return length(keys);
+	if ("at" in anchor) return anchor.at === "start" ? 0 : length(keys);
+	if ("before" in anchor) return keyIndex(keys, anchor.before);
+	return keyIndex(keys, anchor.after) + 1;
+};
+const valid = (keys, anchor) => {
+	if (!anchor) return true;
+	if (typeof anchor !== "object" || anchor === null) return false;
+	if (Number("at" in anchor) + Number("before" in anchor) + Number("after" in anchor) !== 1) return false;
+	if ("at" in anchor) return anchor.at === "start" || anchor.at === "end";
+	return keyIndex(keys, "before" in anchor ? anchor.before : anchor.after) >= 0;
+};
+const afterRemove = (keys, removedIndex, anchor) => {
+	const position = index(keys, anchor);
+	return position > removedIndex ? position - 1 : position;
+};
+//#endregion
+//#region core/src/value/ownership.ts
+const isPlainObject = (value) => {
+	if (value === null || typeof value !== "object") return false;
+	const prototype = Object.getPrototypeOf(value);
+	return prototype === Object.prototype || prototype === null;
+};
+const isRecord$1 = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+//#endregion
+//#region core/src/mutation/tree.ts
+const node = (tree, id) => Object.hasOwn(tree.nodes, id) ? tree.nodes[id] : void 0;
+const is = (value) => isRecord$1(value) && isRecord$1(value.nodes);
+const validNode = (value) => {
+	if (!isRecord$1(value) || !Array.isArray(value.children)) return false;
+	if (value.parentId !== void 0 && typeof value.parentId !== "string") return false;
+	const children = /* @__PURE__ */ new Set();
+	for (const id of value.children) {
+		if (typeof id !== "string" || children.has(id)) return false;
+		children.add(id);
+	}
+	return true;
+};
+const contains$1 = (tree, id) => Object.hasOwn(tree.nodes, id);
+const parent = (tree, id) => node(tree, id)?.parentId;
+const children = (tree, id) => node(tree, id)?.children;
+const validate = (value) => {
+	if (!is(value)) return false;
+	const ids = Object.keys(value.nodes);
+	if (ids.length === 0) return value.rootId === void 0;
+	if (typeof value.rootId !== "string" || !Object.hasOwn(value.nodes, value.rootId)) return false;
+	for (const id of ids) {
+		const entry = value.nodes[id];
+		if (!validNode(entry)) return false;
+		if (id === value.rootId) {
+			if (entry.parentId !== void 0) return false;
+		} else if (entry.parentId === void 0 || !Object.hasOwn(value.nodes, entry.parentId)) return false;
+		for (const child of entry.children) {
+			const childNode = value.nodes[child];
+			if (!childNode || childNode.parentId !== id) return false;
+		}
+	}
+	const seen = /* @__PURE__ */ new Set();
+	const stack = [value.rootId];
+	while (stack.length) {
+		const id = stack.pop();
+		if (seen.has(id)) return false;
+		seen.add(id);
+		const entry = value.nodes[id];
+		if (!entry) return false;
+		for (const child of entry.children) stack.push(child);
+	}
+	return seen.size === ids.length;
+};
+//#endregion
+//#region core/src/address.ts
+const registries = /* @__PURE__ */ new WeakMap();
+const registryNode = () => ({ static: /* @__PURE__ */ new Map() });
+const registryFor = (schema) => {
+	const cached = registries.get(schema);
+	if (cached) return cached;
+	const registry = {
+		root: registryNode(),
+		nextPath: 0
+	};
+	registries.set(schema, registry);
+	return registry;
+};
+const isRecord = (value) => typeof value === "object" && value !== null && !Array.isArray(value);
+const variantNode = (node, value) => {
+	const tag = isRecord(value) && typeof value[node.tag] === "string" ? value[node.tag] : void 0;
+	return node.variants[String(tag ?? Object.keys(node.variants)[0] ?? "")];
+};
+const step = (nodeInput, value, segment) => {
+	let node = nodeInput;
+	if (!node) return void 0;
+	if (node.kind === "variant") node = variantNode(node, value);
+	if (!node) return void 0;
+	if (node.kind === "object") return Object.hasOwn(node.shape, segment) ? node.shape[segment] : void 0;
+	if (node.kind === "table" || node.kind === "map") return node.value;
+	if (node.kind === "list") return node.value;
+};
+const pathFor = (schema, address, document) => {
+	const registry = registryFor(schema);
+	let trie = registry.root;
+	let node = schema;
+	let value = document;
+	for (const segment of address) {
+		profile.address.schemaStep();
+		profile.address.documentStep();
+		const resolved = step(node, value, segment);
+		if (!resolved) return void 0;
+		trie = node && (node.kind === "table" || node.kind === "map" || node.kind === "list" || node.kind === "tree") ? trie.dynamic ??= registryNode() : (() => {
+			const existing = trie.static.get(segment);
+			if (existing) return existing;
+			const created = registryNode();
+			trie.static.set(segment, created);
+			return created;
+		})();
+		value = readSegment(value, segment, node);
+		node = resolved;
+	}
+	if (trie.path === void 0) trie.path = registry.nextPath++;
+	return trie.path;
+};
+const resolveAddress = (schema, address, document) => {
+	if (!Array.isArray(address)) return void 0;
+	for (const segment of address) if (typeof segment !== "string") return void 0;
+	profile.address.arrayCopied();
+	const owned = Object.freeze(address.slice());
+	const path = pathFor(schema, owned, document);
+	return path === void 0 ? void 0 : {
+		path,
+		address: owned
+	};
+};
+const nodeAt = (schema, address, document) => {
+	let node = schema;
+	let value = document;
+	for (const segment of address) {
+		const resolved = step(node, value, segment);
+		value = readSegment(value, segment, node);
+		node = resolved;
+		if (!node) return void 0;
+	}
+	return node;
+};
+const readSegment = (value, segment, node) => {
+	if (!isRecord(value) && !Array.isArray(value)) return void 0;
+	if (node?.kind === "list" && Array.isArray(value)) return value[indexedKeys(value, node.keyOf).index(segment)];
+	if (node?.kind === "table" && isRecord(value) && isRecord(value.byId)) return Object.hasOwn(value.byId, segment) ? value.byId[segment] : void 0;
+	return Object.prototype.hasOwnProperty.call(value, segment) ? value[segment] : void 0;
+};
+const read = (root, address, schema) => {
+	let value = root;
+	let node = schema;
+	for (const segment of address) {
+		const next = step(node, value, segment);
+		value = readSegment(value, segment, node);
+		node = next;
+		if (value === void 0) return void 0;
+	}
+	return value;
+};
+const compiledObjects = /* @__PURE__ */ new WeakMap();
+const compiledEntries = /* @__PURE__ */ new WeakMap();
+const compiledShape = (node, value) => {
+	const branch = node.kind === "variant" ? variantNode(node, value) : node;
+	if (branch?.kind !== "object") return void 0;
+	const shape = branch.shape;
+	let layout = compiledObjects.get(shape);
+	if (!layout) {
+		const compiled = /* @__PURE__ */ new Map();
+		for (const key of Object.keys(shape).sort()) {
+			profile.address.schemaStep();
+			compiled.set(key, {
+				kind: "fixed",
+				key,
+				node: shape[key],
+				field: shape[key].kind === "field",
+				slot: compiled.size
+			});
+		}
+		layout = {
+			kind: "fixed",
+			members: compiled
+		};
+		compiledObjects.set(shape, layout);
+	}
+	return layout;
+};
+const resolveContainer = (owner, generation, at, node, value) => {
+	if (!node || !isRecord(value) && !Array.isArray(value)) return void 0;
+	const parent = node.kind === "table" && isRecord(value) ? value.byId : value;
+	if (!isRecord(parent) && !Array.isArray(parent)) return void 0;
+	if (node.kind === "tree") return void 0;
+	let layout;
+	if (node.kind === "map" || node.kind === "table" || node.kind === "list") {
+		let dynamic = compiledEntries.get(node);
+		if (!dynamic) {
+			dynamic = {
+				kind: "dynamic",
+				entry: {
+					kind: "entry",
+					node: node.value,
+					field: node.value.kind === "field"
+				}
+			};
+			compiledEntries.set(node, dynamic);
+		}
+		layout = dynamic;
+	} else {
+		const fixed = compiledShape(node, value);
+		if (!fixed) return void 0;
+		layout = fixed;
+	}
+	return {
+		owner,
+		generation,
+		at,
+		node,
+		parent,
+		value,
+		layout
+	};
+};
+const resolveTreeContainer = (owner, generation, at, node, value) => node?.kind === "tree" && is(value) ? {
+	owner,
+	generation,
+	at,
+	node,
+	value
+} : void 0;
+const memberKey = (container, key) => container.node.kind === "list" ? indexedKeys(container.parent, container.node.keyOf).index(key) : key;
+/** One recent path per transaction; structural writes invalidate all retained locations. */
+const createAddressResolver = (schema, root) => {
+	const prefix = [];
+	return {
+		container: (owner, generation, at) => {
+			if (!at.length) return resolveContainer(owner, generation, at, schema, root);
+			const location = resolveWithPrefix(schema, root, at, prefix);
+			if (!location || !Object.hasOwn(location.parent, location.key)) return void 0;
+			return resolveContainer(owner, generation, at, location.node, location.parent[location.key]);
+		},
+		invalidate: () => {
+			prefix.length = 0;
+		}
+	};
+};
+/** A subtree root is a value, not a fabricated member of an ObjectNode. */
+const resolveValue = (schema, root, address, prefix) => {
+	if (!address.length) return {
+		node: schema,
+		value: root
+	};
+	const location = resolveWithPrefix(schema, root, address, prefix);
+	return location && {
+		node: location.node,
+		value: Object.hasOwn(location.parent, location.key) ? location.parent[location.key] : void 0
+	};
+};
+/** Resolves schema and document location in one address traversal. */
+const resolveLocated = (schema, root, address) => resolveWithPrefix(schema, root, address);
+const resolveWithPrefix = (schema, root, address, prefix) => {
+	if (address.length === 0) return void 0;
+	let node = schema;
+	let current = root;
+	let start = 0;
+	if (prefix) {
+		while (start < prefix.length && start < address.length - 1 && prefix[start].segment === address[start]) start++;
+		prefix.length = start;
+		if (start) {
+			const retained = prefix[start - 1];
+			node = retained.node;
+			current = retained.value;
+		}
+	}
+	let cacheable = true;
+	for (let index = start; index < address.length - 1; index += 1) {
+		profile.address.schemaStep();
+		profile.address.documentStep();
+		const resolved = step(node, current, address[index]);
+		if (!resolved) return void 0;
+		if (node?.kind !== "object" && node?.kind !== "table" && node?.kind !== "map") cacheable = false;
+		current = readSegment(current, address[index], node);
+		node = resolved;
+		if (prefix && cacheable) prefix.push({
+			segment: address[index],
+			node: resolved,
+			value: current
+		});
+		if (!node) return void 0;
+	}
+	const last = address[address.length - 1];
+	return resolveChild(node, current, last);
+};
+/** Resolves one member from an already current schema/container pair. */
+const resolveChild = (node, current, last) => {
+	profile.address.schemaStep();
+	profile.address.documentStep();
+	const resolved = step(node, current, last);
+	if (!resolved || !isRecord(current) && !Array.isArray(current)) return void 0;
+	if (node?.kind === "table" && isRecord(current) && isRecord(current.byId)) return {
+		node: resolved,
+		parent: current.byId,
+		key: last
+	};
+	return {
+		node: resolved,
+		parent: current,
+		key: node?.kind === "list" && Array.isArray(current) ? indexedKeys(current, node.keyOf).index(last) : last
+	};
+};
+const contains = (parent, child) => {
+	profile.address.prefixComparison();
+	if (parent.length > child.length) return false;
+	for (let index = 0; index < parent.length; index += 1) {
+		profile.address.segmentCompared();
+		if (parent[index] !== child[index]) return false;
+	}
+	return true;
+};
+const overlaps = (a, b) => contains(a, b) || contains(b, a);
+const debugKey = (address) => {
+	let result = "";
+	for (let index = 0; index < address.length; index += 1) {
+		if (index > 0) result += "/";
+		result += address[index].replaceAll("~", "~~").replaceAll("/", "~/");
+	}
+	return result;
+};
+/** An index over canonical address segments, shared by impact and subscriptions. */
+var AddressIndex = class {
+	root = {
+		children: /* @__PURE__ */ new Map(),
+		values: /* @__PURE__ */ new Set()
+	};
+	add(address, value, member) {
+		let node = this.root;
+		for (let i = 0; i < address.length + (member === void 0 ? 0 : 1); i++) {
+			const segment = i < address.length ? address[i] : member;
+			let child = node.children.get(segment);
+			if (!child) {
+				child = {
+					children: /* @__PURE__ */ new Map(),
+					values: /* @__PURE__ */ new Set()
+				};
+				node.children.set(segment, child);
+			}
+			node = child;
+		}
+		node.values.add(value);
+	}
+	delete(address, value) {
+		const parents = [];
+		let node = this.root;
+		for (const segment of address) {
+			const child = node.children.get(segment);
+			if (!child) return;
+			parents.push(node);
+			node = child;
+		}
+		node.values.delete(value);
+		for (let i = address.length - 1; i >= 0 && !node.values.size && !node.children.size; i--) {
+			node = parents[i];
+			node.children.delete(address[i]);
+		}
+	}
+	exact(address) {
+		let node = this.root;
+		for (const segment of address) {
+			const child = node.children.get(segment);
+			if (!child) return void 0;
+			node = child;
+		}
+		return node.values;
+	}
+	hasAncestor(address, strict = false) {
+		let node = this.root;
+		for (let i = 0; i < address.length; i++) {
+			if (node.values.size) return true;
+			const child = node.children.get(address[i]);
+			if (!child) return false;
+			node = child;
+		}
+		return !strict && node.values.size > 0;
+	}
+	someAncestor(address, predicate) {
+		let node = this.root;
+		for (let i = 0;; i++) {
+			for (const value of node.values) if (predicate(value)) return true;
+			if (i === address.length) return false;
+			const child = node.children.get(address[i]);
+			if (!child) return false;
+			node = child;
+		}
+	}
+	overlaps(address) {
+		let node = this.root;
+		for (const segment of address) {
+			if (node.values.size) return true;
+			const child = node.children.get(segment);
+			if (!child) return false;
+			node = child;
+		}
+		return node.values.size > 0 || node.children.size > 0;
+	}
+	hasDescendant(address) {
+		let node = this.root;
+		for (const segment of address) {
+			const child = node.children.get(segment);
+			if (!child) return false;
+			node = child;
+		}
+		return node.values.size > 0 || node.children.size > 0;
+	}
+	query(visit, relation = "overlap") {
+		const visited = /* @__PURE__ */ new Set();
+		const subtrees = /* @__PURE__ */ new Set();
+		const values = (node) => {
+			if (visited.has(node)) return;
+			visited.add(node);
+			node.values.forEach(visit);
+		};
+		const descend = (current) => {
+			if (subtrees.has(current)) return;
+			subtrees.add(current);
+			values(current);
+			current.children.forEach(descend);
+		};
+		const terminal = (node) => relation === "ancestors" ? values(node) : descend(node);
+		return (address, members) => {
+			let node = this.root;
+			for (const segment of address) {
+				if (subtrees.has(node)) return;
+				if (relation !== "descendants") values(node);
+				const child = node.children.get(segment);
+				if (!child) return;
+				node = child;
+			}
+			if (!members) terminal(node);
+			else {
+				if (relation !== "descendants") values(node);
+				for (const member of members) {
+					const child = node.children.get(member.key);
+					if (child) terminal(child);
+				}
+			}
+		};
+	}
+	clear() {
+		this.root.values.clear();
+		this.root.children.clear();
+	}
+};
+//#endregion
+//#region core/src/mutation/issue.ts
+const at = (address, code, message) => Object.freeze({
+	source: "mutation",
+	code,
+	address: Object.freeze([...address]),
+	message
+});
+var MutationRejected = class extends Error {
+	constructor(issue) {
+		super(issue.message);
+		this.issue = issue;
+	}
+};
+const fail = (address, code, message) => {
+	throw new MutationRejected(at(address, code, message));
+};
+const invalidValue = (issue, address = issue.address) => fail(address, issue.code === "missing-validator" ? "invalid-value" : issue.code, issue.message);
+//#endregion
+export { insert as A, validate as C, equal as D, afterRemove as E, remove as F, valid as I, profile as L, keys as M, matches as N, index as O, move as P, validNode as S, isRecord$1 as T, resolveTreeContainer as _, compiledShape as a, contains$1 as b, debugKey as c, overlaps as d, read as f, resolveLocated as g, resolveContainer as h, AddressIndex as i, install as j, indexedKeys as k, memberKey as l, resolveChild as m, fail as n, contains as o, resolveAddress as p, invalidValue as r, createAddressResolver as s, MutationRejected as t, nodeAt as u, resolveValue as v, isPlainObject as w, parent as x, children as y };
+
+//# sourceMappingURL=issue-DVaGQGeP.js.map

package/dist/issue-DVaGQGeP.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"issue-DVaGQGeP.js","names":["isRecord","isRecord","contains","anchor.indexedKeys","isTree"],"sources":["../core/src/profile.ts","../core/src/mutation/anchor.ts","../core/src/value/ownership.ts","../core/src/mutation/tree.ts","../core/src/address.ts","../core/src/mutation/issue.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 },\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    arraysCopied: 0,\n    listIndexes: 0,\n    listItems: 0,\n  },\n  impact: { affectsChecks: 0, indexes: 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  },\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    arrayCopied: () => {\n      if (active) active.address.arraysCopied++;\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  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 { DocumentAnchor } from '../schema';\nimport { profile } from '../profile';\n\nexport const equal = (left: readonly string[], right: Keys): boolean => {\n  profile.equality.call();\n  if (left === right) return true;\n  profile.equality.container();\n  if (left.length !== right.length) return false;\n  for (let i = 0; i < left.length; i++) if (left[i] !== keyAt(right, i)) return false;\n  return true;\n};\n\nexport type KeyOrder = {\n  readonly length: number;\n  readonly at: (index: number) => string | undefined;\n  readonly index: (key: string) => number;\n};\n\ntype Keys = readonly string[] | KeyOrder;\n\nconst length = (keys: Keys): number => keys.length;\nconst keyAt = (keys: Keys, index: number): string | undefined =>\n  Array.isArray(keys) ? keys[index] : keys.at(index);\nconst keyIndex = (keys: Keys, key: string): number =>\n  Array.isArray(keys) ? keys.indexOf(key) : (keys as KeyOrder).index(key);\n\nexport const keys = (values: readonly unknown[], keyOf: (value: unknown) => string): KeyOrder => ({\n  length: values.length,\n  at: index => (index >= 0 && index < values.length ? keyOf(values[index]) : undefined),\n  index: key => {\n    for (let index = 0; index < values.length; index += 1)\n      if (keyOf(values[index]) === key) return index;\n    return -1;\n  },\n});\n\nconst listIndexes = new WeakMap<\n  readonly unknown[],\n  { keyOf: (value: unknown) => string; order: KeyOrder }\n>();\n\n/** Canonical lists keep their key positions until a structural write invalidates them. */\nexport const indexedKeys = (\n  values: readonly unknown[],\n  keyOf: (value: unknown) => string\n): KeyOrder => {\n  const cached = listIndexes.get(values);\n  if (cached?.keyOf === keyOf) return cached.order;\n  let positions: Map<string, number> | undefined;\n  const order: KeyOrder = {\n    length: values.length,\n    at: index => (index >= 0 && index < values.length ? keyOf(values[index]) : undefined),\n    index: key => {\n      if (!positions) {\n        positions = new Map();\n        for (let i = 0; i < values.length; i++) positions.set(keyOf(values[i]), i);\n        profile.address.listIndex(values.length);\n      }\n      return positions.get(key) ?? -1;\n    },\n  };\n  listIndexes.set(values, { keyOf, order });\n  return order;\n};\n\n/** Structural sequence writes own invalidation, including rollback writes. */\nexport const insert = (values: unknown[], index: number, value: unknown): void => {\n  values.splice(index, 0, value);\n  listIndexes.delete(values);\n};\n\nexport const remove = (values: unknown[], index: number): void => {\n  values.splice(index, 1);\n  listIndexes.delete(values);\n};\n\nexport const move = (values: unknown[], from: number, to: number): void => {\n  const [value] = values.splice(from, 1);\n  values.splice(to, 0, value);\n  listIndexes.delete(values);\n};\n\nexport const install = (\n  values: unknown[],\n  keyOf: (value: unknown) => string,\n  order: readonly string[]\n): void => {\n  const byKey = new Map<string, unknown>();\n  for (const value of values) byKey.set(keyOf(value), value);\n  values.length = order.length;\n  for (let index = 0; index < order.length; index++) values[index] = byKey.get(order[index]);\n  listIndexes.delete(values);\n};\n\nexport const matches = (order: readonly string[], members: readonly string[]): boolean => {\n  if (order.length !== members.length) return false;\n  const ids = new Set(order);\n  return ids.size === order.length && members.every(id => ids.has(id));\n};\n\nexport const index = (keys: Keys, anchor?: DocumentAnchor): number => {\n  if (!anchor) return length(keys);\n  if ('at' in anchor) return anchor.at === 'start' ? 0 : length(keys);\n  if ('before' in anchor) return keyIndex(keys, anchor.before);\n  return keyIndex(keys, anchor.after) + 1;\n};\n\nexport const at = (keys: Keys, position: number): DocumentAnchor =>\n  position <= 0 ? { at: 'start' } : { after: keyAt(keys, position - 1) as string };\n\nexport const valid = (keys: Keys, anchor?: DocumentAnchor): boolean => {\n  if (!anchor) return true;\n  if (typeof anchor !== 'object' || anchor === null) return false;\n  if (Number('at' in anchor) + Number('before' in anchor) + Number('after' in anchor) !== 1)\n    return false;\n  if ('at' in anchor) return anchor.at === 'start' || anchor.at === 'end';\n  return keyIndex(keys, 'before' in anchor ? anchor.before : anchor.after) >= 0;\n};\n\nexport const afterRemove = (keys: Keys, removedIndex: number, anchor?: DocumentAnchor): number => {\n  const position = index(keys, anchor);\n  return position > removedIndex ? position - 1 : position;\n};\n\nexport const validPositions = (length: number, positions: readonly number[]): boolean => {\n  let previous = -1;\n  for (let index = 0; index < positions.length; index += 1) {\n    const position = positions[index];\n    if (\n      !Number.isInteger(position) ||\n      position < 0 ||\n      position <= previous ||\n      position > length + index\n    )\n      return false;\n    previous = position;\n  }\n  return true;\n};\n\nexport const restore = (\n  keys: string[],\n  inserted: readonly string[],\n  positions: readonly number[]\n): void => {\n  const currentLength = keys.length;\n  if (inserted.length !== positions.length || !validPositions(currentLength, positions))\n    throw new Error('Ordered restore positions are invalid.');\n  let readIndex = currentLength - 1;\n  let insertedIndex = inserted.length - 1;\n  keys.length = currentLength + inserted.length;\n  for (let writeIndex = keys.length - 1; writeIndex >= 0; writeIndex -= 1) {\n    if (insertedIndex >= 0 && positions[insertedIndex] === writeIndex) {\n      keys[writeIndex] = inserted[insertedIndex];\n      insertedIndex -= 1;\n    } else {\n      keys[writeIndex] = keys[readIndex];\n      readIndex -= 1;\n    }\n  }\n};\n","export const isPlainObject = (value: unknown): value is Record<string, unknown> => {\n  if (value === null || typeof value !== 'object') return false;\n  const prototype = Object.getPrototypeOf(value);\n  return prototype === Object.prototype || prototype === null;\n};\n\nexport const isRecord = (value: unknown): value is Record<string, unknown> =>\n  typeof value === 'object' && value !== null && !Array.isArray(value);\n","import { isRecord } from '../value/ownership';\nexport type MutableTreeNode = { parentId?: string; children: string[]; value?: unknown };\nexport type MutableTree = { rootId?: string; nodes: Record<string, MutableTreeNode> };\nconst node = (tree: MutableTree, id: string) =>\n  Object.hasOwn(tree.nodes, id) ? tree.nodes[id] : undefined;\nexport const is = (value: unknown): value is MutableTree =>\n  isRecord(value) && isRecord(value.nodes);\n\nexport const validNode = (value: unknown): value is MutableTreeNode => {\n  if (!isRecord(value) || !Array.isArray(value.children)) return false;\n  if (value.parentId !== undefined && typeof value.parentId !== 'string') return false;\n  const children = new Set<string>();\n  for (const id of value.children) {\n    if (typeof id !== 'string' || children.has(id)) return false;\n    children.add(id);\n  }\n  return true;\n};\n\nexport const contains = (tree: MutableTree, id: string): boolean => Object.hasOwn(tree.nodes, id);\n\nexport const parent = (tree: MutableTree, id: string): string | undefined =>\n  node(tree, id)?.parentId;\n\nexport const children = (tree: MutableTree, id: string): readonly string[] | undefined =>\n  node(tree, id)?.children;\n\nexport const validate = (value: unknown): value is MutableTree => {\n  if (!is(value)) return false;\n  const ids = Object.keys(value.nodes);\n  if (ids.length === 0) return value.rootId === undefined;\n  if (typeof value.rootId !== 'string' || !Object.hasOwn(value.nodes, value.rootId)) return false;\n\n  for (const id of ids) {\n    const entry = value.nodes[id];\n    if (!validNode(entry)) return false;\n    if (id === value.rootId) {\n      if (entry.parentId !== undefined) return false;\n    } else if (entry.parentId === undefined || !Object.hasOwn(value.nodes, entry.parentId))\n      return false;\n    for (const child of entry.children) {\n      const childNode = value.nodes[child];\n      if (!childNode || childNode.parentId !== id) return false;\n    }\n  }\n\n  const seen = new Set<string>();\n  const stack = [value.rootId];\n  while (stack.length) {\n    const id = stack.pop() as string;\n    if (seen.has(id)) return false;\n    seen.add(id);\n    const entry = value.nodes[id];\n    if (!entry) return false;\n    for (const child of entry.children) stack.push(child);\n  }\n  return seen.size === ids.length;\n};\n\nexport type TreePosition = { readonly parentId?: string; readonly index?: number };\n","import type { DocumentAddress, DocumentNode, ObjectNode, ObjectShape } from './schema';\nimport * as anchor from './mutation/anchor';\nimport { profile } from './profile';\nimport type { MutableTree } from './mutation/tree';\nimport { is as isTree } from './mutation/tree';\n\n/** The only resolved address representation used inside the runtime. */\nexport type AddressRef = {\n  readonly path: number;\n  readonly address: DocumentAddress;\n};\n\ntype RegistryNode = {\n  readonly static: Map<string, RegistryNode>;\n  dynamic?: RegistryNode;\n  path?: number;\n};\n\ntype Registry = {\n  readonly root: RegistryNode;\n  nextPath: number;\n};\n\nconst registries = new WeakMap<object, Registry>();\nconst registryNode = (): RegistryNode => ({ static: new Map() });\nconst registryFor = (schema: ObjectNode): Registry => {\n  const cached = registries.get(schema as object);\n  if (cached) return cached;\n  const registry: Registry = { root: registryNode(), nextPath: 0 };\n  registries.set(schema as object, registry);\n  return registry;\n};\n\nconst isRecord = (value: unknown): value is Record<string, unknown> =>\n  typeof value === 'object' && value !== null && !Array.isArray(value);\n\nconst variantNode = (\n  node: Extract<DocumentNode, { kind: 'variant' }>,\n  value: unknown\n): DocumentNode | undefined => {\n  const tag = isRecord(value) && typeof value[node.tag] === 'string' ? value[node.tag] : undefined;\n  return node.variants[String(tag ?? Object.keys(node.variants)[0] ?? '')];\n};\n\nconst step = (\n  nodeInput: DocumentNode | undefined,\n  value: unknown,\n  segment: string\n): DocumentNode | undefined => {\n  let node = nodeInput;\n  if (!node) return undefined;\n  if (node.kind === 'variant') {\n    node = variantNode(node, value);\n  }\n  if (!node) return undefined;\n  if (node.kind === 'object')\n    return Object.hasOwn(node.shape, segment) ? node.shape[segment] : undefined;\n  if (node.kind === 'table' || node.kind === 'map') return node.value;\n  // List items use stable keys; tree topology remains a structural unit.\n  if (node.kind === 'list') return node.value;\n  return undefined;\n};\n\nconst pathFor = (\n  schema: ObjectNode,\n  address: DocumentAddress,\n  document?: unknown\n): number | undefined => {\n  const registry = registryFor(schema);\n  let trie = registry.root;\n  let node: DocumentNode | undefined = schema;\n  let value: unknown = document;\n  for (const segment of address) {\n    profile.address.schemaStep();\n    profile.address.documentStep();\n    const resolved = step(node, value, segment);\n    if (!resolved) return undefined;\n    const next =\n      node &&\n      (node.kind === 'table' || node.kind === 'map' || node.kind === 'list' || node.kind === 'tree')\n        ? (trie.dynamic ??= registryNode())\n        : (() => {\n            const existing = trie.static.get(segment);\n            if (existing) return existing;\n            const created = registryNode();\n            trie.static.set(segment, created);\n            return created;\n          })();\n    trie = next;\n    value = readSegment(value, segment, node);\n    node = resolved;\n  }\n  if (trie.path === undefined) trie.path = registry.nextPath++;\n  return trie.path;\n};\n\nexport const resolveAddress = (\n  schema: ObjectNode,\n  address: DocumentAddress,\n  document?: unknown\n): AddressRef | undefined => {\n  if (!Array.isArray(address)) return undefined;\n  for (const segment of address) if (typeof segment !== 'string') return undefined;\n  profile.address.arrayCopied();\n  const owned = Object.freeze(address.slice()) as DocumentAddress;\n  const path = pathFor(schema, owned, document);\n  return path === undefined ? undefined : { path, address: owned };\n};\n\nexport const nodeAt = (\n  schema: DocumentNode,\n  address: DocumentAddress,\n  document?: unknown\n): DocumentNode | undefined => {\n  let node: DocumentNode | undefined = schema;\n  let value = document;\n  for (const segment of address) {\n    const resolved = step(node, value, segment);\n    value = readSegment(value, segment, node);\n    node = resolved;\n    if (!node) return undefined;\n  }\n  return node;\n};\n\nexport const readSegment = (value: unknown, segment: string, node?: DocumentNode): unknown => {\n  if (!isRecord(value) && !Array.isArray(value)) return undefined;\n  if (node?.kind === 'list' && Array.isArray(value))\n    return value[anchor.indexedKeys(value, node.keyOf).index(segment)];\n  if (node?.kind === 'table' && isRecord(value) && isRecord(value.byId)) {\n    return Object.hasOwn(value.byId, segment) ? value.byId[segment] : undefined;\n  }\n  return Object.prototype.hasOwnProperty.call(value, segment)\n    ? (value as Record<string, unknown>)[segment]\n    : undefined;\n};\n\nexport const read = (root: unknown, address: DocumentAddress, schema: DocumentNode): unknown => {\n  let value = root;\n  let node: DocumentNode | undefined = schema;\n  for (const segment of address) {\n    const next = step(node, value, segment);\n    value = readSegment(value, segment, node);\n    node = next;\n    if (value === undefined) return undefined;\n  }\n  return value;\n};\n\nexport type ResolvedAddress = {\n  readonly parent: Record<string, unknown> | unknown[];\n  readonly key: string | number;\n  readonly node: DocumentNode;\n};\n\ntype MemberDefinition = {\n  readonly node: DocumentNode;\n  readonly field: boolean;\n};\nexport type FixedMember = MemberDefinition & {\n  readonly kind: 'fixed';\n  readonly key: string;\n  readonly slot: number;\n};\ntype CollectionMember = MemberDefinition & { readonly kind: 'entry' };\nexport type CompiledMember = FixedMember | CollectionMember;\nexport type FixedLayout = {\n  readonly kind: 'fixed';\n  readonly members: ReadonlyMap<string, FixedMember>;\n};\ntype DynamicLayout = { readonly kind: 'dynamic'; readonly entry: CollectionMember };\nexport type MemberLayout = FixedLayout | DynamicLayout;\nconst compiledObjects = new WeakMap<object, FixedLayout>();\nconst compiledEntries = new WeakMap<DocumentNode, DynamicLayout>();\nexport const compiledShape = (node: DocumentNode, value: unknown): FixedLayout | undefined => {\n  const branch = node.kind === 'variant' ? variantNode(node, value) : node;\n  if (branch?.kind !== 'object') return undefined;\n  const shape: ObjectShape = branch.shape;\n  let layout = compiledObjects.get(shape);\n  if (!layout) {\n    const compiled = new Map<string, FixedMember>();\n    for (const key of Object.keys(shape).sort()) {\n      profile.address.schemaStep();\n      compiled.set(key, {\n        kind: 'fixed',\n        key,\n        node: shape[key],\n        field: shape[key].kind === 'field',\n        slot: compiled.size,\n      });\n    }\n    layout = { kind: 'fixed', members: compiled };\n    compiledObjects.set(shape, layout);\n  }\n  return layout;\n};\n\n/** Immutable location facts, valid only for the resolving session generation. */\nexport type ResolvedContainer = {\n  readonly owner: object;\n  readonly generation: number;\n  readonly at: DocumentAddress;\n  readonly node: Exclude<DocumentNode, { kind: 'tree' }>;\n  readonly parent: Record<string, unknown> | unknown[];\n  readonly value: unknown;\n  readonly layout: MemberLayout;\n};\nexport type ResolvedTreeContainer = {\n  readonly owner: object;\n  readonly generation: number;\n  readonly at: DocumentAddress;\n  readonly node: Extract<DocumentNode, { kind: 'tree' }>;\n  readonly value: MutableTree;\n};\nexport const resolveContainer = (\n  owner: object,\n  generation: number,\n  at: DocumentAddress,\n  node: DocumentNode | undefined,\n  value: unknown\n): ResolvedContainer | undefined => {\n  if (!node || (!isRecord(value) && !Array.isArray(value))) return undefined;\n  const parent = node.kind === 'table' && isRecord(value) ? value.byId : value;\n  if (!isRecord(parent) && !Array.isArray(parent)) return undefined;\n  if (node.kind === 'tree') return undefined;\n  let layout: MemberLayout;\n  if (node.kind === 'map' || node.kind === 'table' || node.kind === 'list') {\n    let dynamic = compiledEntries.get(node);\n    if (!dynamic) {\n      dynamic = {\n        kind: 'dynamic',\n        entry: { kind: 'entry', node: node.value, field: node.value.kind === 'field' },\n      };\n      compiledEntries.set(node, dynamic);\n    }\n    layout = dynamic;\n  } else {\n    const fixed = compiledShape(node, value);\n    if (!fixed) return undefined;\n    layout = fixed;\n  }\n  return { owner, generation, at, node, parent, value, layout };\n};\nexport const resolveTreeContainer = (\n  owner: object,\n  generation: number,\n  at: DocumentAddress,\n  node: DocumentNode | undefined,\n  value: unknown\n): ResolvedTreeContainer | undefined =>\n  node?.kind === 'tree' && isTree(value) ? { owner, generation, at, node, value } : undefined;\nexport const memberKey = (\n  container: { readonly node: DocumentNode; readonly parent: Record<string, unknown> | unknown[] },\n  key: string\n): string | number =>\n  container.node.kind === 'list'\n    ? anchor.indexedKeys(container.parent as unknown[], container.node.keyOf).index(key)\n    : key;\n\ntype ResolutionPrefix = {\n  segment: string;\n  node: DocumentNode;\n  value: unknown;\n};\n\n/** One recent path per transaction; structural writes invalidate all retained locations. */\nexport const createAddressResolver = (schema: DocumentNode, root: unknown) => {\n  const prefix: ResolutionPrefix[] = [];\n  return {\n    container: (owner: object, generation: number, at: DocumentAddress) => {\n      if (!at.length) return resolveContainer(owner, generation, at, schema, root);\n      const location = resolveWithPrefix(schema, root, at, prefix);\n      if (!location || !Object.hasOwn(location.parent, location.key)) return undefined;\n      return resolveContainer(\n        owner,\n        generation,\n        at,\n        location.node,\n        (location.parent as Record<string | number, unknown>)[location.key]\n      );\n    },\n    invalidate: () => {\n      prefix.length = 0;\n    },\n  };\n};\n\n/** A subtree root is a value, not a fabricated member of an ObjectNode. */\nexport const resolveValue = (\n  schema: DocumentNode,\n  root: unknown,\n  address: DocumentAddress,\n  prefix?: ResolutionPrefix[]\n): { node: DocumentNode; value: unknown } | undefined => {\n  if (!address.length) return { node: schema, value: root };\n  const location = resolveWithPrefix(schema, root, address, prefix);\n  return (\n    location && {\n      node: location.node,\n      value: Object.hasOwn(location.parent, location.key)\n        ? (location.parent as Record<string | number, unknown>)[location.key]\n        : undefined,\n    }\n  );\n};\n\n/** Resolves schema and document location in one address traversal. */\nexport const resolveLocated = (\n  schema: DocumentNode,\n  root: unknown,\n  address: DocumentAddress\n): ResolvedAddress | undefined => resolveWithPrefix(schema, root, address);\n\nconst resolveWithPrefix = (\n  schema: DocumentNode,\n  root: unknown,\n  address: DocumentAddress,\n  prefix?: ResolutionPrefix[]\n): ResolvedAddress | undefined => {\n  if (address.length === 0) return undefined;\n  let node: DocumentNode | undefined = schema;\n  let current: unknown = root;\n  let start = 0;\n  if (prefix) {\n    while (\n      start < prefix.length &&\n      start < address.length - 1 &&\n      prefix[start].segment === address[start]\n    )\n      start++;\n    prefix.length = start;\n    if (start) {\n      const retained = prefix[start - 1];\n      node = retained.node;\n      current = retained.value;\n    }\n  }\n  let cacheable = true;\n  for (let index = start; index < address.length - 1; index += 1) {\n    profile.address.schemaStep();\n    profile.address.documentStep();\n    const resolved = step(node, current, address[index]);\n    if (!resolved) return undefined;\n    if (node?.kind !== 'object' && node?.kind !== 'table' && node?.kind !== 'map')\n      cacheable = false;\n    current = readSegment(current, address[index], node);\n    node = resolved;\n    if (prefix && cacheable)\n      prefix.push({\n        segment: address[index],\n        node: resolved,\n        value: current,\n      });\n    if (!node) return undefined;\n  }\n  const last = address[address.length - 1];\n  return resolveChild(node, current, last);\n};\n\n/** Resolves one member from an already current schema/container pair. */\nexport const resolveChild = (\n  node: DocumentNode | undefined,\n  current: unknown,\n  last: string\n): ResolvedAddress | undefined => {\n  profile.address.schemaStep();\n  profile.address.documentStep();\n  const resolved = step(node, current, last);\n  if (!resolved || (!isRecord(current) && !Array.isArray(current))) return undefined;\n  if (node?.kind === 'table' && isRecord(current) && isRecord(current.byId))\n    return {\n      node: resolved,\n      parent: current.byId,\n      key: last,\n    };\n  return {\n    node: resolved,\n    parent: current,\n    key:\n      node?.kind === 'list' && Array.isArray(current)\n        ? anchor.indexedKeys(current, node.keyOf).index(last)\n        : last,\n  };\n};\n\nexport const contains = (parent: DocumentAddress, child: DocumentAddress): boolean => {\n  profile.address.prefixComparison();\n  if (parent.length > child.length) return false;\n  for (let index = 0; index < parent.length; index += 1) {\n    profile.address.segmentCompared();\n    if (parent[index] !== child[index]) return false;\n  }\n  return true;\n};\n\nexport const overlaps = (a: DocumentAddress, b: DocumentAddress): boolean =>\n  contains(a, b) || contains(b, a);\n\nexport const debugKey = (address: DocumentAddress): string => {\n  let result = '';\n  for (let index = 0; index < address.length; index += 1) {\n    if (index > 0) result += '/';\n    result += address[index].replaceAll('~', '~~').replaceAll('/', '~/');\n  }\n  return result;\n};\n\nexport const same = (a: AddressRef, b: AddressRef): boolean => {\n  if (a.path !== b.path || a.address.length !== b.address.length) return false;\n  for (let index = 0; index < a.address.length; index += 1) {\n    profile.address.segmentCompared();\n    if (a.address[index] !== b.address[index]) return false;\n  }\n  return true;\n};\n\nexport type { DocumentAddress } from './schema';\n\ntype AddressIndexNode<T> = {\n  readonly children: Map<string, AddressIndexNode<T>>;\n  readonly values: Set<T>;\n};\n\n/** An index over canonical address segments, shared by impact and subscriptions. */\nexport class AddressIndex<T> {\n  private readonly root: AddressIndexNode<T> = { children: new Map(), values: new Set() };\n\n  add(address: DocumentAddress, value: T, member?: string): void {\n    let node = this.root;\n    for (let i = 0; i < address.length + (member === undefined ? 0 : 1); i++) {\n      const segment = i < address.length ? address[i] : member!;\n      let child = node.children.get(segment);\n      if (!child) {\n        child = { children: new Map(), values: new Set() };\n        node.children.set(segment, child);\n      }\n      node = child;\n    }\n    node.values.add(value);\n  }\n\n  delete(address: DocumentAddress, value: T): void {\n    const parents: AddressIndexNode<T>[] = [];\n    let node = this.root;\n    for (const segment of address) {\n      const child = node.children.get(segment);\n      if (!child) return;\n      parents.push(node);\n      node = child;\n    }\n    node.values.delete(value);\n    for (let i = address.length - 1; i >= 0 && !node.values.size && !node.children.size; i--) {\n      node = parents[i];\n      node.children.delete(address[i]);\n    }\n  }\n\n  exact(address: DocumentAddress): ReadonlySet<T> | undefined {\n    let node = this.root;\n    for (const segment of address) {\n      const child = node.children.get(segment);\n      if (!child) return undefined;\n      node = child;\n    }\n    return node.values;\n  }\n\n  hasAncestor(address: DocumentAddress, strict = false): boolean {\n    let node = this.root;\n    for (let i = 0; i < address.length; i++) {\n      if (node.values.size) return true;\n      const child = node.children.get(address[i]);\n      if (!child) return false;\n      node = child;\n    }\n    return !strict && node.values.size > 0;\n  }\n\n  someAncestor(address: DocumentAddress, predicate: (value: T) => boolean): boolean {\n    let node = this.root;\n    for (let i = 0; ; i++) {\n      for (const value of node.values) if (predicate(value)) return true;\n      if (i === address.length) return false;\n      const child = node.children.get(address[i]);\n      if (!child) return false;\n      node = child;\n    }\n  }\n\n  overlaps(address: DocumentAddress): boolean {\n    let node = this.root;\n    for (const segment of address) {\n      if (node.values.size) return true;\n      const child = node.children.get(segment);\n      if (!child) return false;\n      node = child;\n    }\n    return node.values.size > 0 || node.children.size > 0;\n  }\n\n  hasDescendant(address: DocumentAddress): boolean {\n    let node = this.root;\n    for (const segment of address) {\n      const child = node.children.get(segment);\n      if (!child) return false;\n      node = child;\n    }\n    return node.values.size > 0 || node.children.size > 0;\n  }\n\n  query(\n    visit: (value: T) => void,\n    relation: 'overlap' | 'ancestors' | 'descendants' = 'overlap'\n  ): (address: DocumentAddress, members?: readonly { readonly key: string }[]) => void {\n    const visited = new Set<AddressIndexNode<T>>();\n    const subtrees = new Set<AddressIndexNode<T>>();\n    const values = (node: AddressIndexNode<T>) => {\n      if (visited.has(node)) return;\n      visited.add(node);\n      node.values.forEach(visit);\n    };\n    const descend = (current: AddressIndexNode<T>): void => {\n      if (subtrees.has(current)) return;\n      subtrees.add(current);\n      values(current);\n      current.children.forEach(descend);\n    };\n    const terminal = (node: AddressIndexNode<T>) =>\n      relation === 'ancestors' ? values(node) : descend(node);\n    return (address, members) => {\n      let node = this.root;\n      for (const segment of address) {\n        if (subtrees.has(node)) return;\n        if (relation !== 'descendants') values(node);\n        const child = node.children.get(segment);\n        if (!child) return;\n        node = child;\n      }\n      if (!members) terminal(node);\n      else {\n        if (relation !== 'descendants') values(node);\n        for (const member of members) {\n          const child = node.children.get(member.key);\n          if (child) terminal(child);\n        }\n      }\n    };\n  }\n\n  clear(): void {\n    this.root.values.clear();\n    this.root.children.clear();\n  }\n}\n","import type { DocumentAddress } from '../schema';\nimport type { ParseIssue } from '../schema-value';\n\nexport type MutationIssueCode =\n  | 'invalid-address'\n  | 'invalid-value'\n  | 'invalid-key'\n  | 'invalid-changes'\n  | 'baseline-mismatch'\n  | 'required-field'\n  | 'invalid-anchor'\n  | 'duplicate-entity'\n  | 'missing-entity'\n  | 'invalid-collection'\n  | 'invalid-list-keys'\n  | 'invalid-list-key'\n  | 'duplicate-list-item'\n  | 'missing-list-item'\n  | 'invalid-tree'\n  | 'duplicate-tree-node'\n  | 'missing-tree-parent'\n  | 'invalid-tree-index'\n  | 'missing-tree-node'\n  | 'tree-cycle';\nexport type MutationIssue = {\n  readonly source: 'mutation';\n  readonly code: MutationIssueCode;\n  readonly address: DocumentAddress;\n  readonly message: string;\n};\nexport const at = (\n  address: DocumentAddress,\n  code: MutationIssueCode,\n  message: string\n): MutationIssue =>\n  Object.freeze({ source: 'mutation', code, address: Object.freeze([...address]), message });\nexport class MutationRejected extends Error {\n  constructor(readonly issue: MutationIssue) {\n    super(issue.message);\n  }\n}\nexport const fail = (address: DocumentAddress, code: MutationIssueCode, message: string): never => {\n  throw new MutationRejected(at(address, code, message));\n};\n\nexport const invalidValue = (issue: ParseIssue, address = issue.address): never =>\n  fail(address, issue.code === 'missing-validator' ? 'invalid-value' : issue.code, issue.message);\n"],"mappings":"AAiDA,MAAa,UAAU;CACrB,aAAa,KAAmC,SAAS,MAAM;CAG/D,WAAW,KAAiC,SAAS,MAAM;CAG3D,SAAS,QAAkC;CAG3C,MAAM,EACJ,iBAAiB,IAGlB;CACD,UAAU;EACR,YAAY;EAGZ,iBAAiB;EAGlB;CACD,SAAS;EACP,YAAY,UAAkB;EAM9B,kBAAkB;EAGlB,oBAAoB;EAGpB,mBAAmB;EAGnB,wBAAwB;EAGxB,uBAAuB;EAGxB;CACD,QAAQ;EACN,aAAa;EAGb,eAAe;EAGhB;CACD,gBAAgB;EACd,cAAc;EAGd,aAAa,SAAS,MAAM;EAG5B,mBAAmB;EAGpB;CACD,cAAc;EACZ,eAAe;EAGf,eAAe;EAGf,oBAAoB;EAGrB;CACF;;;AC1HD,MAAa,SAAS,MAAyB,UAAyB;AACtE,SAAQ,SAAS,MAAM;AACvB,KAAI,SAAS,MAAO,QAAO;AAC3B,SAAQ,SAAS,WAAW;AAC5B,KAAI,KAAK,WAAW,MAAM,OAAQ,QAAO;AACzC,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,KAAI,KAAK,OAAO,MAAM,OAAO,EAAE,CAAE,QAAO;AAC9E,QAAO;;AAWT,MAAM,UAAU,SAAuB,KAAK;AAC5C,MAAM,SAAS,MAAY,UACzB,MAAM,QAAQ,KAAK,GAAG,KAAK,SAAS,KAAK,GAAG,MAAM;AACpD,MAAM,YAAY,MAAY,QAC5B,MAAM,QAAQ,KAAK,GAAG,KAAK,QAAQ,IAAI,GAAI,KAAkB,MAAM,IAAI;AAEzE,MAAa,QAAQ,QAA4B,WAAiD;CAChG,QAAQ,OAAO;CACf,KAAI,UAAU,SAAS,KAAK,QAAQ,OAAO,SAAS,MAAM,OAAO,OAAO,GAAG,KAAA;CAC3E,QAAO,QAAO;AACZ,OAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,EAClD,KAAI,MAAM,OAAO,OAAO,KAAK,IAAK,QAAO;AAC3C,SAAO;;CAEV;AAED,MAAM,8BAAc,IAAI,SAGrB;;AAGH,MAAa,eACX,QACA,UACa;CACb,MAAM,SAAS,YAAY,IAAI,OAAO;AACtC,KAAI,QAAQ,UAAU,MAAO,QAAO,OAAO;CAC3C,IAAI;CACJ,MAAM,QAAkB;EACtB,QAAQ,OAAO;EACf,KAAI,UAAU,SAAS,KAAK,QAAQ,OAAO,SAAS,MAAM,OAAO,OAAO,GAAG,KAAA;EAC3E,QAAO,QAAO;AACZ,OAAI,CAAC,WAAW;AACd,gCAAY,IAAI,KAAK;AACrB,SAAK,IAAI,IAAI,GAAG,IAAI,OAAO,QAAQ,IAAK,WAAU,IAAI,MAAM,OAAO,GAAG,EAAE,EAAE;AAC1E,YAAQ,QAAQ,UAAU,OAAO,OAAO;;AAE1C,UAAO,UAAU,IAAI,IAAI,IAAI;;EAEhC;AACD,aAAY,IAAI,QAAQ;EAAE;EAAO;EAAO,CAAC;AACzC,QAAO;;;AAIT,MAAa,UAAU,QAAmB,OAAe,UAAyB;AAChF,QAAO,OAAO,OAAO,GAAG,MAAM;AAC9B,aAAY,OAAO,OAAO;;AAG5B,MAAa,UAAU,QAAmB,UAAwB;AAChE,QAAO,OAAO,OAAO,EAAE;AACvB,aAAY,OAAO,OAAO;;AAG5B,MAAa,QAAQ,QAAmB,MAAc,OAAqB;CACzE,MAAM,CAAC,SAAS,OAAO,OAAO,MAAM,EAAE;AACtC,QAAO,OAAO,IAAI,GAAG,MAAM;AAC3B,aAAY,OAAO,OAAO;;AAG5B,MAAa,WACX,QACA,OACA,UACS;CACT,MAAM,wBAAQ,IAAI,KAAsB;AACxC,MAAK,MAAM,SAAS,OAAQ,OAAM,IAAI,MAAM,MAAM,EAAE,MAAM;AAC1D,QAAO,SAAS,MAAM;AACtB,MAAK,IAAI,QAAQ,GAAG,QAAQ,MAAM,QAAQ,QAAS,QAAO,SAAS,MAAM,IAAI,MAAM,OAAO;AAC1F,aAAY,OAAO,OAAO;;AAG5B,MAAa,WAAW,OAA0B,YAAwC;AACxF,KAAI,MAAM,WAAW,QAAQ,OAAQ,QAAO;CAC5C,MAAM,MAAM,IAAI,IAAI,MAAM;AAC1B,QAAO,IAAI,SAAS,MAAM,UAAU,QAAQ,OAAM,OAAM,IAAI,IAAI,GAAG,CAAC;;AAGtE,MAAa,SAAS,MAAY,WAAoC;AACpE,KAAI,CAAC,OAAQ,QAAO,OAAO,KAAK;AAChC,KAAI,QAAQ,OAAQ,QAAO,OAAO,OAAO,UAAU,IAAI,OAAO,KAAK;AACnE,KAAI,YAAY,OAAQ,QAAO,SAAS,MAAM,OAAO,OAAO;AAC5D,QAAO,SAAS,MAAM,OAAO,MAAM,GAAG;;AAMxC,MAAa,SAAS,MAAY,WAAqC;AACrE,KAAI,CAAC,OAAQ,QAAO;AACpB,KAAI,OAAO,WAAW,YAAY,WAAW,KAAM,QAAO;AAC1D,KAAI,OAAO,QAAQ,OAAO,GAAG,OAAO,YAAY,OAAO,GAAG,OAAO,WAAW,OAAO,KAAK,EACtF,QAAO;AACT,KAAI,QAAQ,OAAQ,QAAO,OAAO,OAAO,WAAW,OAAO,OAAO;AAClE,QAAO,SAAS,MAAM,YAAY,SAAS,OAAO,SAAS,OAAO,MAAM,IAAI;;AAG9E,MAAa,eAAe,MAAY,cAAsB,WAAoC;CAChG,MAAM,WAAW,MAAM,MAAM,OAAO;AACpC,QAAO,WAAW,eAAe,WAAW,IAAI;;;;ACzHlD,MAAa,iBAAiB,UAAqD;AACjF,KAAI,UAAU,QAAQ,OAAO,UAAU,SAAU,QAAO;CACxD,MAAM,YAAY,OAAO,eAAe,MAAM;AAC9C,QAAO,cAAc,OAAO,aAAa,cAAc;;AAGzD,MAAaA,cAAY,UACvB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,MAAM;;;ACJtE,MAAM,QAAQ,MAAmB,OAC/B,OAAO,OAAO,KAAK,OAAO,GAAG,GAAG,KAAK,MAAM,MAAM,KAAA;AACnD,MAAa,MAAM,UACjBC,WAAS,MAAM,IAAIA,WAAS,MAAM,MAAM;AAE1C,MAAa,aAAa,UAA6C;AACrE,KAAI,CAACA,WAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,SAAS,CAAE,QAAO;AAC/D,KAAI,MAAM,aAAa,KAAA,KAAa,OAAO,MAAM,aAAa,SAAU,QAAO;CAC/E,MAAM,2BAAW,IAAI,KAAa;AAClC,MAAK,MAAM,MAAM,MAAM,UAAU;AAC/B,MAAI,OAAO,OAAO,YAAY,SAAS,IAAI,GAAG,CAAE,QAAO;AACvD,WAAS,IAAI,GAAG;;AAElB,QAAO;;AAGT,MAAaC,cAAY,MAAmB,OAAwB,OAAO,OAAO,KAAK,OAAO,GAAG;AAEjG,MAAa,UAAU,MAAmB,OACxC,KAAK,MAAM,GAAG,EAAE;AAElB,MAAa,YAAY,MAAmB,OAC1C,KAAK,MAAM,GAAG,EAAE;AAElB,MAAa,YAAY,UAAyC;AAChE,KAAI,CAAC,GAAG,MAAM,CAAE,QAAO;CACvB,MAAM,MAAM,OAAO,KAAK,MAAM,MAAM;AACpC,KAAI,IAAI,WAAW,EAAG,QAAO,MAAM,WAAW,KAAA;AAC9C,KAAI,OAAO,MAAM,WAAW,YAAY,CAAC,OAAO,OAAO,MAAM,OAAO,MAAM,OAAO,CAAE,QAAO;AAE1F,MAAK,MAAM,MAAM,KAAK;EACpB,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAI,CAAC,UAAU,MAAM,CAAE,QAAO;AAC9B,MAAI,OAAO,MAAM;OACX,MAAM,aAAa,KAAA,EAAW,QAAO;aAChC,MAAM,aAAa,KAAA,KAAa,CAAC,OAAO,OAAO,MAAM,OAAO,MAAM,SAAS,CACpF,QAAO;AACT,OAAK,MAAM,SAAS,MAAM,UAAU;GAClC,MAAM,YAAY,MAAM,MAAM;AAC9B,OAAI,CAAC,aAAa,UAAU,aAAa,GAAI,QAAO;;;CAIxD,MAAM,uBAAO,IAAI,KAAa;CAC9B,MAAM,QAAQ,CAAC,MAAM,OAAO;AAC5B,QAAO,MAAM,QAAQ;EACnB,MAAM,KAAK,MAAM,KAAK;AACtB,MAAI,KAAK,IAAI,GAAG,CAAE,QAAO;AACzB,OAAK,IAAI,GAAG;EACZ,MAAM,QAAQ,MAAM,MAAM;AAC1B,MAAI,CAAC,MAAO,QAAO;AACnB,OAAK,MAAM,SAAS,MAAM,SAAU,OAAM,KAAK,MAAM;;AAEvD,QAAO,KAAK,SAAS,IAAI;;;;ACjC3B,MAAM,6BAAa,IAAI,SAA2B;AAClD,MAAM,sBAAoC,EAAE,wBAAQ,IAAI,KAAK,EAAE;AAC/D,MAAM,eAAe,WAAiC;CACpD,MAAM,SAAS,WAAW,IAAI,OAAiB;AAC/C,KAAI,OAAQ,QAAO;CACnB,MAAM,WAAqB;EAAE,MAAM,cAAc;EAAE,UAAU;EAAG;AAChE,YAAW,IAAI,QAAkB,SAAS;AAC1C,QAAO;;AAGT,MAAM,YAAY,UAChB,OAAO,UAAU,YAAY,UAAU,QAAQ,CAAC,MAAM,QAAQ,MAAM;AAEtE,MAAM,eACJ,MACA,UAC6B;CAC7B,MAAM,MAAM,SAAS,MAAM,IAAI,OAAO,MAAM,KAAK,SAAS,WAAW,MAAM,KAAK,OAAO,KAAA;AACvF,QAAO,KAAK,SAAS,OAAO,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC,MAAM,GAAG;;AAGzE,MAAM,QACJ,WACA,OACA,YAC6B;CAC7B,IAAI,OAAO;AACX,KAAI,CAAC,KAAM,QAAO,KAAA;AAClB,KAAI,KAAK,SAAS,UAChB,QAAO,YAAY,MAAM,MAAM;AAEjC,KAAI,CAAC,KAAM,QAAO,KAAA;AAClB,KAAI,KAAK,SAAS,SAChB,QAAO,OAAO,OAAO,KAAK,OAAO,QAAQ,GAAG,KAAK,MAAM,WAAW,KAAA;AACpE,KAAI,KAAK,SAAS,WAAW,KAAK,SAAS,MAAO,QAAO,KAAK;AAE9D,KAAI,KAAK,SAAS,OAAQ,QAAO,KAAK;;AAIxC,MAAM,WACJ,QACA,SACA,aACuB;CACvB,MAAM,WAAW,YAAY,OAAO;CACpC,IAAI,OAAO,SAAS;CACpB,IAAI,OAAiC;CACrC,IAAI,QAAiB;AACrB,MAAK,MAAM,WAAW,SAAS;AAC7B,UAAQ,QAAQ,YAAY;AAC5B,UAAQ,QAAQ,cAAc;EAC9B,MAAM,WAAW,KAAK,MAAM,OAAO,QAAQ;AAC3C,MAAI,CAAC,SAAU,QAAO,KAAA;AAYtB,SAVE,SACC,KAAK,SAAS,WAAW,KAAK,SAAS,SAAS,KAAK,SAAS,UAAU,KAAK,SAAS,UAClF,KAAK,YAAY,cAAc,UACzB;GACL,MAAM,WAAW,KAAK,OAAO,IAAI,QAAQ;AACzC,OAAI,SAAU,QAAO;GACrB,MAAM,UAAU,cAAc;AAC9B,QAAK,OAAO,IAAI,SAAS,QAAQ;AACjC,UAAO;MACL;AAEV,UAAQ,YAAY,OAAO,SAAS,KAAK;AACzC,SAAO;;AAET,KAAI,KAAK,SAAS,KAAA,EAAW,MAAK,OAAO,SAAS;AAClD,QAAO,KAAK;;AAGd,MAAa,kBACX,QACA,SACA,aAC2B;AAC3B,KAAI,CAAC,MAAM,QAAQ,QAAQ,CAAE,QAAO,KAAA;AACpC,MAAK,MAAM,WAAW,QAAS,KAAI,OAAO,YAAY,SAAU,QAAO,KAAA;AACvE,SAAQ,QAAQ,aAAa;CAC7B,MAAM,QAAQ,OAAO,OAAO,QAAQ,OAAO,CAAC;CAC5C,MAAM,OAAO,QAAQ,QAAQ,OAAO,SAAS;AAC7C,QAAO,SAAS,KAAA,IAAY,KAAA,IAAY;EAAE;EAAM,SAAS;EAAO;;AAGlE,MAAa,UACX,QACA,SACA,aAC6B;CAC7B,IAAI,OAAiC;CACrC,IAAI,QAAQ;AACZ,MAAK,MAAM,WAAW,SAAS;EAC7B,MAAM,WAAW,KAAK,MAAM,OAAO,QAAQ;AAC3C,UAAQ,YAAY,OAAO,SAAS,KAAK;AACzC,SAAO;AACP,MAAI,CAAC,KAAM,QAAO,KAAA;;AAEpB,QAAO;;AAGT,MAAa,eAAe,OAAgB,SAAiB,SAAiC;AAC5F,KAAI,CAAC,SAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,CAAE,QAAO,KAAA;AACtD,KAAI,MAAM,SAAS,UAAU,MAAM,QAAQ,MAAM,CAC/C,QAAO,MAAMC,YAAmB,OAAO,KAAK,MAAM,CAAC,MAAM,QAAQ;AACnE,KAAI,MAAM,SAAS,WAAW,SAAS,MAAM,IAAI,SAAS,MAAM,KAAK,CACnE,QAAO,OAAO,OAAO,MAAM,MAAM,QAAQ,GAAG,MAAM,KAAK,WAAW,KAAA;AAEpE,QAAO,OAAO,UAAU,eAAe,KAAK,OAAO,QAAQ,GACtD,MAAkC,WACnC,KAAA;;AAGN,MAAa,QAAQ,MAAe,SAA0B,WAAkC;CAC9F,IAAI,QAAQ;CACZ,IAAI,OAAiC;AACrC,MAAK,MAAM,WAAW,SAAS;EAC7B,MAAM,OAAO,KAAK,MAAM,OAAO,QAAQ;AACvC,UAAQ,YAAY,OAAO,SAAS,KAAK;AACzC,SAAO;AACP,MAAI,UAAU,KAAA,EAAW,QAAO,KAAA;;AAElC,QAAO;;AA0BT,MAAM,kCAAkB,IAAI,SAA8B;AAC1D,MAAM,kCAAkB,IAAI,SAAsC;AAClE,MAAa,iBAAiB,MAAoB,UAA4C;CAC5F,MAAM,SAAS,KAAK,SAAS,YAAY,YAAY,MAAM,MAAM,GAAG;AACpE,KAAI,QAAQ,SAAS,SAAU,QAAO,KAAA;CACtC,MAAM,QAAqB,OAAO;CAClC,IAAI,SAAS,gBAAgB,IAAI,MAAM;AACvC,KAAI,CAAC,QAAQ;EACX,MAAM,2BAAW,IAAI,KAA0B;AAC/C,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,CAAC,MAAM,EAAE;AAC3C,WAAQ,QAAQ,YAAY;AAC5B,YAAS,IAAI,KAAK;IAChB,MAAM;IACN;IACA,MAAM,MAAM;IACZ,OAAO,MAAM,KAAK,SAAS;IAC3B,MAAM,SAAS;IAChB,CAAC;;AAEJ,WAAS;GAAE,MAAM;GAAS,SAAS;GAAU;AAC7C,kBAAgB,IAAI,OAAO,OAAO;;AAEpC,QAAO;;AAoBT,MAAa,oBACX,OACA,YACA,IACA,MACA,UACkC;AAClC,KAAI,CAAC,QAAS,CAAC,SAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,CAAG,QAAO,KAAA;CACjE,MAAM,SAAS,KAAK,SAAS,WAAW,SAAS,MAAM,GAAG,MAAM,OAAO;AACvE,KAAI,CAAC,SAAS,OAAO,IAAI,CAAC,MAAM,QAAQ,OAAO,CAAE,QAAO,KAAA;AACxD,KAAI,KAAK,SAAS,OAAQ,QAAO,KAAA;CACjC,IAAI;AACJ,KAAI,KAAK,SAAS,SAAS,KAAK,SAAS,WAAW,KAAK,SAAS,QAAQ;EACxE,IAAI,UAAU,gBAAgB,IAAI,KAAK;AACvC,MAAI,CAAC,SAAS;AACZ,aAAU;IACR,MAAM;IACN,OAAO;KAAE,MAAM;KAAS,MAAM,KAAK;KAAO,OAAO,KAAK,MAAM,SAAS;KAAS;IAC/E;AACD,mBAAgB,IAAI,MAAM,QAAQ;;AAEpC,WAAS;QACJ;EACL,MAAM,QAAQ,cAAc,MAAM,MAAM;AACxC,MAAI,CAAC,MAAO,QAAO,KAAA;AACnB,WAAS;;AAEX,QAAO;EAAE;EAAO;EAAY;EAAI;EAAM;EAAQ;EAAO;EAAQ;;AAE/D,MAAa,wBACX,OACA,YACA,IACA,MACA,UAEA,MAAM,SAAS,UAAUC,GAAO,MAAM,GAAG;CAAE;CAAO;CAAY;CAAI;CAAM;CAAO,GAAG,KAAA;AACpF,MAAa,aACX,WACA,QAEA,UAAU,KAAK,SAAS,SACpBD,YAAmB,UAAU,QAAqB,UAAU,KAAK,MAAM,CAAC,MAAM,IAAI,GAClF;;AASN,MAAa,yBAAyB,QAAsB,SAAkB;CAC5E,MAAM,SAA6B,EAAE;AACrC,QAAO;EACL,YAAY,OAAe,YAAoB,OAAwB;AACrE,OAAI,CAAC,GAAG,OAAQ,QAAO,iBAAiB,OAAO,YAAY,IAAI,QAAQ,KAAK;GAC5E,MAAM,WAAW,kBAAkB,QAAQ,MAAM,IAAI,OAAO;AAC5D,OAAI,CAAC,YAAY,CAAC,OAAO,OAAO,SAAS,QAAQ,SAAS,IAAI,CAAE,QAAO,KAAA;AACvE,UAAO,iBACL,OACA,YACA,IACA,SAAS,MACR,SAAS,OAA4C,SAAS,KAChE;;EAEH,kBAAkB;AAChB,UAAO,SAAS;;EAEnB;;;AAIH,MAAa,gBACX,QACA,MACA,SACA,WACuD;AACvD,KAAI,CAAC,QAAQ,OAAQ,QAAO;EAAE,MAAM;EAAQ,OAAO;EAAM;CACzD,MAAM,WAAW,kBAAkB,QAAQ,MAAM,SAAS,OAAO;AACjE,QACE,YAAY;EACV,MAAM,SAAS;EACf,OAAO,OAAO,OAAO,SAAS,QAAQ,SAAS,IAAI,GAC9C,SAAS,OAA4C,SAAS,OAC/D,KAAA;EACL;;;AAKL,MAAa,kBACX,QACA,MACA,YACgC,kBAAkB,QAAQ,MAAM,QAAQ;AAE1E,MAAM,qBACJ,QACA,MACA,SACA,WACgC;AAChC,KAAI,QAAQ,WAAW,EAAG,QAAO,KAAA;CACjC,IAAI,OAAiC;CACrC,IAAI,UAAmB;CACvB,IAAI,QAAQ;AACZ,KAAI,QAAQ;AACV,SACE,QAAQ,OAAO,UACf,QAAQ,QAAQ,SAAS,KACzB,OAAO,OAAO,YAAY,QAAQ,OAElC;AACF,SAAO,SAAS;AAChB,MAAI,OAAO;GACT,MAAM,WAAW,OAAO,QAAQ;AAChC,UAAO,SAAS;AAChB,aAAU,SAAS;;;CAGvB,IAAI,YAAY;AAChB,MAAK,IAAI,QAAQ,OAAO,QAAQ,QAAQ,SAAS,GAAG,SAAS,GAAG;AAC9D,UAAQ,QAAQ,YAAY;AAC5B,UAAQ,QAAQ,cAAc;EAC9B,MAAM,WAAW,KAAK,MAAM,SAAS,QAAQ,OAAO;AACpD,MAAI,CAAC,SAAU,QAAO,KAAA;AACtB,MAAI,MAAM,SAAS,YAAY,MAAM,SAAS,WAAW,MAAM,SAAS,MACtE,aAAY;AACd,YAAU,YAAY,SAAS,QAAQ,QAAQ,KAAK;AACpD,SAAO;AACP,MAAI,UAAU,UACZ,QAAO,KAAK;GACV,SAAS,QAAQ;GACjB,MAAM;GACN,OAAO;GACR,CAAC;AACJ,MAAI,CAAC,KAAM,QAAO,KAAA;;CAEpB,MAAM,OAAO,QAAQ,QAAQ,SAAS;AACtC,QAAO,aAAa,MAAM,SAAS,KAAK;;;AAI1C,MAAa,gBACX,MACA,SACA,SACgC;AAChC,SAAQ,QAAQ,YAAY;AAC5B,SAAQ,QAAQ,cAAc;CAC9B,MAAM,WAAW,KAAK,MAAM,SAAS,KAAK;AAC1C,KAAI,CAAC,YAAa,CAAC,SAAS,QAAQ,IAAI,CAAC,MAAM,QAAQ,QAAQ,CAAG,QAAO,KAAA;AACzE,KAAI,MAAM,SAAS,WAAW,SAAS,QAAQ,IAAI,SAAS,QAAQ,KAAK,CACvE,QAAO;EACL,MAAM;EACN,QAAQ,QAAQ;EAChB,KAAK;EACN;AACH,QAAO;EACL,MAAM;EACN,QAAQ;EACR,KACE,MAAM,SAAS,UAAU,MAAM,QAAQ,QAAQ,GAC3CA,YAAmB,SAAS,KAAK,MAAM,CAAC,MAAM,KAAK,GACnD;EACP;;AAGH,MAAa,YAAY,QAAyB,UAAoC;AACpF,SAAQ,QAAQ,kBAAkB;AAClC,KAAI,OAAO,SAAS,MAAM,OAAQ,QAAO;AACzC,MAAK,IAAI,QAAQ,GAAG,QAAQ,OAAO,QAAQ,SAAS,GAAG;AACrD,UAAQ,QAAQ,iBAAiB;AACjC,MAAI,OAAO,WAAW,MAAM,OAAQ,QAAO;;AAE7C,QAAO;;AAGT,MAAa,YAAY,GAAoB,MAC3C,SAAS,GAAG,EAAE,IAAI,SAAS,GAAG,EAAE;AAElC,MAAa,YAAY,YAAqC;CAC5D,IAAI,SAAS;AACb,MAAK,IAAI,QAAQ,GAAG,QAAQ,QAAQ,QAAQ,SAAS,GAAG;AACtD,MAAI,QAAQ,EAAG,WAAU;AACzB,YAAU,QAAQ,OAAO,WAAW,KAAK,KAAK,CAAC,WAAW,KAAK,KAAK;;AAEtE,QAAO;;;AAoBT,IAAa,eAAb,MAA6B;CAC3B,OAA6C;EAAE,0BAAU,IAAI,KAAK;EAAE,wBAAQ,IAAI,KAAK;EAAE;CAEvF,IAAI,SAA0B,OAAU,QAAuB;EAC7D,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,UAAU,WAAW,KAAA,IAAY,IAAI,IAAI,KAAK;GACxE,MAAM,UAAU,IAAI,QAAQ,SAAS,QAAQ,KAAK;GAClD,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACtC,OAAI,CAAC,OAAO;AACV,YAAQ;KAAE,0BAAU,IAAI,KAAK;KAAE,wBAAQ,IAAI,KAAK;KAAE;AAClD,SAAK,SAAS,IAAI,SAAS,MAAM;;AAEnC,UAAO;;AAET,OAAK,OAAO,IAAI,MAAM;;CAGxB,OAAO,SAA0B,OAAgB;EAC/C,MAAM,UAAiC,EAAE;EACzC,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO;AACZ,WAAQ,KAAK,KAAK;AAClB,UAAO;;AAET,OAAK,OAAO,OAAO,MAAM;AACzB,OAAK,IAAI,IAAI,QAAQ,SAAS,GAAG,KAAK,KAAK,CAAC,KAAK,OAAO,QAAQ,CAAC,KAAK,SAAS,MAAM,KAAK;AACxF,UAAO,QAAQ;AACf,QAAK,SAAS,OAAO,QAAQ,GAAG;;;CAIpC,MAAM,SAAsD;EAC1D,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO,KAAA;AACnB,UAAO;;AAET,SAAO,KAAK;;CAGd,YAAY,SAA0B,SAAS,OAAgB;EAC7D,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,IAAI,GAAG,IAAI,QAAQ,QAAQ,KAAK;AACvC,OAAI,KAAK,OAAO,KAAM,QAAO;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG;AAC3C,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,CAAC,UAAU,KAAK,OAAO,OAAO;;CAGvC,aAAa,SAA0B,WAA2C;EAChF,IAAI,OAAO,KAAK;AAChB,OAAK,IAAI,IAAI,IAAK,KAAK;AACrB,QAAK,MAAM,SAAS,KAAK,OAAQ,KAAI,UAAU,MAAM,CAAE,QAAO;AAC9D,OAAI,MAAM,QAAQ,OAAQ,QAAO;GACjC,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ,GAAG;AAC3C,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;;CAIX,SAAS,SAAmC;EAC1C,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;AAC7B,OAAI,KAAK,OAAO,KAAM,QAAO;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,KAAK,OAAO,OAAO,KAAK,KAAK,SAAS,OAAO;;CAGtD,cAAc,SAAmC;EAC/C,IAAI,OAAO,KAAK;AAChB,OAAK,MAAM,WAAW,SAAS;GAC7B,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,OAAI,CAAC,MAAO,QAAO;AACnB,UAAO;;AAET,SAAO,KAAK,OAAO,OAAO,KAAK,KAAK,SAAS,OAAO;;CAGtD,MACE,OACA,WAAoD,WAC+B;EACnF,MAAM,0BAAU,IAAI,KAA0B;EAC9C,MAAM,2BAAW,IAAI,KAA0B;EAC/C,MAAM,UAAU,SAA8B;AAC5C,OAAI,QAAQ,IAAI,KAAK,CAAE;AACvB,WAAQ,IAAI,KAAK;AACjB,QAAK,OAAO,QAAQ,MAAM;;EAE5B,MAAM,WAAW,YAAuC;AACtD,OAAI,SAAS,IAAI,QAAQ,CAAE;AAC3B,YAAS,IAAI,QAAQ;AACrB,UAAO,QAAQ;AACf,WAAQ,SAAS,QAAQ,QAAQ;;EAEnC,MAAM,YAAY,SAChB,aAAa,cAAc,OAAO,KAAK,GAAG,QAAQ,KAAK;AACzD,UAAQ,SAAS,YAAY;GAC3B,IAAI,OAAO,KAAK;AAChB,QAAK,MAAM,WAAW,SAAS;AAC7B,QAAI,SAAS,IAAI,KAAK,CAAE;AACxB,QAAI,aAAa,cAAe,QAAO,KAAK;IAC5C,MAAM,QAAQ,KAAK,SAAS,IAAI,QAAQ;AACxC,QAAI,CAAC,MAAO;AACZ,WAAO;;AAET,OAAI,CAAC,QAAS,UAAS,KAAK;QACvB;AACH,QAAI,aAAa,cAAe,QAAO,KAAK;AAC5C,SAAK,MAAM,UAAU,SAAS;KAC5B,MAAM,QAAQ,KAAK,SAAS,IAAI,OAAO,IAAI;AAC3C,SAAI,MAAO,UAAS,MAAM;;;;;CAMlC,QAAc;AACZ,OAAK,KAAK,OAAO,OAAO;AACxB,OAAK,KAAK,SAAS,OAAO;;;;;ACzgB9B,MAAa,MACX,SACA,MACA,YAEA,OAAO,OAAO;CAAE,QAAQ;CAAY;CAAM,SAAS,OAAO,OAAO,CAAC,GAAG,QAAQ,CAAC;CAAE;CAAS,CAAC;AAC5F,IAAa,mBAAb,cAAsC,MAAM;CAC1C,YAAY,OAA+B;AACzC,QAAM,MAAM,QAAQ;AADD,OAAA,QAAA;;;AAIvB,MAAa,QAAQ,SAA0B,MAAyB,YAA2B;AACjG,OAAM,IAAI,iBAAiB,GAAG,SAAS,MAAM,QAAQ,CAAC;;AAGxD,MAAa,gBAAgB,OAAmB,UAAU,MAAM,YAC9D,KAAK,SAAS,MAAM,SAAS,sBAAsB,kBAAkB,MAAM,MAAM,MAAM,QAAQ"}