doxum 0.1.39 → 0.1.40

package/dist/advanced.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_transform = require("./transform-BnQZlLRP.cjs");
+const require_transform = require("./transform-8xXf0OKB.cjs");
 const require_record = require("./record-ChYUi8PP.cjs");
 //#region core/src/projection/advanced.ts
 const resetCollectionChange = Object.freeze({ kind: "reset" });

package/dist/advanced.js

@@ -1,4 +1,4 @@
-import { D as defineProcessor, S as compileProjectionDependencies, _ as assertSynchronous, r as collectionChange, t as createKeyedTransform, w as collectionView } from "./transform-Cl7CSsdR.js";
+import { D as defineProcessor, S as compileProjectionDependencies, _ as assertSynchronous, r as collectionChange, t as createKeyedTransform, w as collectionView } from "./transform--WCn6_v0.js";
 import { n as isPlainObject } from "./record-B2yRhYsc.js";
 //#region core/src/projection/advanced.ts
 const resetCollectionChange = Object.freeze({ kind: "reset" });

package/dist/index.cjs

@@ -1,5 +1,5 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-const require_transform = require("./transform-BnQZlLRP.cjs");
+const require_transform = require("./transform-8xXf0OKB.cjs");
 const require_record = require("./record-ChYUi8PP.cjs");
 const require_driver = require("./driver-CN3dGxQI.cjs");
 //#region core/src/schema/model.ts

package/dist/index.js

@@ -1,4 +1,4 @@
-import { A as ownProjections, C as snapshotProjectionValues, D as defineProcessor, E as snapshotCollectionView, M as projectionRef, N as profile, O as defineSource, S as compileProjectionDependencies, T as mapRead, _ as assertSynchronous, a as collectionChangeTouchesKey, b as ProjectionError, c as assertKeyedProjection, d as outputKind, f as createKeyRelation, g as assertScope, h as snapshotArray, i as collectionChangeIntersects, j as producerOf, k as isProjection, l as compileKeyedDependencies, m as sameArray, n as keyedAbsent, o as collectionHasStructuralChange, p as iterableMatchesArray, s as createCollectionChange, t as createKeyedTransform, u as createKeyedDependencyRuntime, v as createScheduler, w as collectionView, x as collectKeyedInvalidation, y as ProjectionDisposedError } from "./transform-Cl7CSsdR.js";
+import { A as ownProjections, C as snapshotProjectionValues, D as defineProcessor, E as snapshotCollectionView, M as projectionRef, N as profile, O as defineSource, S as compileProjectionDependencies, T as mapRead, _ as assertSynchronous, a as collectionChangeTouchesKey, b as ProjectionError, c as assertKeyedProjection, d as outputKind, f as createKeyRelation, g as assertScope, h as snapshotArray, i as collectionChangeIntersects, j as producerOf, k as isProjection, l as compileKeyedDependencies, m as sameArray, n as keyedAbsent, o as collectionHasStructuralChange, p as iterableMatchesArray, s as createCollectionChange, t as createKeyedTransform, u as createKeyedDependencyRuntime, v as createScheduler, w as collectionView, x as collectKeyedInvalidation, y as ProjectionDisposedError } from "./transform--WCn6_v0.js";
 import { n as isPlainObject, r as isRecord, t as installOwn } from "./record-B2yRhYsc.js";
 import { c as AddressIndex, d as invalidValue, f as children, g as validate, h as parent, i as contextOf, l as MutationRejected, m as is, o as decodeChanges, p as contains$1, r as bindContext, s as sealChanges, t as assertRuntimeWritable, u as fail } from "./driver-B7RR-VfX.js";
 //#region core/src/schema/model.ts

package/dist/{transform-Cl7CSsdR.js → transform--WCn6_v0.js}

@@ -1,5 +1,6 @@
 import { n as isPlainObject } from "./record-B2yRhYsc.js";
 const profile = {
+	keyRelation: (key, amount = 1) => {},
 	projection: (key, amount = 1) => {},
 	recorder: (key, amount = 1) => {},
 	access: (key) => {},
@@ -661,57 +662,95 @@ const iterableMatchesArray = (values, expected) => {
 };
 //#endregion
 //#region core/src/projection/keyed/relation.ts
-/** Runtime-local domain-neutral many-to-many keyed relation. */
+/** Runtime-local many-to-many relation. Callers validate unique string keys before replacing.
+* Forward order is meaningful; reverse sets and map iteration carry no formal order.
+*/
 const createKeyRelation = () => {
 	const forward = /* @__PURE__ */ new Map();
 	const reverse = /* @__PURE__ */ new Map();
 	const detach = (left, right) => {
-		for (const key of right) {
-			const dependents = reverse.get(key);
-			dependents?.delete(left);
-			if (dependents?.size === 0) reverse.delete(key);
+		const dependents = reverse.get(right);
+		if (!dependents?.delete(left)) return;
+		profile.keyRelation("detachedEdges");
+		if (dependents.size === 0) {
+			reverse.delete(right);
+			profile.keyRelation("deletedBuckets");
 		}
 	};
 	const attach = (left, right) => {
-		for (const key of right) {
-			const dependents = reverse.get(key);
-			if (dependents) dependents.add(left);
-			else reverse.set(key, new Set([left]));
+		const dependents = reverse.get(right);
+		if (dependents) {
+			if (dependents.has(left)) return false;
+			dependents.add(left);
+		} else {
+			reverse.set(right, new Set([left]));
+			profile.keyRelation("createdBuckets");
 		}
+		profile.keyRelation("attachedEdges");
+		return true;
 	};
 	return {
 		replaceOne(left, right) {
 			const previous = forward.get(left);
 			if (right === void 0) {
 				if (!previous) return false;
-				detach(left, previous);
+				for (const key of previous) detach(left, key);
 				forward.delete(left);
 				return true;
 			}
 			if (previous?.length === 1 && previous[0] === right) return false;
-			if (previous) detach(left, previous);
 			const next = Object.freeze([right]);
+			if (previous) {
+				for (const key of previous) if (key !== right) detach(left, key);
+			}
+			attach(left, right);
 			forward.set(left, next);
-			attach(left, next);
 			return true;
 		},
 		replace(left, right) {
 			const previous = forward.get(left);
-			if (previous ? sameArray(previous, right) : right.length === 0) return false;
-			if (previous) detach(left, previous);
+			if (!previous) {
+				if (!right.length) return false;
+				const next = snapshotArray(right);
+				for (const key of next) attach(left, key);
+				forward.set(left, next);
+				return true;
+			}
+			if (previous === right) return false;
 			if (!right.length) {
+				for (const key of previous) detach(left, key);
 				forward.delete(left);
 				return true;
 			}
+			let start = 0;
+			while (start < previous.length && start < right.length && previous[start] === right[start]) start++;
+			if (start === previous.length && start === right.length) return false;
 			const next = snapshotArray(right);
+			let oldEnd = previous.length;
+			let nextEnd = next.length;
+			while (oldEnd > start && nextEnd > start && previous[oldEnd - 1] === next[nextEnd - 1]) {
+				oldEnd--;
+				nextEnd--;
+			}
+			let retained = 0;
+			for (let index = start; index < nextEnd; index++) if (!attach(left, next[index])) retained++;
+			if (retained === 0) for (let index = start; index < oldEnd; index++) detach(left, previous[index]);
+			else if (retained < oldEnd - start) if (nextEnd - start === 1) {
+				for (let index = start; index < oldEnd; index++) if (previous[index] !== next[start]) detach(left, previous[index]);
+			} else {
+				const requested = /* @__PURE__ */ new Set();
+				for (let index = start; index < nextEnd; index++) requested.add(next[index]);
+				profile.keyRelation("diffSets");
+				profile.keyRelation("diffKeys", requested.size);
+				for (let index = start; index < oldEnd; index++) if (!requested.has(previous[index])) detach(left, previous[index]);
+			}
 			forward.set(left, next);
-			attach(left, next);
 			return true;
 		},
 		delete(left) {
 			const previous = forward.get(left);
 			if (!previous) return false;
-			detach(left, previous);
+			for (const key of previous) detach(left, key);
 			forward.delete(left);
 			return true;
 		},

package/dist/{transform-BnQZlLRP.cjs → transform-8xXf0OKB.cjs}

@@ -1,5 +1,6 @@
 const require_record = require("./record-ChYUi8PP.cjs");
 const profile = {
+	keyRelation: (key, amount = 1) => {},
 	projection: (key, amount = 1) => {},
 	recorder: (key, amount = 1) => {},
 	access: (key) => {},
@@ -661,57 +662,95 @@ const iterableMatchesArray = (values, expected) => {
 };
 //#endregion
 //#region core/src/projection/keyed/relation.ts
-/** Runtime-local domain-neutral many-to-many keyed relation. */
+/** Runtime-local many-to-many relation. Callers validate unique string keys before replacing.
+* Forward order is meaningful; reverse sets and map iteration carry no formal order.
+*/
 const createKeyRelation = () => {
 	const forward = /* @__PURE__ */ new Map();
 	const reverse = /* @__PURE__ */ new Map();
 	const detach = (left, right) => {
-		for (const key of right) {
-			const dependents = reverse.get(key);
-			dependents?.delete(left);
-			if (dependents?.size === 0) reverse.delete(key);
+		const dependents = reverse.get(right);
+		if (!dependents?.delete(left)) return;
+		profile.keyRelation("detachedEdges");
+		if (dependents.size === 0) {
+			reverse.delete(right);
+			profile.keyRelation("deletedBuckets");
 		}
 	};
 	const attach = (left, right) => {
-		for (const key of right) {
-			const dependents = reverse.get(key);
-			if (dependents) dependents.add(left);
-			else reverse.set(key, new Set([left]));
+		const dependents = reverse.get(right);
+		if (dependents) {
+			if (dependents.has(left)) return false;
+			dependents.add(left);
+		} else {
+			reverse.set(right, new Set([left]));
+			profile.keyRelation("createdBuckets");
 		}
+		profile.keyRelation("attachedEdges");
+		return true;
 	};
 	return {
 		replaceOne(left, right) {
 			const previous = forward.get(left);
 			if (right === void 0) {
 				if (!previous) return false;
-				detach(left, previous);
+				for (const key of previous) detach(left, key);
 				forward.delete(left);
 				return true;
 			}
 			if (previous?.length === 1 && previous[0] === right) return false;
-			if (previous) detach(left, previous);
 			const next = Object.freeze([right]);
+			if (previous) {
+				for (const key of previous) if (key !== right) detach(left, key);
+			}
+			attach(left, right);
 			forward.set(left, next);
-			attach(left, next);
 			return true;
 		},
 		replace(left, right) {
 			const previous = forward.get(left);
-			if (previous ? sameArray(previous, right) : right.length === 0) return false;
-			if (previous) detach(left, previous);
+			if (!previous) {
+				if (!right.length) return false;
+				const next = snapshotArray(right);
+				for (const key of next) attach(left, key);
+				forward.set(left, next);
+				return true;
+			}
+			if (previous === right) return false;
 			if (!right.length) {
+				for (const key of previous) detach(left, key);
 				forward.delete(left);
 				return true;
 			}
+			let start = 0;
+			while (start < previous.length && start < right.length && previous[start] === right[start]) start++;
+			if (start === previous.length && start === right.length) return false;
 			const next = snapshotArray(right);
+			let oldEnd = previous.length;
+			let nextEnd = next.length;
+			while (oldEnd > start && nextEnd > start && previous[oldEnd - 1] === next[nextEnd - 1]) {
+				oldEnd--;
+				nextEnd--;
+			}
+			let retained = 0;
+			for (let index = start; index < nextEnd; index++) if (!attach(left, next[index])) retained++;
+			if (retained === 0) for (let index = start; index < oldEnd; index++) detach(left, previous[index]);
+			else if (retained < oldEnd - start) if (nextEnd - start === 1) {
+				for (let index = start; index < oldEnd; index++) if (previous[index] !== next[start]) detach(left, previous[index]);
+			} else {
+				const requested = /* @__PURE__ */ new Set();
+				for (let index = start; index < nextEnd; index++) requested.add(next[index]);
+				profile.keyRelation("diffSets");
+				profile.keyRelation("diffKeys", requested.size);
+				for (let index = start; index < oldEnd; index++) if (!requested.has(previous[index])) detach(left, previous[index]);
+			}
 			forward.set(left, next);
-			attach(left, next);
 			return true;
 		},
 		delete(left) {
 			const previous = forward.get(left);
 			if (!previous) return false;
-			detach(left, previous);
+			for (const key of previous) detach(left, key);
 			forward.delete(left);
 			return true;
 		},

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "doxum",
-  "version": "0.1.39",
+  "version": "0.1.40",
   "private": false,
   "license": "MIT",
   "description": "Doxum is a typed runtime for complex mutable documents.",

package/skills/doxum-runtime/references/invariants.md

@@ -41,7 +41,11 @@ This file is maintainer-only. Application/library consumers should use [Public A
    remains static. `derive.keyed` declares extra sources in one named dependency object;
    `{ source, key }` members bind one source key and `{ source, keys }` members bind an
    ordered duplicate-free set of source keys for each output key. The materialized Runtime owns those bindings and reverse indexes,
-   including bindings to currently missing source entries. Processors do not create graph
+   including bindings to currently missing source entries. `projection/keyed/relation.ts`
+   owns edge differences and ordered forward snapshots. Keep retained reverse buckets intact;
+   pure reorder changes forward order even with zero edge writes. Callers validate unique
+   string keys, and reverse iteration is not formal order. Sequence comparison and
+   dependency snapshots can still cost O(number of selected keys). Processors do not create graph
    dependencies through imperative Runtime reads. A scope adds lifecycle ownership only
    through `scope.own`; scoped definitions may depend on root definitions, while root and
    sibling scopes cannot depend on scoped definitions. Notification failures leave commits