@knkcs/contenthub-ui 0.4.0 → 0.6.0

package/dist/testing.js

@@ -1,37 +1,37 @@
-import { C as e, D as t, E as n, F as r, M as i, N as a, P as o, S as s, T as c, _ as l, b as u, f as d, g as f, h as p, i as ee, k as m, n as h, o as te, r as g, s as ne, t as re, u as ie, v as ae, w as _, x as oe, y as se } from "./heads-DqHmAW0n.js";
+import { A as e, C as t, D as n, E as r, F as i, I as a, N as o, O as s, P as c, S as l, T as u, _ as d, b as f, d as p, g as m, i as h, n as g, o as ee, p as te, r as _, s as ne, t as re, u as ie, v as ae, w as oe, x as se, y as ce } from "./heads-BT8RZ-Gs.js";
 import { Code as v, ConnectError as y } from "@connectrpc/connect";
-import { createHostMembers as b } from "@knkcs/anker/host";
+import { createHostMembers as le } from "@knkcs/anker/host";
 //#region src/testing/fixtures.ts
-var x = "ws_stub", S = "user_stub", C = "user_ben", w = "2026-10-01T09:00:00.000Z";
-function T() {
+var ue = "ws_stub", b = "user_stub", x = "user_ben", S = "2026-10-01T09:00:00.000Z";
+function C() {
 	return {
-		userId: S,
-		workspaceId: x,
-		members: b([{
-			userId: S,
+		userId: b,
+		workspaceId: ue,
+		members: le([{
+			userId: b,
 			displayName: "Ada Editor",
 			email: "ada@example.com"
 		}, {
-			userId: C,
+			userId: x,
 			displayName: "Ben Reviewer",
 			email: "ben@example.com"
 		}])
 	};
 }
-function ce() {
+function de() {
 	return [{
 		id: "br_author",
 		name: "Being revised by the author",
-		createTime: w,
-		updateTime: w
+		createTime: S,
+		updateTime: S
 	}, {
 		id: "br_embargo",
 		name: "Embargoed until publication",
-		createTime: w,
-		updateTime: w
+		createTime: S,
+		updateTime: S
 	}];
 }
-function le() {
+function fe() {
 	return [
 		{
 			slug: "in_progress",
@@ -56,7 +56,7 @@ function le() {
 		}
 	];
 }
-function ue() {
+function pe() {
 	return {
 		in_progress: ["in_review", "on_hold"],
 		in_review: [
@@ -68,7 +68,7 @@ function ue() {
 		on_hold: ["in_progress"]
 	};
 }
-function de() {
+function me() {
 	return [
 		{
 			id: "cs_bgbl_270",
@@ -78,7 +78,7 @@ function de() {
 				reference: "BGBl. 2026 I Nr. 270"
 			},
 			state: "open",
-			createdBy: S,
+			createdBy: b,
 			createTime: "2026-09-30T08:00:00.000Z",
 			chains: [{
 				id: "chain_para_1",
@@ -111,7 +111,7 @@ function de() {
 			}],
 			dependsOnChangeSetIds: [],
 			status: "in_progress",
-			assigneeIds: [S],
+			assigneeIds: [b],
 			plannedReleases: [
 				{
 					id: "rls_p1_2",
@@ -171,19 +171,19 @@ function de() {
 				reference: "BGBl. 2026 I Nr. 255"
 			},
 			state: "open",
-			createdBy: C,
+			createdBy: x,
 			createTime: "2026-09-25T08:00:00.000Z",
 			chains: [],
 			dependsOnChangeSetIds: [],
 			status: "",
-			assigneeIds: [C],
+			assigneeIds: [x],
 			plannedReleases: []
 		},
 		{
 			id: "cs_correction_3",
 			name: "Correction of § 3",
 			state: "published",
-			createdBy: S,
+			createdBy: b,
 			createTime: "2026-09-01T08:00:00.000Z",
 			closeTime: "2026-09-02T08:00:00.000Z",
 			chains: [],
@@ -194,7 +194,7 @@ function de() {
 		}
 	];
 }
-function fe() {
+function he() {
 	return [{
 		id: "rc_print",
 		name: "Druckprobe",
@@ -209,7 +209,7 @@ function fe() {
 		independent: !0
 	}];
 }
-function pe() {
+function ge() {
 	return [
 		{
 			id: "col_bgb",
@@ -237,23 +237,26 @@ function pe() {
 		}
 	];
 }
-function me() {
+function _e() {
 	return [
 		{
 			id: "bp_commentary",
-			name: "Commentary"
+			name: "Commentary",
+			accessor: "commentary"
 		},
 		{
 			id: "bp_footnote",
-			name: "Footnote"
+			name: "Footnote",
+			accessor: "footnote"
 		},
 		{
 			id: "bp_paragraph",
-			name: "Paragraph"
+			name: "Paragraph",
+			accessor: "paragraph"
 		}
 	];
 }
-function he() {
+function ve() {
 	return [
 		{
 			id: "bpr_paragraph_2",
@@ -275,7 +278,7 @@ function he() {
 		}
 	];
 }
-function ge() {
+function ye() {
 	let e = (e, t) => ({
 		field_type: "text",
 		config: {
@@ -311,7 +314,7 @@ function ge() {
 		}
 	};
 }
-function E() {
+function w() {
 	let e = "2026-09-01T08:00:00.000Z";
 	return {
 		id: "content_note_1",
@@ -341,7 +344,7 @@ function E() {
 		}]
 	};
 }
-function _e() {
+function be() {
 	let e = "2001-11-01T08:00:00.000Z";
 	return {
 		id: "content_para_3",
@@ -372,7 +375,7 @@ function _e() {
 		}]
 	};
 }
-function ve() {
+function xe() {
 	let e = "2026-09-01T08:00:00.000Z";
 	return [
 		{
@@ -405,7 +408,7 @@ function ve() {
 			blueprintId: "bp_paragraph",
 			blueprintReleaseId: "bpr_paragraph_1",
 			collectionIds: ["col_bgb"],
-			assigneeIds: [S, C],
+			assigneeIds: [b, x],
 			main: {
 				revisionId: "rev_p1_main",
 				data: {
@@ -472,7 +475,7 @@ function ve() {
 					secondParentId: "",
 					blueprintReleaseId: "bpr_paragraph_1",
 					createTime: "2026-09-30T09:00:00.000Z",
-					author: S,
+					author: b,
 					cause: "save",
 					branchId: "br_para_1_b",
 					changeSetId: "cs_bgbl_270",
@@ -488,7 +491,7 @@ function ve() {
 					secondParentId: "",
 					blueprintReleaseId: "bpr_paragraph_1",
 					createTime: "2026-09-30T08:30:00.000Z",
-					author: C,
+					author: x,
 					cause: "save",
 					branchId: "br_para_1_a",
 					changeSetId: "cs_bgbl_270",
@@ -504,7 +507,7 @@ function ve() {
 					secondParentId: "",
 					blueprintReleaseId: "bpr_paragraph_1",
 					createTime: e,
-					author: S,
+					author: b,
 					cause: "create",
 					branchId: "br_para_1_main",
 					changeSetId: "cs_correction_3"
@@ -588,7 +591,7 @@ function ve() {
 			blueprintId: "bp_paragraph",
 			blueprintReleaseId: "bpr_paragraph_1",
 			collectionIds: ["col_stgb"],
-			assigneeIds: [C],
+			assigneeIds: [x],
 			main: {
 				revisionId: "rev_s211_main",
 				data: {
@@ -625,7 +628,7 @@ function ve() {
 }
 //#endregion
 //#region src/testing/stub-blueprint-source.ts
-function D(e = me(), t = he()) {
+function T(e = _e(), t = ve()) {
 	return {
 		async searchBlueprints({ query: t }) {
 			let n = t.trim().toLocaleLowerCase();
@@ -637,6 +640,9 @@ function D(e = me(), t = he()) {
 		async getBlueprints(t) {
 			return e.filter((e) => t.includes(e.id)).map((e) => ({ ...e }));
 		},
+		async getBlueprintsByAccessor(t) {
+			return e.filter((e) => t.includes(e.accessor)).map((e) => ({ ...e }));
+		},
 		async listReleases(e) {
 			return t.filter((t) => t.blueprintId === e).map((e) => ({ ...e }));
 		}
@@ -644,52 +650,78 @@ function D(e = me(), t = he()) {
 }
 //#endregion
 //#region src/testing/stub-client.ts
-function ye(e, t) {
+function Se(e) {
+	let t = /* @__PURE__ */ new Date(`${e}T00:00:00Z`);
+	return t.setUTCDate(t.getUTCDate() - 1), t.toISOString().slice(0, 10);
+}
+function Ce(e, t) {
 	let n = /* @__PURE__ */ new Date(`${e}T00:00:00Z`);
 	return n.setUTCDate(n.getUTCDate() + t), n.toISOString().slice(0, 10);
 }
-function O(e, t, n) {
+function E(e, t, n) {
 	let r = e.trim();
-	if (r === "") throw new _(`${t} is required`);
-	if ([...r].length > n) throw new _(`${t} is at most ${n} characters`);
-	if (/[\u0000-\u001f\u007f]/.test(r)) throw new _(`${t} is one line of text`);
+	if (r === "") throw new u(`${t} is required`);
+	if ([...r].length > n) throw new u(`${t} is at most ${n} characters`);
+	if (/[\u0000-\u001f\u007f]/.test(r)) throw new u(`${t} is one line of text`);
 	return r;
 }
-function be(e) {
-	if (!/^\d{4}-\d{2}-\d{2}$/.test(e.date.trim())) throw new _(`source.date "${e.date}" is not a day as YYYY-MM-DD`);
+function we(e) {
+	if (!/^\d{4}-\d{2}-\d{2}$/.test(e.date.trim())) throw new u(`source.date "${e.date}" is not a day as YYYY-MM-DD`);
 	return {
 		date: e.date.trim(),
-		reference: O(e.reference, "source.reference", 500)
+		reference: E(e.reference, "source.reference", 500)
 	};
 }
-function xe(e) {
+function Te(e) {
 	let t = e.trim();
-	if (t === "") throw new _("a Block Reason needs a name");
-	if ([...t].length > 200) throw new _("a Block Reason's name is at most 200 characters");
-	if (/[\u0000-\u001f\u007f]/.test(t)) throw new _("a Block Reason's name is one line of text");
+	if (t === "") throw new u("a Block Reason needs a name");
+	if ([...t].length > 200) throw new u("a Block Reason's name is at most 200 characters");
+	if (/[\u0000-\u001f\u007f]/.test(t)) throw new u("a Block Reason's name is one line of text");
 	return t;
 }
-function Se(e) {
-	let t = O(e.name, "a Required Check's name", 200);
-	if (e.scope !== "branch" && e.scope !== "change_set") throw new _("a Required Check's scope is Branch or Change Set");
+function Ee(e) {
+	let t = E(e.name, "a Required Check's name", 200);
+	if (e.scope !== "branch" && e.scope !== "change_set") throw new u("a Required Check's scope is Branch or Change Set");
 	let n = e.blueprintAccessors.map((e) => {
 		let t = e.trim();
-		if (t === "" || [...t].length > 200 || /[\u0000-\u001f\u007f]/.test(t)) throw new _(`"${t}" is not a Blueprint accessor`);
+		if (t === "" || [...t].length > 200 || /[\u0000-\u001f\u007f]/.test(t)) throw new u(`"${t}" is not a Blueprint accessor`);
 		return t;
-	});
+	}), r = [...new Set(n)].sort();
+	if (e.everyBlueprint && r.length > 0) throw new u("a Required Check applies to every Blueprint or names Blueprints, not both");
+	if (!e.everyBlueprint && r.length === 0) throw new u("a Required Check names the Blueprints it applies to, or applies to every Blueprint");
 	return {
 		name: t,
 		scope: e.scope,
-		blueprintAccessors: [...new Set(n)].sort(),
+		blueprintAccessors: r,
+		everyBlueprint: e.everyBlueprint,
 		independent: e.independent
 	};
 }
-var Ce = "who records a Required Check can be narrowed only in authz.mode guardian: in workspace mode every member records every check (ADR 0017)", we = "this Change Set holds work you can't see: publishing, discarding or updating all of it needs you to see every Content in it", Te = "Restricted Collections need authz.mode guardian: in workspace mode a restriction could not be enforced (ADR 0017)";
-function k(e, t) {
+function De(e, t) {
+	let n = [];
+	for (let r of t) {
+		let t = e.find((e) => e.accessor === r);
+		t ? t.archived && n.push({
+			accessor: r,
+			reason: "archived"
+		}) : n.push({
+			accessor: r,
+			reason: "unknown"
+		});
+	}
+	if (n.length > 0) throw new p(n);
+}
+var Oe = (e) => ({
+	id: e.id,
+	name: e.name,
+	accessor: e.accessor,
+	archived: e.archived ?? !1
+}), ke = "who records a Required Check can be narrowed only in authz.mode guardian: in workspace mode every member records every check (ADR 0017)", Ae = "this Change Set holds work you can't see: publishing, discarding or updating all of it needs you to see every Content in it", je = "Restricted Collections need authz.mode guardian: in workspace mode a restriction could not be enforced (ADR 0017)";
+function D(e, t) {
 	return new y(`${e} ${t}: not found`, v.NotFound);
 }
-var A = (e) => structuredClone(e);
-function j(e, t = {}) {
+var O = (e) => structuredClone(e);
+function k(e, t = {}) {
 	return {
 		code: e,
 		contentId: "",
@@ -709,49 +741,55 @@ function j(e, t = {}) {
 		...t
 	};
 }
-function M(v = {}) {
-	let y = v.now ?? (() => "2026-10-01T09:00:00.000Z"), b = v.userId ?? "user_stub", x = v.statuses ?? le(), S = v.statusTransitions ?? ue(), C = (v.blockReasons ?? ce()).map((e) => ({ ...e })), w = (v.changeSets ?? de()).map(A), T = (v.collections ?? pe()).map((e) => ({ ...e })), E = structuredClone(v.contents ?? ve()), _e = v.blueprints ?? me(), D = v.blueprintReleases ?? he(), M = v.resolvedReleases ?? ge(), N = structuredClone(v.requiredChecks ?? fe()), P = v.authzMode ?? "guardian", De = new Set(v.withheld ?? []), F = (e) => {
-		if (De.has(e)) throw new r(we);
-	}, I = new Map(Object.entries(structuredClone(v.collectionGrants ?? {}))), L = new Map(Object.entries(structuredClone(v.recorders ?? {}))), Oe = (e) => L.get(e) ?? {
+function A(p = {}) {
+	let v = p.now ?? (() => "2026-10-01T09:00:00.000Z"), y = p.userId ?? "user_stub", le = p.statuses ?? fe(), ue = p.statusTransitions ?? pe(), b = (p.blockReasons ?? de()).map((e) => ({ ...e })), x = (p.changeSets ?? me()).map(O), S = (p.collections ?? ge()).map((e) => ({ ...e })), C = structuredClone(p.contents ?? xe()), w = p.blueprints ?? _e(), be = p.blueprintReleases ?? ve(), T = p.resolvedReleases ?? ye(), A = structuredClone(p.requiredChecks ?? he()), j = p.authzMode ?? "guardian", Ne = new Set(p.withheld ?? []), M = (e) => {
+		if (Ne.has(e)) throw new a(Ae);
+	}, N = new Map(Object.entries(structuredClone(p.collectionGrants ?? {}))), P = new Map(Object.entries(structuredClone(p.recorders ?? {}))), Pe = (e) => P.get(e) ?? {
 		everyMember: !0,
 		userIds: []
-	}, ke = v.memberIds ?? ["user_stub", "user_ben"], Ae = v.admin ?? !0, R = structuredClone(v.editingSettings ?? {
+	}, Fe = p.memberIds ?? ["user_stub", "user_ben"], F = p.admin ?? !0, Ie = p.editingSettings ?? {
 		editingMode: "change_sets",
 		editingBlock: !1
-	}), z = structuredClone(v.editingOverrides ?? []), je = (e) => ({
-		editingMode: e?.editingMode ?? R.editingMode,
-		editingBlock: e?.editingBlock ?? R.editingBlock
-	}), Me = (e) => ({
+	}, I = structuredClone({
+		...Ie,
+		forceGroup: Ie.forceGroup ?? []
+	}), L = structuredClone(p.editingOverrides ?? []), R = (e) => ({
+		editingMode: e?.editingMode ?? I.editingMode,
+		editingBlock: e?.editingBlock ?? I.editingBlock,
+		forceGroup: [...e?.forceGroup ?? I.forceGroup]
+	}), Le = (e) => ({
 		...structuredClone(e),
-		effective: je(e)
-	}), Ne = [
+		forceGroup: e.forceGroup ?? null,
+		effective: R(e)
+	}), Re = (e) => T[e.blueprintReleaseId]?.accessor || e.blueprintId, ze = (e) => F || e.includes(y), Be = (e) => [...new Set(e.map((e) => E(e, "a user id", 200)))].sort(), Ve = [
 		"direct_edits",
 		"change_sets",
 		"both"
-	], Pe = () => {
-		if (!Ae) throw new ne("permission denied");
-	}, Fe = structuredClone(v.checkResults ?? []), Ie = v.publishBlockers ?? {}, Le = v.pendingMerges ?? {}, Re = structuredClone(v.conflicts ?? {}), B = /* @__PURE__ */ new Map(), ze = /* @__PURE__ */ new Map(), V = async (e, t, n) => {
+	], He = () => {
+		if (!F) throw new ne("permission denied");
+	}, Ue = structuredClone(p.checkResults ?? []), We = p.publishBlockers ?? {}, Ge = p.pendingMerges ?? {}, Ke = structuredClone(p.conflicts ?? {}), qe = new Set(p.behind ?? []), z = /* @__PURE__ */ new Map(), Je = /* @__PURE__ */ new Map(), B = async (e, t, n) => {
 		if (!e) return n();
-		let r = JSON.stringify(t), i = ze.get(e);
+		let r = JSON.stringify(t), i = Je.get(e);
 		if (i) {
-			if (i.asked !== r) throw new _(`idempotency key ${e} names another request`);
+			if (i.asked !== r) throw new u(`idempotency key ${e} names another request`);
 			return structuredClone(i.answer);
 		}
 		let a = await n();
-		return ze.set(e, {
+		return Je.set(e, {
 			asked: r,
 			answer: structuredClone(a)
 		}), a;
-	}, Be = /* @__PURE__ */ new Map(), Ve = /* @__PURE__ */ new Map(), H = 1, U = (e) => {
-		let t = E.find((t) => t.id === e);
-		if (!t) throw k("Content", e);
+	}, Ye = /* @__PURE__ */ new Map(), Xe = /* @__PURE__ */ new Map(), V = 1, H = (e) => {
+		let t = C.find((t) => t.id === e);
+		if (!t) throw D("Content", e);
 		return t;
-	}, W = (e) => structuredClone({
+	}, U = (e) => structuredClone({
 		collectionIds: [...e.collectionIds].sort(),
 		assigneeIds: e.assigneeIds ?? [],
 		block: e.block,
-		archiveTime: e.archiveTime
-	}), He = () => y().slice(0, 10), G = (e) => M[e.blueprintReleaseId]?.dated ?? !1, K = (e) => {
+		archiveTime: e.archiveTime,
+		editingBlock: e.editingBlock
+	}), Ze = () => v().slice(0, 10), W = (e) => T[e.blueprintReleaseId]?.dated ?? !1, G = (e) => {
 		let t = [...e.revisions ?? []], n = [...Object.entries(e.branches).map(([e, t]) => ({
 			...t,
 			changeSetId: e
@@ -767,70 +805,70 @@ function M(v = {}) {
 			secondParentId: "",
 			blueprintReleaseId: e.blueprintReleaseId,
 			createTime: r.revisionCreateTime,
-			author: b,
+			author: y,
 			cause: "create",
 			branchId: r.branchId,
 			changeSetId: r.changeSetId,
 			data: r.data
 		});
 		return t.sort((e, t) => e.createTime < t.createTime ? 1 : e.createTime > t.createTime ? -1 : 0);
-	}, q = (e, t) => [
+	}, K = (e, t) => [
 		e.main,
 		e.inForce,
 		...Object.values(e.branches)
-	].find((e) => e?.revisionId === t)?.data ?? e.revisions?.find((e) => e.id === t)?.data, Ue = (e, t) => {
+	].find((e) => e?.revisionId === t)?.data ?? e.revisions?.find((e) => e.id === t)?.data, Qe = (e, t) => {
 		let n = (e) => e == null || e === "" || Array.isArray(e) && e.length === 0;
 		return (e ?? []).filter((e) => e.config.required === !0 && n(t[e.config.api_accessor])).map((e) => e.config.api_accessor);
-	}, J = (e) => {
-		if (e.archiveTime) throw new l(e.id);
-		if (e.block && !e.block.allowedUserIds.includes(b)) throw new ae(e.id, e.block.blockReasonId);
-	}, We = (e) => E.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && n.pinReleaseId === "" && t.inForce?.revisionId === n.sourceRevisionId).map((e) => ({
+	}, q = (e) => {
+		if (e.archiveTime) throw new ae(e.id);
+		if (e.block && !e.block.allowedUserIds.includes(y)) throw new ce(e.id, e.block.blockReasonId);
+	}, $e = (e) => C.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && n.pinReleaseId === "" && t.inForce?.revisionId === n.sourceRevisionId).map((e) => ({
 		edge: { ...e },
 		releaseId: t.inForce?.releaseId ?? ""
-	}))), Ge = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), Ke = (e, t) => C.some((n) => n.name === e && n.id !== t), qe = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), Y = (e) => {
-		let t = T.find((t) => t.id === e);
-		if (!t) throw k("Collection", e);
+	}))), et = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), tt = (e, t) => b.some((n) => n.name === e && n.id !== t), nt = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), J = (e) => {
+		let t = S.find((t) => t.id === e);
+		if (!t) throw D("Collection", e);
 		return t;
-	}, Je = (e, t, n) => T.some((r) => r.parentId === e && r.name === t && r.id !== n), Ye = (e) => {
-		if (P === "workspace") throw new m(Te);
-		if (!Y(e).restricted) throw new _(`Collection ${e} is open: only a Restricted Collection takes grants`);
-		let t = (I.get(e) ?? []).some((e) => e.userId === b && e.level === "owner");
-		if (!Ae && !t) throw new ne("only its owner or a workspace admin manages its grants");
-	}, Xe = (t) => {
-		if (P === "workspace") throw new e("required_check_recorders", Ce);
-		if (!Ae) throw new ne("permission denied");
-		if (t === "") throw new _("required_check_id is required");
-		if (!N.some((e) => e.id === t)) throw k("Required Check", t);
-		return Oe(t);
-	}, Ze = async ({ changeSetId: e, branchId: t, expectedHeadId: n, data: r, fieldMask: a }) => {
-		let o = Z(e).chains.find((e) => e.branches.some((e) => e.id === t)), s = o?.branches.find((e) => e.id === t);
-		if (!o || !s) throw k("Branch", t);
-		let c = U(o.contentId);
-		if (J(c), B.has(t)) throw new _("a Pending Merge waits on this Branch: resolve or abort it first");
-		if (n === "") throw new _("expected_head_id is required");
-		if (s.headRevisionId !== n) throw new i({
+	}, rt = (e, t, n) => S.some((r) => r.parentId === e && r.name === t && r.id !== n), it = (t) => {
+		if (j === "workspace") throw new e(je);
+		if (!J(t).restricted) throw new u(`Collection ${t} is open: only a Restricted Collection takes grants`);
+		let n = (N.get(t) ?? []).some((e) => e.userId === y && e.level === "owner");
+		if (!F && !n) throw new ne("only its owner or a workspace admin manages its grants");
+	}, at = (e) => {
+		if (j === "workspace") throw new oe("required_check_recorders", ke);
+		if (!F) throw new ne("permission denied");
+		if (e === "") throw new u("required_check_id is required");
+		if (!A.some((t) => t.id === e)) throw D("Required Check", e);
+		return Pe(e);
+	}, ot = async ({ changeSetId: e, branchId: t, expectedHeadId: n, data: r, fieldMask: i }) => {
+		let a = X(e).chains.find((e) => e.branches.some((e) => e.id === t)), s = a?.branches.find((e) => e.id === t);
+		if (!a || !s) throw D("Branch", t);
+		let c = H(a.contentId);
+		if (q(c), z.has(t)) throw new u("a Pending Merge waits on this Branch: resolve or abort it first");
+		if (n === "") throw new u("expected_head_id is required");
+		if (s.headRevisionId !== n) throw new o({
 			contentId: c.id,
 			branchId: t,
 			expectedHeadId: n,
 			currentHeadId: s.headRevisionId
 		});
-		let l = q(c, s.headRevisionId) ?? {}, u = JSON.parse(JSON.stringify(r)), d;
-		if (a) {
-			let e = Object.keys(u).filter((e) => !a.includes(e));
-			if (e.length > 0) throw new _(`data holds ${e.join(", ")}, which the mask doesn't name`);
-			d = structuredClone(l);
-			for (let e of a) e in u ? d[e] = u[e] : delete d[e];
-		} else d = u;
-		return Qe({
+		let l = K(c, s.headRevisionId) ?? {}, d = JSON.parse(JSON.stringify(r)), f;
+		if (i) {
+			let e = Object.keys(d).filter((e) => !i.includes(e));
+			if (e.length > 0) throw new u(`data holds ${e.join(", ")}, which the mask doesn't name`);
+			f = structuredClone(l);
+			for (let e of i) e in d ? f[e] = d[e] : delete f[e];
+		} else f = d;
+		return st({
 			changeSetId: e,
-			chain: o,
+			chain: a,
 			branch: s,
 			c,
-			data: d,
+			data: f,
 			cause: "save"
 		});
-	}, Qe = ({ changeSetId: e, chain: t, branch: n, c: r, data: i, cause: a, secondParentId: o = "" }) => {
-		let s = n.id, c = `rev_stub_${H++}`, l = y();
+	}, st = ({ changeSetId: e, chain: t, branch: n, c: r, data: i, cause: a, secondParentId: o = "" }) => {
+		let s = n.id, c = `rev_stub_${V++}`, l = v();
 		return r.revisions = [{
 			id: c,
 			contentId: r.id,
@@ -838,7 +876,7 @@ function M(v = {}) {
 			secondParentId: o,
 			blueprintReleaseId: r.blueprintReleaseId,
 			createTime: l,
-			author: b,
+			author: y,
 			cause: a,
 			branchId: s,
 			changeSetId: e,
@@ -859,17 +897,17 @@ function M(v = {}) {
 			revisionCreateTime: l,
 			releaseId: ""
 		};
-	}, $e = (e, t) => {
-		let n = Z(e), r = n.chains.find((e) => e.branches.some((e) => e.id === t)), i = r?.branches.find((e) => e.id === t);
-		if (!r || !i) throw k("Branch", t);
+	}, ct = (e, t) => {
+		let n = X(e), r = n.chains.find((e) => e.branches.some((e) => e.id === t)), i = r?.branches.find((e) => e.id === t);
+		if (!r || !i) throw D("Branch", t);
 		return {
 			cs: n,
 			chain: r,
 			branch: i,
-			c: U(r.contentId)
+			c: H(r.contentId)
 		};
-	}, et = (e, t) => {
-		for (let n of w) for (let r of n.chains) {
+	}, lt = (e, t) => {
+		for (let n of x) for (let r of n.chains) {
 			let n = r.branches.find((t) => t.id === e);
 			if (!n) continue;
 			let i = {
@@ -882,37 +920,37 @@ function M(v = {}) {
 				fields: structuredClone(t.fields),
 				merged: structuredClone(t.merged)
 			};
-			B.set(e, i), n.hasPendingMerge = !0, delete Re[e];
+			z.set(e, i), n.hasPendingMerge = !0, delete Ke[e];
 			return;
 		}
-		throw k("Branch", e);
-	}, tt = (e) => {
-		B.delete(e);
-		for (let t of w) for (let n of t.chains) {
+		throw D("Branch", e);
+	}, ut = (e) => {
+		z.delete(e);
+		for (let t of x) for (let n of t.chains) {
 			let t = n.branches.find((t) => t.id === e);
 			t && (t.hasPendingMerge = !1);
 		}
-	}, nt = (e, t) => {
+	}, dt = (e, t) => {
 		let n = t.validityPeriod;
-		if (G(e)) {
-			if (!n || !g.test(n.firstDay)) throw new _("validity_period.first_day is required for Dated Content");
-			if (n.lastDay !== "" && (!g.test(n.lastDay) || n.lastDay < n.firstDay)) throw new _("validity_period.last_day is a day on or after first_day");
-		} else if (n) throw new _("validity_period is refused for undated Content");
-		let r = Ue(M[e.blueprintReleaseId]?.releaseSpec, t.releaseSpec ?? {}).map((e) => ({
+		if (W(e)) {
+			if (!n || !_.test(n.firstDay)) throw new u("validity_period.first_day is required for Dated Content");
+			if (n.lastDay !== "" && (!_.test(n.lastDay) || n.lastDay < n.firstDay)) throw new u("validity_period.last_day is a day on or after first_day");
+		} else if (n) throw new u("validity_period is refused for undated Content");
+		let r = Qe(T[e.blueprintReleaseId]?.releaseSpec, t.releaseSpec ?? {}).map((e) => ({
 			source: "fieldkit",
 			code: "required",
 			path: `/${e}`
 		}));
-		if (r.length > 0) throw new se("the Release Spec values break the Blueprint Release", r);
+		if (r.length > 0) throw new f("the Release Spec values break the Blueprint Release", r);
 		if (n && n.lastDay !== "") {
 			let r = (e.timeline ?? []).filter((e) => e.validityPeriod && e.validityPeriod.lastDay !== "" && n.firstDay <= e.validityPeriod.firstDay && e.validityPeriod.lastDay <= n.lastDay && !t.supersedesReleaseIds.includes(e.releaseId)).map((e) => e.releaseId);
-			if (r.length > 0) throw new u(e.id, r);
+			if (r.length > 0) throw new se(e.id, r);
 		}
-	}, rt = (e, t) => {
+	}, ft = (e, t) => {
 		let n = e.plannedReleases.filter((e) => e.contentId === t.id && e.proposed), r = e.plannedReleases.filter((e) => !(e.contentId === t.id && e.proposed)), i = [], a = (e, r, a) => {
 			let o = n.find((t) => t.proposedForReleaseId === e.releaseId && t.splitFromReleaseId === a);
 			i.push({
-				id: o?.id ?? `rls_stub_${H++}`,
+				id: o?.id ?? `rls_stub_${V++}`,
 				contentId: t.id,
 				kind: "date_only",
 				branchId: "",
@@ -931,23 +969,23 @@ function M(v = {}) {
 				let t = r.validityPeriod;
 				t && !e.supersedesReleaseIds.includes(r.releaseId) && t.firstDay < n.firstDay && (t.lastDay === "" || t.lastDay >= n.firstDay) && (a(r, {
 					firstDay: t.firstDay,
-					lastDay: ye(n.firstDay, -1)
+					lastDay: Ce(n.firstDay, -1)
 				}, ""), n.lastDay !== "" && (t.lastDay === "" || t.lastDay > n.lastDay) && a(r, {
-					firstDay: ye(n.lastDay, 1),
+					firstDay: Ce(n.lastDay, 1),
 					lastDay: t.lastDay
 				}, r.releaseId));
 			}
 		}
 		e.plannedReleases = [...r, ...i];
-	}, X = (e) => {
-		let t = w.find((t) => t.id === e);
-		if (!t) throw k("Change Set", e);
+	}, Y = (e) => {
+		let t = x.find((t) => t.id === e);
+		if (!t) throw D("Change Set", e);
 		return t;
-	}, Z = (e) => {
-		let t = X(e);
-		if (t.state !== "open") throw new p(t.state);
+	}, X = (e) => {
+		let t = Y(e);
+		if (t.state !== "open") throw new m(t.state);
 		return t;
-	}, it = (e) => x.find((t) => t.slug === e)?.name ?? e, at = (e, t, n = /* @__PURE__ */ new Set()) => e === t || !n.has(e) && (n.add(e), (w.find((t) => t.id === e)?.dependsOnChangeSetIds ?? []).some((e) => at(e, t, n))), ot = (e) => [...e.chains.flatMap((e) => e.branches.map((t) => ({
+	}, pt = (e) => le.find((t) => t.slug === e)?.name ?? e, mt = (e, t, n = /* @__PURE__ */ new Set()) => e === t || !n.has(e) && (n.add(e), (x.find((t) => t.id === e)?.dependsOnChangeSetIds ?? []).some((e) => mt(e, t, n))), ht = (e) => [...e.chains.flatMap((e) => e.branches.map((t) => ({
 		key: t.id,
 		branchless: !1,
 		contentId: e.contentId,
@@ -957,9 +995,12 @@ function M(v = {}) {
 		branchless: !0,
 		contentId: e.contentId,
 		revision: e.revisionId
-	}))], st = (e) => E.find((t) => t.id === e)?.blueprintId, ct = (e, t) => e.blueprintAccessors.length === 0 || e.blueprintAccessors.includes(st(t) ?? ""), lt = (e) => {
-		let t = ot(e), n = (t, n) => Fe.filter((n) => n.changeSetId === e.id && n.requiredCheckId === t.id).filter((e) => (t.scope === "change_set" ? "" : Object.keys(e.heads)[0]) === n).reverse().map(({ changeSetId: e, ...t }) => structuredClone(t)), r = (e, t, n) => {
-			let r = n[0], i = r ? !h(r.heads, t.heads) : !1;
+	}))], gt = (e) => {
+		let t = C.find((t) => t.id === e)?.blueprintId;
+		return w.find((e) => e.id === t)?.accessor;
+	}, _t = (e, t) => e.blueprintAccessors.length === 0 || e.blueprintAccessors.includes(gt(t) ?? ""), vt = (e) => {
+		let t = ht(e), n = (t, n) => Ue.filter((n) => n.changeSetId === e.id && n.requiredCheckId === t.id).filter((e) => (t.scope === "change_set" ? "" : Object.keys(e.heads)[0]) === n).reverse().map(({ changeSetId: e, ...t }) => structuredClone(t)), r = (e, t, n) => {
+			let r = n[0], i = r ? !g(r.heads, t.heads) : !1;
 			return {
 				check: structuredClone(e),
 				...t,
@@ -968,8 +1009,8 @@ function M(v = {}) {
 				cleared: !!r && !i && r.outcome !== "failed"
 			};
 		}, i = [], a = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id);
-		for (let e of [...N].sort(a)) {
-			let a = t.filter((t) => ct(e, t.contentId));
+		for (let e of [...A].sort(a)) {
+			let a = t.filter((t) => _t(e, t.contentId));
 			if (e.scope === "change_set") {
 				if (a.length === 0) continue;
 				let o = Object.fromEntries(t.map((e) => [e.key, e.revision]));
@@ -989,41 +1030,48 @@ function M(v = {}) {
 			}, n(e, t.key)));
 		}
 		return i;
-	}, ut = (e, t) => {
+	}, yt = (e, t) => {
 		let n = [], r = re(e);
-		for (let r of e.chains) for (let e of r.branches) t[e.id] !== e.headRevisionId && n.push(j("moved_head", {
+		for (let r of e.chains) for (let e of r.branches) t[e.id] !== e.headRevisionId && n.push(k("moved_head", {
 			contentId: r.contentId,
 			branchId: e.id,
 			expectedHeadId: t[e.id] ?? "",
 			currentHeadId: e.headRevisionId
 		}));
-		for (let [e, i] of Object.entries(t)) e in r || n.push(j("moved_head", {
+		for (let [e, i] of Object.entries(t)) e in r || n.push(k("moved_head", {
 			branchId: e,
 			expectedHeadId: i
 		}));
+		for (let t of e.chains) for (let e of t.branches) qe.has(e.id) && n.push(k("behind_base", {
+			contentId: t.contentId,
+			branchId: e.id
+		})), z.has(e.id) && n.push(k("pending_merge", {
+			contentId: t.contentId,
+			branchId: e.id
+		}));
 		for (let t of e.dependsOnChangeSetIds) {
-			let e = w.find((e) => e.id === t)?.state;
-			e === "open" ? n.push(j("unpublished_dependency", { dependencyChangeSetId: t })) : e === "discarded" && n.push(j("discarded_dependency", { dependencyChangeSetId: t }));
+			let e = x.find((e) => e.id === t)?.state;
+			e === "open" ? n.push(k("unpublished_dependency", { dependencyChangeSetId: t })) : e === "discarded" && n.push(k("discarded_dependency", { dependencyChangeSetId: t }));
 		}
-		for (let t of lt(e)) t.cleared || n.push(j("outstanding_check", {
+		for (let t of vt(e)) t.cleared || n.push(k("outstanding_check", {
 			requiredCheckId: t.check.id,
 			contentId: t.contentId,
 			branchId: t.branchId,
 			releaseId: t.releaseId
 		}));
 		for (let t of e.chains) {
-			let e = E.find((e) => e.id === t.contentId);
+			let e = C.find((e) => e.id === t.contentId);
 			for (let r of t.branches) {
-				let t = e && q(e, r.headRevisionId);
-				if (e && t) for (let i of Ue(M[e.blueprintReleaseId]?.fields, t)) n.push(j("missing_required_field", {
+				let t = e && K(e, r.headRevisionId);
+				if (e && t) for (let i of Qe(T[e.blueprintReleaseId]?.fields, t)) n.push(k("missing_required_field", {
 					contentId: e.id,
 					revisionId: r.headRevisionId,
 					path: `/${i}`
 				}));
 			}
 		}
-		return [...n, ...structuredClone(Ie[e.id] ?? [])];
-	}, Q = (e) => {
+		return [...n, ...structuredClone(We[e.id] ?? [])];
+	}, Z = (e) => {
 		let t = re(e);
 		return e.plannedReleases.filter((e) => !e.withheld).map((n) => ({
 			id: n.id,
@@ -1036,37 +1084,148 @@ function M(v = {}) {
 			validityPeriod: n.validityPeriod ? { ...n.validityPeriod } : void 0
 		}));
 	};
-	for (let [e, t] of Object.entries(Re)) t.pending && et(e, t);
-	let $ = {
+	for (let [e, t] of Object.entries(Ke)) t.pending && lt(e, t);
+	let bt = (e, t) => {
+		for (let n of Object.keys(e)) n in t || delete e[n];
+		Object.assign(e, t);
+	}, xt = (e, t) => {
+		let n = e.chains[0], r = n?.branches[0], i = r?.effectiveOn ?? "";
+		if (!n || !r || !i) throw new u("the Direct Edit's Content is undated: no period to plan");
+		let a = H(n.contentId), o = a.timeline ?? [], s = o.find((e) => e.releaseId === r.carriedReleaseId), c = s?.validityPeriod && i <= e.createTime.slice(0, 10) ? s : void 0, l = c?.validityPeriod ? { ...c.validityPeriod } : {
+			firstDay: i,
+			lastDay: ""
+		};
+		if (t !== void 0) {
+			if (t !== "" && (!_.test(t) || t < l.firstDay)) throw new u("validity_last_day is YYYY-MM-DD, not before the first day");
+			l.lastDay = t;
+		}
+		let d = o.filter((e) => e.releaseId !== c?.releaseId && e.validityPeriod && l.lastDay !== "" && l.firstDay <= e.validityPeriod.firstDay && e.validityPeriod.lastDay !== "" && e.validityPeriod.lastDay <= l.lastDay).map((e) => e.releaseId);
+		if (d.length > 0) throw new se(a.id, d, !0);
+		let f = [];
+		!c && s?.validityPeriod && s.validityPeriod.firstDay < i && f.push({
+			id: `rls_stub_${V++}`,
+			contentId: a.id,
+			kind: "date_only",
+			branchId: "",
+			revisionId: s.revisionId,
+			validityPeriod: {
+				firstDay: s.validityPeriod.firstDay,
+				lastDay: Se(i)
+			},
+			supersedesReleaseIds: [s.releaseId],
+			proposed: !0,
+			proposedForReleaseId: s.releaseId,
+			splitFromReleaseId: "",
+			withheld: !1
+		});
+		let p = n.branches.slice(1).flatMap((e) => {
+			let t = o.find((t) => t.releaseId === e.carriedReleaseId);
+			return t ? [{
+				releaseId: t.releaseId,
+				validityPeriod: t.validityPeriod
+			}] : [];
+		});
+		return {
+			validityPeriod: l,
+			correctsReleaseId: c?.releaseId ?? "",
+			dateOnlyReleases: f,
+			laterWordings: p
+		};
+	}, St = async (e, t, n, r = {}) => {
+		let i = e.id, a = e.chains[0], o = a?.branches[0];
+		if (!a || !o) throw Error(`Direct Edit ${i} has no Branch`);
+		let s = !!o.effectiveOn;
+		if (!s && (r.validityLastDay !== void 0 || (r.carryForward ?? []).length > 0)) throw new u("validity_last_day and carry_forward are for Dated Content");
+		if (e.state === "open") {
+			let t = s ? xt(e, r.validityLastDay) : void 0, c = e.plannedReleases.find((e) => e.branchId === o.id && !e.proposed);
+			if (c ? (n || t) && await Q.updatePlannedRelease({
+				changeSetId: i,
+				plannedReleaseId: c.id,
+				releaseSpec: n,
+				validityPeriod: t?.validityPeriod
+			}) : await Q.planRelease({
+				changeSetId: i,
+				branchId: o.id,
+				releaseSpec: n,
+				validityPeriod: t?.validityPeriod,
+				supersedesReleaseIds: t?.correctsReleaseId ? [t.correctsReleaseId] : void 0
+			}), t) {
+				let n = new Map((r.carryForward ?? []).map((e) => [e.releaseId, e.carry])), i = t.laterWordings.filter((e) => !n.has(e.releaseId));
+				if (i.length > 0) throw new u(`carry_forward has no answer for the later wordings ${i.map((e) => e.releaseId).join(", ")}`);
+				e.plannedReleases.push(...t.dateOnlyReleases);
+				for (let r of a.branches.slice(1)) {
+					let i = t.laterWordings.find((e) => e.releaseId === r.carriedReleaseId);
+					i && n.get(i.releaseId) && e.plannedReleases.push({
+						id: `rls_stub_${V++}`,
+						contentId: a.contentId,
+						kind: "revision",
+						branchId: r.id,
+						revisionId: "",
+						validityPeriod: i.validityPeriod,
+						supersedesReleaseIds: [i.releaseId],
+						proposed: !0,
+						proposedForReleaseId: i.releaseId,
+						splitFromReleaseId: "",
+						withheld: !1
+					});
+				}
+			}
+		}
+		let c = await Q.publish({
+			id: i,
+			reviewedHeads: {
+				...re(e),
+				[o.id]: t
+			}
+		}), l = H(a.contentId);
+		l.editingBlock?.changeSetId === i && (l.editingBlock = void 0);
+		let d = l.branches[i], f = c.releases.find((e) => e.branchId === o.id), p = a.branches.length > 1;
+		if (d && f && !p && l.main?.revisionId !== d.revisionId) {
+			let { branchId: e, ...t } = structuredClone(d);
+			l.main = t, l.inForce = {
+				...structuredClone(t),
+				releaseId: f.id
+			}, l.timeline = [...l.timeline ?? [], {
+				ordinal: (l.timeline?.length ?? 0) + 1,
+				releaseId: f.id,
+				kind: "revision",
+				revisionId: d.revisionId,
+				blueprintReleaseId: l.blueprintReleaseId,
+				publishTime: c.publishTime,
+				first: !1
+			}];
+		}
+		return c;
+	}, Q = {
 		async listBlockReasons() {
-			return [...C].sort(Ge).map((e) => ({ ...e }));
+			return [...b].sort(et).map((e) => ({ ...e }));
 		},
 		async createBlockReason({ name: e }) {
-			let t = xe(e);
-			if (Ke(t)) throw new ie(t);
+			let t = Te(e);
+			if (tt(t)) throw new ie(t);
 			let n = {
-				id: `br_stub_${H++}`,
+				id: `br_stub_${V++}`,
 				name: t,
-				createTime: y(),
-				updateTime: y()
+				createTime: v(),
+				updateTime: v()
 			};
-			return C.push(n), { ...n };
+			return b.push(n), { ...n };
 		},
 		async renameBlockReason({ id: e, name: t }) {
-			let n = xe(t), r = C.find((t) => t.id === e);
-			if (!r) throw k("Block Reason", e);
-			if (Ke(n, e)) throw new ie(n);
-			return r.name = n, r.updateTime = y(), { ...r };
+			let n = Te(t), r = b.find((t) => t.id === e);
+			if (!r) throw D("Block Reason", e);
+			if (tt(n, e)) throw new ie(n);
+			return r.name = n, r.updateTime = v(), { ...r };
 		},
 		async deleteBlockReason({ id: e }) {
-			if (!C.some((t) => t.id === e)) throw k("Block Reason", e);
-			C = C.filter((t) => t.id !== e);
+			if (!b.some((t) => t.id === e)) throw D("Block Reason", e);
+			b = b.filter((t) => t.id !== e);
 		},
 		async listChangeSets(e = {}) {
-			let t = w.filter((t) => (!e.state || t.state === e.state) && (!e.assigneeId || t.assigneeIds.includes(e.assigneeId)) && (!e.contentId || t.chains.some((t) => t.contentId === e.contentId)) && (!e.kind || (t.kind ?? "change_set") === e.kind) && (!e.editorId || t.editorId === e.editorId)), n = Math.min(e.pageSize || 50, 200), r = e.pageToken ? Number(e.pageToken) : 0;
+			let t = x.filter((t) => (!e.state || t.state === e.state) && (!e.assigneeId || t.assigneeIds.includes(e.assigneeId)) && (!e.contentId || t.chains.some((t) => t.contentId === e.contentId)) && (!e.kind || (t.kind ?? "change_set") === e.kind) && (!e.editorId || t.editorId === e.editorId)), n = Math.min(e.pageSize || 50, 200), r = e.pageToken ? Number(e.pageToken) : 0;
 			return {
 				changeSets: t.slice(r, r + n).map((e) => ({
-					...A(e),
+					...O(e),
 					chains: [],
 					dependsOnChangeSetIds: [],
 					plannedReleases: []
@@ -1075,115 +1234,115 @@ function M(v = {}) {
 			};
 		},
 		async createChangeSet({ name: e, source: t }) {
-			let n = O(e, "name", 200), r = t ? be(t) : void 0, i = {
-				id: `cs_stub_${H++}`,
+			let n = E(e, "name", 200), r = t ? we(t) : void 0, i = {
+				id: `cs_stub_${V++}`,
 				name: n,
 				source: r,
 				state: "open",
-				createdBy: b,
-				createTime: y(),
+				createdBy: y,
+				createTime: v(),
 				chains: [],
 				dependsOnChangeSetIds: [],
 				status: "",
 				assigneeIds: [],
 				plannedReleases: []
 			};
-			return w.unshift(i), A(i);
+			return x.unshift(i), O(i);
 		},
 		async getChangeSet(e) {
-			return A(X(e));
+			return O(Y(e));
 		},
 		async updateChangeSet({ id: e, updateMask: t, name: n, source: r }) {
-			let i = Z(e);
-			if (t.length === 0) throw new _("update_mask is required");
-			let a = t.includes("name") ? O(n ?? "", "name", 200) : i.name, o = i.source;
-			return t.includes("source") && (o = r ? be(r) : void 0), i.name = a, i.source = o, A(i);
+			let i = X(e);
+			if (t.length === 0) throw new u("update_mask is required");
+			let a = t.includes("name") ? E(n ?? "", "name", 200) : i.name, o = i.source;
+			return t.includes("source") && (o = r ? we(r) : void 0), i.name = a, i.source = o, O(i);
 		},
 		async setChangeSetStatus({ id: e, expectedStatus: t, status: n }) {
-			let r = Z(e);
-			if (r.status !== t) throw new a(r.status);
-			if (r.status === n) return A(r);
-			if (!x.some((e) => e.slug === n)) throw new _(`status "${n}" is not in the workspace's catalogue`);
-			if (x.some((e) => e.slug === r.status) && !(S[r.status] ?? []).includes(n)) throw new o({
+			let r = X(e);
+			if (r.status !== t) throw new c(r.status);
+			if (r.status === n) return O(r);
+			if (!le.some((e) => e.slug === n)) throw new u(`status "${n}" is not in the workspace's catalogue`);
+			if (le.some((e) => e.slug === r.status) && !(ue[r.status] ?? []).includes(n)) throw new i({
 				fromStatus: r.status,
 				toStatus: n,
-				reason: `There is no transition from ${it(r.status)} to ${it(n)}.`,
+				reason: `There is no transition from ${pt(r.status)} to ${pt(n)}.`,
 				requiresPermission: !1
 			});
-			return r.status = n, A(r);
+			return r.status = n, O(r);
 		},
 		async setChangeSetAssignees({ id: e, assigneeIds: t }) {
-			let n = X(e);
-			if (new Set(t).size !== t.length) throw new _("each assignee is given once");
-			if (t.length > 50) throw new _("at most 50 assignees");
-			return n.assigneeIds = [...t], A(n);
+			let n = Y(e);
+			if (new Set(t).size !== t.length) throw new u("each assignee is given once");
+			if (t.length > 50) throw new u("at most 50 assignees");
+			return n.assigneeIds = [...t], O(n);
 		},
 		async addDependency({ id: e, dependsOnId: t }) {
-			let n = Z(e), r = X(t);
-			if (r.state !== "open") throw new _(`Change Set ${t} is ${r.state}`);
-			if (at(t, e)) throw new _("the dependency would close a cycle");
-			return n.dependsOnChangeSetIds.includes(t) || n.dependsOnChangeSetIds.push(t), A(n);
+			let n = X(e), r = Y(t);
+			if (r.state !== "open") throw new u(`Change Set ${t} is ${r.state}`);
+			if (mt(t, e)) throw new u("the dependency would close a cycle");
+			return n.dependsOnChangeSetIds.includes(t) || n.dependsOnChangeSetIds.push(t), O(n);
 		},
 		async removeDependency({ id: e, dependsOnId: t }) {
-			let n = Z(e);
-			if (!n.dependsOnChangeSetIds.includes(t)) throw k(`dependency of Change Set ${e} on`, t);
-			return n.dependsOnChangeSetIds = n.dependsOnChangeSetIds.filter((e) => e !== t), A(n);
+			let n = X(e);
+			if (!n.dependsOnChangeSetIds.includes(t)) throw D(`dependency of Change Set ${e} on`, t);
+			return n.dependsOnChangeSetIds = n.dependsOnChangeSetIds.filter((e) => e !== t), O(n);
 		},
 		async validatePublish({ id: e, reviewedHeads: t }) {
-			let n = X(e);
-			F(e);
-			let r = Be.get(e);
-			if (r && h(r, t)) return {
+			let n = Y(e);
+			M(e);
+			let r = Ye.get(e);
+			if (r && g(r, t)) return {
 				blockers: [],
-				releases: Q(n),
+				releases: Z(n),
 				published: !0
 			};
-			if (n.state !== "open") throw new p(n.state);
+			if (n.state !== "open") throw new m(n.state);
 			return {
-				blockers: ut(n, t),
-				releases: Q(n),
+				blockers: yt(n, t),
+				releases: Z(n),
 				published: !1
 			};
 		},
-		async publish({ id: e, reviewedHeads: n }) {
-			let r = X(e);
-			F(e);
-			let i = Be.get(e);
-			if (i && h(i, n)) return {
-				changeSet: A(r),
-				publishTime: r.closeTime ?? y(),
-				releases: Q(r)
+		async publish({ id: e, reviewedHeads: t }) {
+			let n = Y(e);
+			M(e);
+			let r = Ye.get(e);
+			if (r && g(r, t)) return {
+				changeSet: O(n),
+				publishTime: n.closeTime ?? v(),
+				releases: Z(n)
 			};
-			if (r.state !== "open") throw new p(r.state);
-			let a = ut(r, n);
-			if (a.length > 0) throw new t(a);
-			let o = Q(r);
-			return r.state = "published", r.closeTime = y(), Be.set(e, { ...n }), {
-				changeSet: A(r),
-				publishTime: r.closeTime,
-				releases: o
+			if (n.state !== "open") throw new m(n.state);
+			let i = yt(n, t);
+			if (i.length > 0) throw new s(i);
+			let a = Z(n);
+			return n.state = "published", n.closeTime = v(), Ye.set(e, { ...t }), {
+				changeSet: O(n),
+				publishTime: n.closeTime,
+				releases: a
 			};
 		},
 		async changeValidity({ releaseId: e, validityPeriod: n, changeSetName: r, idempotencyKey: i }) {
-			return V(i, [
+			return B(i, [
 				"changeValidity",
 				e,
 				n,
 				r
 			], async () => {
-				let i = E.find((t) => (t.timeline ?? []).some((t) => t.releaseId === e));
-				if (!i) throw k("Release", e);
-				J(i);
+				let i = C.find((t) => (t.timeline ?? []).some((t) => t.releaseId === e));
+				if (!i) throw D("Release", e);
+				q(i);
 				let a = i.timeline ?? [], o = a.find((t) => t.releaseId === e);
-				if (!o?.validityPeriod || !G(i)) throw new _("undated Releases carry no Validity Period");
+				if (!o?.validityPeriod || !W(i)) throw new u("undated Releases carry no Validity Period");
 				let { firstDay: c, lastDay: l = "" } = n;
-				if (!g.test(c) || l !== "" && (!g.test(l) || l < c)) throw new _("validity_period is YYYY-MM-DD, the last day not before the first");
-				let d = M[i.blueprintReleaseId]?.accessor ?? "", f = z.find((e) => e.blueprintAccessor === d);
-				if (je(f).editingMode === "change_sets") throw new s(i.id, d);
+				if (!_.test(c) || l !== "" && (!_.test(l) || l < c)) throw new u("validity_period is YYYY-MM-DD, the last day not before the first");
+				let d = T[i.blueprintReleaseId]?.accessor ?? "", f = L.find((e) => e.blueprintAccessor === d);
+				if (R(f).editingMode === "change_sets") throw new t(i.id, d);
 				let p = a.filter((t) => t.releaseId !== e && t.validityPeriod && c <= t.validityPeriod.firstDay && (l === "" || t.validityPeriod.lastDay !== "" && t.validityPeriod.lastDay <= l)).map((e) => e.releaseId);
-				if (p.length > 0) throw new u(i.id, p, !0);
-				let ee = {
-					id: `rls_stub_${H++}`,
+				if (p.length > 0) throw new se(i.id, p, !0);
+				let m = {
+					id: `rls_stub_${V++}`,
 					contentId: i.id,
 					kind: "date_only",
 					branchId: "",
@@ -1197,57 +1356,69 @@ function M(v = {}) {
 					proposedForReleaseId: "",
 					splitFromReleaseId: "",
 					withheld: !1
-				}, m = {
-					id: `cs_stub_${H++}`,
+				}, h = {
+					id: `cs_stub_${V++}`,
 					name: r?.trim() || `Change of validity of ${i.id}`,
 					state: "open",
-					createdBy: b,
-					createTime: y(),
+					createdBy: y,
+					createTime: v(),
 					chains: [],
 					dependsOnChangeSetIds: [],
 					status: "",
 					assigneeIds: [],
-					plannedReleases: [ee]
-				}, h = ut(m, {});
-				if (h.length > 0) throw new t(h);
-				let te = Q(m);
-				return m.state = "published", m.closeTime = y(), w.unshift(m), Be.set(m.id, {}), i.timeline = a.map((t) => t.releaseId === e ? {
+					plannedReleases: [m]
+				}, g = yt(h, {});
+				if (g.length > 0) throw new s(g);
+				let ee = Z(h);
+				return h.state = "published", h.closeTime = v(), x.unshift(h), Ye.set(h.id, {}), i.timeline = a.map((t) => t.releaseId === e ? {
 					...t,
-					releaseId: ee.id,
+					releaseId: m.id,
 					kind: "date_only",
 					validityPeriod: {
 						firstDay: c,
 						lastDay: l
 					},
-					publishTime: m.closeTime ?? y()
+					publishTime: h.closeTime ?? v()
 				} : t), {
-					changeSet: A(m),
-					publishTime: m.closeTime,
-					releases: te
+					changeSet: O(h),
+					publishTime: h.closeTime,
+					releases: ee
 				};
 			});
 		},
 		async updateFromMain({ id: e, chainId: t, idempotencyKey: n }) {
-			return V(n, [
+			return B(n, [
 				"updateFromMain",
 				e,
 				t
 			], async () => {
-				let n = Z(e);
-				t || F(e);
+				let n = X(e);
+				t || M(e);
 				let r = t ? n.chains.filter((e) => e.id === t) : n.chains;
-				if (t && r.length === 0) throw k("Chain", t);
-				let i = structuredClone(Le[e] ?? []), a = [];
-				for (let e of r) for (let t of e.branches) {
-					let n = {
-						branchId: t.id,
-						contentId: e.contentId
-					}, r = Re[t.id];
-					B.has(t.id) ? a.push(n) : r && (et(t.id, r), i.push(n));
+				if (t && r.length === 0) throw D("Chain", t);
+				let i = structuredClone(Ge[e] ?? []), a = [], o = [];
+				for (let t of r) for (let n of t.branches) {
+					let r = {
+						branchId: n.id,
+						contentId: t.contentId
+					}, s = Ke[n.id];
+					if (z.has(n.id)) a.push(r);
+					else if (s) lt(n.id, s), i.push(r);
+					else if (qe.has(n.id)) {
+						let r = H(t.contentId);
+						st({
+							changeSetId: e,
+							chain: t,
+							branch: n,
+							c: r,
+							data: structuredClone(K(r, n.headRevisionId) ?? {}),
+							cause: "merge"
+						}), qe.delete(n.id), o.push(n.id);
+					}
 				}
 				return {
-					changeSet: A(n),
-					mergedBranchIds: [],
+					changeSet: O(n),
+					mergedBranchIds: o,
 					conflicted: i,
 					pending: a,
 					endedBranchIds: []
@@ -1255,27 +1426,27 @@ function M(v = {}) {
 			});
 		},
 		async discardChangeSet(e) {
-			let t = Z(e);
-			return F(e), t.state = "discarded", t.closeTime = y(), t.chains = [], A(t);
+			let t = X(e);
+			return M(e), t.state = "discarded", t.closeTime = v(), t.chains = [], O(t);
 		},
 		async listCheckResults(e) {
-			return lt(X(e));
-		},
-		async recordCheckResult({ changeSetId: e, requiredCheckId: t, heads: n, outcome: r, note: a }) {
-			let o = Z(e);
-			if (r === "waived" && a.trim() === "") throw new _("a waived result needs a note saying why");
-			if ([...a].length > 2e3) throw new _(`a note is at most ${d} characters`);
-			let s = N.find((e) => e.id === t);
-			if (!s) throw k("Required Check", t);
-			let c = Oe(t);
-			if (P === "guardian" && !c.everyMember && !c.userIds.includes(b)) throw new f(`recording results of Required Check ${t} needs its recorder relation`);
-			let l = ot(o), u = Object.keys(n);
-			if (s.scope === "branch" && u.length !== 1) throw new _("a Branch-scope result names one head");
-			if (s.scope === "change_set" && u.length !== l.length) throw new _("a Change Set-scope result names every head of the Change Set");
-			for (let e of u) {
+			return vt(Y(e));
+		},
+		async recordCheckResult({ changeSetId: e, requiredCheckId: t, heads: n, outcome: r, note: i }) {
+			let a = X(e);
+			if (r === "waived" && i.trim() === "") throw new u("a waived result needs a note saying why");
+			if ([...i].length > 2e3) throw new u(`a note is at most ${te} characters`);
+			let s = A.find((e) => e.id === t);
+			if (!s) throw D("Required Check", t);
+			let c = Pe(t);
+			if (j === "guardian" && !c.everyMember && !c.userIds.includes(y)) throw new d(`recording results of Required Check ${t} needs its recorder relation`);
+			let l = ht(a), f = Object.keys(n);
+			if (s.scope === "branch" && f.length !== 1) throw new u("a Branch-scope result names one head");
+			if (s.scope === "change_set" && f.length !== l.length) throw new u("a Change Set-scope result names every head of the Change Set");
+			for (let e of f) {
 				let t = l.find((t) => t.key === e);
-				if (!t) throw new _(`heads name ${e}, which this Change Set doesn't hold`);
-				if (t.revision !== n[e]) throw new i({
+				if (!t) throw new u(`heads name ${e}, which this Change Set doesn't hold`);
+				if (t.revision !== n[e]) throw new o({
 					contentId: t.contentId,
 					branchId: t.branchless ? "" : t.key,
 					expectedHeadId: n[e],
@@ -1283,99 +1454,106 @@ function M(v = {}) {
 				});
 			}
 			let p = {
-				id: `cr_stub_${H++}`,
+				id: `cr_stub_${V++}`,
 				requiredCheckId: t,
 				heads: { ...n },
 				outcome: r,
-				note: a,
-				recordedBy: b,
-				recordTime: y()
+				note: i,
+				recordedBy: y,
+				recordTime: v()
 			};
-			return Fe.push({
+			return Ue.push({
 				...p,
 				changeSetId: e
 			}), structuredClone(p);
 		},
 		async getEditingSettings() {
-			let e = [...z].sort((e, t) => e.blueprintAccessor < t.blueprintAccessor ? -1 : 1);
+			let e = [...L].sort((e, t) => e.blueprintAccessor < t.blueprintAccessor ? -1 : 1);
 			return {
-				workspace: { ...R },
-				overrides: e.map(Me)
+				workspace: structuredClone(I),
+				overrides: e.map(Le)
 			};
 		},
 		async getEffectiveEditingSettings(e) {
-			let t = z.find((t) => t.blueprintAccessor === e.trim());
+			let t = L.find((t) => t.blueprintAccessor === e.trim());
 			return {
-				effective: je(t),
+				effective: R(t),
 				editingModeOverridden: (t?.editingMode ?? null) !== null,
-				editingBlockOverridden: (t?.editingBlock ?? null) !== null
+				editingBlockOverridden: (t?.editingBlock ?? null) !== null,
+				forceGroupOverridden: (t?.forceGroup ?? null) !== null,
+				callerInForceGroup: ze(R(t).forceGroup)
 			};
 		},
 		async setEditingSettings(e) {
-			if (Pe(), !Ne.includes(e.editingMode)) throw new _("the workspace's editing settings need an Editing Mode");
-			return R = { ...e }, { ...R };
-		},
-		async setBlueprintEditingOverride({ blueprintAccessor: e, editingMode: t, editingBlock: n }) {
-			Pe();
-			let r = O(e, "a Blueprint accessor", 200);
-			if (t === null && n === null) throw new _(`an override of "${r}" sets the Editing Mode, the Editing Block or both`);
-			let i = {
-				blueprintAccessor: r,
+			if (He(), !Ve.includes(e.editingMode)) throw new u("the workspace's editing settings need an Editing Mode");
+			return I = {
+				...e,
+				forceGroup: Be(e.forceGroup)
+			}, structuredClone(I);
+		},
+		async setBlueprintEditingOverride({ blueprintAccessor: e, editingMode: t, editingBlock: n, forceGroup: r }) {
+			He();
+			let i = E(e, "a Blueprint accessor", 200);
+			if (t === null && n === null && r === null) throw new u(`an override of "${i}" sets the Editing Mode, the Editing Block, the Force Group or several`);
+			L.some((e) => e.blueprintAccessor === i) || De(w, [i]);
+			let a = {
+				blueprintAccessor: i,
 				editingMode: t,
-				editingBlock: n
+				editingBlock: n,
+				forceGroup: r === null ? null : Be(r)
 			};
-			return z = [...z.filter((e) => e.blueprintAccessor !== r), i], Me(i);
+			return L = [...L.filter((e) => e.blueprintAccessor !== i), a], Le(a);
 		},
 		async deleteBlueprintEditingOverride({ blueprintAccessor: e }) {
-			Pe();
+			He();
 			let t = e.trim();
-			if (!z.some((e) => e.blueprintAccessor === t)) throw k("an editing override of", t);
-			z = z.filter((e) => e.blueprintAccessor !== t);
+			if (!L.some((e) => e.blueprintAccessor === t)) throw D("an editing override of", t);
+			L = L.filter((e) => e.blueprintAccessor !== t);
 		},
 		async listRequiredChecks() {
 			let e = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id);
-			return structuredClone([...N].sort(e));
+			return structuredClone([...A].sort(e));
 		},
 		async createRequiredCheck(e) {
-			let t = Se(e);
-			if (N.some((e) => e.name === t.name)) throw new n(t.name);
-			let r = {
-				id: `rc_stub_${H++}`,
-				...t
+			let { everyBlueprint: t, ...r } = Ee(e);
+			if (De(w, r.blueprintAccessors), A.some((e) => e.name === r.name)) throw new n(r.name);
+			let i = {
+				id: `rc_stub_${V++}`,
+				...r
 			};
-			return N.push(r), structuredClone(r);
+			return A.push(i), structuredClone(i);
 		},
 		async updateRequiredCheck({ id: e, ...t }) {
-			let r = Se(t), i = N.find((t) => t.id === e);
-			if (!i) throw k("Required Check", e);
-			if (N.some((t) => t.name === r.name && t.id !== e)) throw new n(r.name);
-			return Object.assign(i, r), structuredClone(i);
+			let { everyBlueprint: r, ...i } = Ee(t), a = A.find((t) => t.id === e);
+			if (!a) throw D("Required Check", e);
+			if (De(w, i.blueprintAccessors.filter((e) => !a.blueprintAccessors.includes(e))), A.some((t) => t.name === i.name && t.id !== e)) throw new n(i.name);
+			return Object.assign(a, i), structuredClone(a);
 		},
 		async deleteRequiredCheck({ id: e }) {
-			if (!N.some((t) => t.id === e)) throw k("Required Check", e);
-			N = N.filter((t) => t.id !== e), L.delete(e);
+			if (!A.some((t) => t.id === e)) throw D("Required Check", e);
+			A = A.filter((t) => t.id !== e), P.delete(e);
 		},
 		async listRequiredCheckRecorders(e) {
-			return structuredClone(Xe(e));
+			return structuredClone(at(e));
 		},
 		async grantRequiredCheckRecorder({ requiredCheckId: e, recorder: t }) {
-			let n = Xe(e);
+			let n = at(e);
 			if ("everyMember" in t) {
-				L.set(e, {
+				P.set(e, {
 					...n,
 					everyMember: !0
 				});
 				return;
 			}
-			if (!ke.includes(t.userId)) throw new _(`user ${t.userId} is not a member of the workspace`);
-			L.set(e, {
+			if (!Fe.includes(t.userId)) throw new u(`user ${t.userId} is not a member of the workspace`);
+			P.set(e, {
 				...n,
 				userIds: [.../* @__PURE__ */ new Set([...n.userIds, t.userId])].sort()
 			});
 		},
 		async revokeRequiredCheckRecorder({ requiredCheckId: e, recorder: t }) {
-			let n = Xe(e);
-			L.set(e, "everyMember" in t ? {
+			let n = at(e);
+			P.set(e, "everyMember" in t ? {
 				...n,
 				everyMember: !1
 			} : {
@@ -1383,25 +1561,23 @@ function M(v = {}) {
 				userIds: n.userIds.filter((e) => e !== t.userId)
 			});
 		},
-		async searchBlueprints({ query: e }) {
-			let t = e.trim().toLocaleLowerCase();
+		async searchBlueprints({ query: e, includeWithoutRelease: t = !1 }) {
+			let n = e.trim().toLocaleLowerCase();
 			return {
-				blueprints: _e.filter((e) => !e.archived).filter((e) => e.name.toLocaleLowerCase().includes(t)).filter((e) => D.some((t) => t.blueprintId === e.id)).map((e) => ({
-					id: e.id,
-					name: e.name
-				})),
+				blueprints: w.filter((e) => !e.archived).filter((e) => e.name.toLocaleLowerCase().includes(n) || e.accessor.toLocaleLowerCase().includes(n)).filter((e) => t || be.some((t) => t.blueprintId === e.id)).sort((e, t) => e.accessor < t.accessor ? -1 : 1).map(Oe),
 				nextPageToken: ""
 			};
 		},
 		async getBlueprints(e) {
-			if (e.length > 1e3) throw new _(`at most ${c} Blueprint ids`);
-			return _e.filter((t) => e.includes(t.id)).map((e) => ({
-				id: e.id,
-				name: e.name
-			}));
+			if (e.length > 1e3) throw new u(`at most ${r} Blueprint ids`);
+			return w.filter((t) => e.includes(t.id)).map(Oe);
+		},
+		async getBlueprintsByAccessor(e) {
+			if (e.length > 1e3) throw new u(`at most ${r} Blueprint accessors`);
+			return w.filter((t) => e.includes(t.accessor)).map(Oe);
 		},
 		async listBlueprintReleases(e) {
-			return D.filter((t) => t.blueprintId === e).map((e) => ({
+			return be.filter((t) => t.blueprintId === e).map((e) => ({
 				id: e.id,
 				blueprintId: e.blueprintId,
 				name: e.name ?? e.id,
@@ -1410,94 +1586,94 @@ function M(v = {}) {
 			}));
 		},
 		async listCollections() {
-			return [...T].sort(qe).map((e) => ({ ...e }));
-		},
-		async createCollection({ name: e, parentId: t = "", restricted: r = !1 }) {
-			let i = O(e, "a Collection's name", 200);
-			if (t !== "" && Y(t), r && P === "workspace") throw new m(Te);
-			if (Je(t, i)) throw new n(i);
-			let a = {
-				id: `col_stub_${H++}`,
-				name: i,
-				parentId: t,
-				restricted: r
+			return [...S].sort(nt).map((e) => ({ ...e }));
+		},
+		async createCollection({ name: t, parentId: r = "", restricted: i = !1 }) {
+			let a = E(t, "a Collection's name", 200);
+			if (r !== "" && J(r), i && j === "workspace") throw new e(je);
+			if (rt(r, a)) throw new n(a);
+			let o = {
+				id: `col_stub_${V++}`,
+				name: a,
+				parentId: r,
+				restricted: i
 			};
-			return T.push(a), r && I.set(a.id, [{
-				userId: b,
+			return S.push(o), i && N.set(o.id, [{
+				userId: y,
 				level: "owner"
-			}]), { ...a };
+			}]), { ...o };
 		},
 		async renameCollection({ id: e, name: t }) {
-			let r = O(t, "a Collection's name", 200), i = Y(e);
-			if (Je(i.parentId, r, e)) throw new n(r);
+			let r = E(t, "a Collection's name", 200), i = J(e);
+			if (rt(i.parentId, r, e)) throw new n(r);
 			return i.name = r, { ...i };
 		},
 		async moveCollection({ id: e, parentId: t }) {
-			let r = Y(e);
-			for (let n = t; n !== ""; n = Y(n).parentId) if (n === e) throw new _(`Collection ${e} can't move under itself or a Collection under it`);
-			if (Je(t, r.name, e)) throw new n("");
+			let r = J(e);
+			for (let n = t; n !== ""; n = J(n).parentId) if (n === e) throw new u(`Collection ${e} can't move under itself or a Collection under it`);
+			if (rt(t, r.name, e)) throw new n("");
 			return r.parentId = t, { ...r };
 		},
 		async removeCollection({ id: e }) {
-			if (Y(e), T.some((t) => t.parentId === e)) throw new _(`Collection ${e} has Collections under it: remove or move those first`);
-			T.splice(T.findIndex((t) => t.id === e), 1), I.delete(e);
+			if (J(e), S.some((t) => t.parentId === e)) throw new u(`Collection ${e} has Collections under it: remove or move those first`);
+			S.splice(S.findIndex((t) => t.id === e), 1), N.delete(e);
 			let t = [];
-			for (let n of E) n.collectionIds.includes(e) && (n.collectionIds = n.collectionIds.filter((t) => t !== e), t.push(n.id));
+			for (let n of C) n.collectionIds.includes(e) && (n.collectionIds = n.collectionIds.filter((t) => t !== e), t.push(n.id));
 			return t;
 		},
-		async setCollectionRestricted({ id: e, restricted: t, acknowledgeDisclosure: n = !1 }) {
-			if (t && P === "workspace") throw new m(Te);
-			let r = Y(e);
-			if (r.restricted === t) return { ...r };
-			if (!t && !n) throw new _(`unrestricting Collection ${e} discloses its Content to every viewer: confirm it with acknowledge_disclosure`);
-			return r.restricted = t, t ? I.set(e, [{
-				userId: b,
+		async setCollectionRestricted({ id: t, restricted: n, acknowledgeDisclosure: r = !1 }) {
+			if (n && j === "workspace") throw new e(je);
+			let i = J(t);
+			if (i.restricted === n) return { ...i };
+			if (!n && !r) throw new u(`unrestricting Collection ${t} discloses its Content to every viewer: confirm it with acknowledge_disclosure`);
+			return i.restricted = n, n ? N.set(t, [{
+				userId: y,
 				level: "owner"
-			}]) : I.delete(e), { ...r };
+			}]) : N.delete(t), { ...i };
 		},
 		async listCollectionGrants(e) {
-			return Ye(e), structuredClone(I.get(e) ?? []).sort((e, t) => e.userId < t.userId ? -1 : +(e.userId > t.userId));
+			return it(e), structuredClone(N.get(e) ?? []).sort((e, t) => e.userId < t.userId ? -1 : +(e.userId > t.userId));
 		},
 		async grantCollectionAccess({ collectionId: e, userId: t, level: n }) {
-			if (Ye(e), n !== "viewer" && n !== "editor") throw new _("a grant is viewer or editor");
-			if (!ke.includes(t)) throw new _(`${t} is not a member of the workspace`);
-			let r = I.get(e) ?? [];
-			r.some((e) => e.level === "owner" && e.userId === t) || I.set(e, [...r.filter((e) => e.userId !== t), {
+			if (it(e), n !== "viewer" && n !== "editor") throw new u("a grant is viewer or editor");
+			if (!Fe.includes(t)) throw new u(`${t} is not a member of the workspace`);
+			let r = N.get(e) ?? [];
+			r.some((e) => e.level === "owner" && e.userId === t) || N.set(e, [...r.filter((e) => e.userId !== t), {
 				userId: t,
 				level: n
 			}]);
 		},
 		async revokeCollectionAccess({ collectionId: e, userId: t }) {
-			Ye(e), I.set(e, (I.get(e) ?? []).filter((e) => e.userId !== t || e.level === "owner"));
+			it(e), N.set(e, (N.get(e) ?? []).filter((e) => e.userId !== t || e.level === "owner"));
 		},
 		async listContents(e = {}) {
 			let t = e.view ?? { kind: "main" }, n = (e.search ?? "").trim();
-			if (n !== "" && t.kind === "in_force") throw new _("filter.search: Editor Search covers Main and open Branch heads, never Releases");
-			if ([...n].length > 200) throw new _("filter.search is at most 200 characters");
-			if (e.collectionId && !T.some((t) => t.id === e.collectionId)) throw k("Collection", e.collectionId);
-			t.kind === "change_set" && X(t.changeSetId);
-			let r = E.filter((e) => !e.archiveTime).filter((t) => !e.collectionId || t.collectionIds.includes(e.collectionId)).filter((t) => !e.blueprintIds?.length || e.blueprintIds.includes(t.blueprintId)).filter((t) => !e.assigneeId || (t.assigneeIds ?? []).includes(e.assigneeId)).sort((e, t) => e.id < t.id ? -1 : +(e.id > t.id)).flatMap((e) => ft(e, t, n)), i = Math.min(e.pageSize || 50, 200), a = e.pageToken ? Number(e.pageToken) : 0;
+			if (n !== "" && t.kind === "in_force") throw new u("filter.search: Editor Search covers Main and open Branch heads, never Releases");
+			if ([...n].length > 200) throw new u("filter.search is at most 200 characters");
+			if (e.collectionId && !S.some((t) => t.id === e.collectionId)) throw D("Collection", e.collectionId);
+			t.kind === "change_set" && Y(t.changeSetId);
+			let r = C.filter((e) => !e.archiveTime).filter((t) => !e.collectionId || t.collectionIds.includes(e.collectionId)).filter((t) => !e.blueprintIds?.length || e.blueprintIds.includes(t.blueprintId)).filter((t) => !e.assigneeId || (t.assigneeIds ?? []).includes(e.assigneeId)).sort((e, t) => e.id < t.id ? -1 : +(e.id > t.id)).flatMap((e) => $(e, t, n)), i = Math.min(e.pageSize || 50, 200), a = e.pageToken ? Number(e.pageToken) : 0;
 			return {
 				contents: r.slice(a, a + i),
 				nextPageToken: a + i < r.length ? String(a + i) : ""
 			};
 		},
 		async createContent({ changeSetId: e, blueprintReleaseId: t, copyFrom: n }) {
-			let r = Z(e), i = {}, a = t;
+			let r = X(e), i = {}, a = t;
 			if (n) {
-				let e = "revisionId" in n ? n.revisionId : E.find((e) => e.inForce?.releaseId === n.releaseId)?.inForce?.revisionId, r = E.find((t) => e && q(t, e));
-				if (!r || !e) throw k("copy source", JSON.stringify(n));
-				i = structuredClone(q(r, e) ?? {}), a = t || r.blueprintReleaseId;
+				let e = "revisionId" in n ? n.revisionId : C.find((e) => e.inForce?.releaseId === n.releaseId)?.inForce?.revisionId, r = C.find((t) => e && K(t, e));
+				if (!r || !e) throw D("copy source", JSON.stringify(n));
+				i = structuredClone(K(r, e) ?? {}), a = t || r.blueprintReleaseId;
 			}
-			let o = D.find((e) => e.id === a);
-			if (!o) throw new se(`Blueprint Release ${a} can't be loaded`, [{
+			let o = be.find((e) => e.id === a);
+			if (!o) throw new f(`Blueprint Release ${a} can't be loaded`, [{
 				source: "contenthub",
 				code: "release_not_found",
 				path: ""
 			}]);
-			if (o.refusals?.length) throw new se(`Blueprint Release ${a} can't be loaded`, o.refusals.map((e) => ({ ...e })));
-			let s = H++, c = `content_stub_${s}`, l = `br_stub_${s}`, u = `rev_stub_${s}`;
-			return E.push({
+			if (o.refusals?.length) throw new f(`Blueprint Release ${a} can't be loaded`, o.refusals.map((e) => ({ ...e })));
+			let s = V++, c = `content_stub_${s}`, l = `br_stub_${s}`, u = `rev_stub_${s}`;
+			return C.push({
 				id: c,
 				blueprintId: o.blueprintId,
 				blueprintReleaseId: a,
@@ -1506,7 +1682,7 @@ function M(v = {}) {
 					branchId: l,
 					revisionId: u,
 					data: i,
-					revisionCreateTime: y()
+					revisionCreateTime: v()
 				} }
 			}), r.chains.push({
 				id: `chain_stub_${s}`,
@@ -1526,35 +1702,35 @@ function M(v = {}) {
 				data: structuredClone(i),
 				changeSetId: e,
 				branchId: l,
-				revisionCreateTime: y(),
+				revisionCreateTime: v(),
 				releaseId: ""
 			};
 		},
 		async saveRevision({ idempotencyKey: e, ...t }) {
-			if (!e) return Ze(t);
-			let n = JSON.stringify(t), r = Ve.get(e);
+			if (!e) return ot(t);
+			let n = JSON.stringify(t), r = Xe.get(e);
 			if (r) {
-				if (r.asked !== n) throw new _(`idempotency key ${e} names another save`);
+				if (r.asked !== n) throw new u(`idempotency key ${e} names another save`);
 				return structuredClone(r.content);
 			}
-			let i = await Ze(t);
-			return Ve.set(e, {
+			let i = await ot(t);
+			return Xe.set(e, {
 				asked: n,
 				content: structuredClone(i)
 			}), i;
 		},
 		async getContent({ id: e, changeSetId: t, branchId: n }) {
-			let r = U(e), i = t ? {
+			let r = H(e), i = t ? {
 				kind: "change_set",
 				changeSetId: t
 			} : { kind: "main" };
-			if (n && !t) throw new _("branch_id names a Branch of a Change Set: give its change_set_id too");
-			let [a] = ft(r, i, "");
-			if (!a) throw k("Content", e);
+			if (n && !t) throw new u("branch_id names a Branch of a Change Set: give its change_set_id too");
+			let [a] = $(r, i, "");
+			if (!a) throw D("Content", e);
 			if (n && n !== a.branchId) {
-				let i = w.find((e) => e.id === t)?.chains.find((t) => t.contentId === e)?.branches.find((e) => e.id === n);
-				if (!i) throw k("Branch", n);
-				let o = K(r).find((e) => e.id === i.headRevisionId), s = o?.data ?? (r.main?.revisionId === i.headRevisionId ? r.main.data : {});
+				let i = x.find((e) => e.id === t)?.chains.find((t) => t.contentId === e)?.branches.find((e) => e.id === n);
+				if (!i) throw D("Branch", n);
+				let o = G(r).find((e) => e.id === i.headRevisionId), s = o?.data ?? (r.main?.revisionId === i.headRevisionId ? r.main.data : {});
 				a = {
 					...a,
 					revisionId: i.headRevisionId,
@@ -1563,15 +1739,15 @@ function M(v = {}) {
 					revisionCreateTime: o?.createTime ?? a.revisionCreateTime
 				};
 			}
-			let o = M[r.blueprintReleaseId];
+			let o = T[r.blueprintReleaseId];
 			return {
 				content: a,
 				blueprintRelease: o ? structuredClone(o) : void 0,
-				attributes: W(r)
+				attributes: U(r)
 			};
 		},
 		async getTimeline(e) {
-			let t = U(e), n = (e) => w.find((t) => t.id === e)?.state === "open";
+			let t = H(e), n = (e) => x.find((t) => t.id === e)?.state === "open";
 			return structuredClone({
 				entries: t.timeline ?? [],
 				plannedReleases: (t.plannedReleases ?? []).filter((e) => n(e.changeSetId))
@@ -1580,13 +1756,13 @@ function M(v = {}) {
 		async listRevisions({ target: e, pageSize: t, pageToken: n }) {
 			let r;
 			if ("contentId" in e) {
-				let t = U(e.contentId);
-				if (!t.main) throw k("Content", e.contentId);
-				r = K(t);
+				let t = H(e.contentId);
+				if (!t.main) throw D("Content", e.contentId);
+				r = G(t);
 			} else {
-				let t = E.find((t) => K(t).some((t) => t.branchId === e.branchId));
-				if (!t) throw k("Branch", e.branchId);
-				r = K(t).filter((t) => t.branchId === e.branchId);
+				let t = C.find((t) => G(t).some((t) => t.branchId === e.branchId));
+				if (!t) throw D("Branch", e.branchId);
+				r = G(t).filter((t) => t.branchId === e.branchId);
 			}
 			let i = Math.min(t || 50, 200), a = n ? Number(n) : 0;
 			return {
@@ -1595,17 +1771,17 @@ function M(v = {}) {
 			};
 		},
 		async compare({ revisionId: e, base: t }) {
-			let n = E.find((t) => K(t).some((t) => t.id === e));
-			if (!n) throw k("Revision", e);
-			let r = K(n), i = r.find((t) => t.id === e), a;
+			let n = C.find((t) => G(t).some((t) => t.id === e));
+			if (!n) throw D("Revision", e);
+			let r = G(n), i = r.find((t) => t.id === e), a;
 			if (t.kind === "revision") a = t.revisionId;
 			else if (t.kind === "main_head") {
-				if (!n.main) throw new _("the Content is not published: it has no Main Branch");
+				if (!n.main) throw new u("the Content is not published: it has no Main Branch");
 				a = n.main.revisionId;
 			} else a = r.find((e) => e.branchId === t.branchId)?.parentId ?? "";
 			let o = r.find((e) => e.id === a);
-			if (!o) throw k("Revision", a);
-			let s = q(n, i.id) ?? {}, c = q(n, o.id) ?? {}, l = [];
+			if (!o) throw D("Revision", a);
+			let s = K(n, i.id) ?? {}, c = K(n, o.id) ?? {}, l = [];
 			for (let e of [.../* @__PURE__ */ new Set([...Object.keys(s), ...Object.keys(c)])]) e in c ? e in s ? JSON.stringify(s[e]) !== JSON.stringify(c[e]) && l.push({
 				path: `/${e}`,
 				kind: "changed",
@@ -1620,32 +1796,32 @@ function M(v = {}) {
 				kind: "added",
 				after: s[e]
 			});
-			let u = ({ data: e, ...t }) => t;
+			let d = ({ data: e, ...t }) => t;
 			return {
-				base: u(o),
-				revision: u(i),
+				base: d(o),
+				revision: d(i),
 				changes: l
 			};
 		},
 		async listReferences({ contentId: e, revisionId: t }) {
-			return (U(e).edges ?? []).filter((e) => e.sourceRevisionId === t).map((e) => ({ ...e }));
+			return (H(e).edges ?? []).filter((e) => e.sourceRevisionId === t).map((e) => ({ ...e }));
 		},
 		async listReferrers({ contentId: e, includeOpenChangeSets: t, pageSize: n, pageToken: r }) {
-			U(e);
+			H(e);
 			let i = (e) => {
 				let t = Math.min(n || 100, 1e3), i = r ? Number(r) : 0;
 				return {
 					referrers: e.slice(i, i + t),
 					nextPageToken: i + t < e.length ? String(i + t) : ""
 				};
-			}, a = E.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && t.inForce?.revisionId === n.sourceRevisionId).map((e) => ({
+			}, a = C.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && t.inForce?.revisionId === n.sourceRevisionId).map((e) => ({
 				edge: { ...e },
 				releaseId: t.inForce?.releaseId ?? "",
 				changeSetId: "",
 				branchId: ""
 			})));
 			if (!t) return i(a);
-			let o = E.flatMap((t) => Object.entries(t.branches).flatMap(([n, r]) => w.find((e) => e.id === n)?.state === "open" ? (t.edges ?? []).filter((t) => t.targetContentId === e && t.sourceRevisionId === r.revisionId).map((e) => ({
+			let o = C.flatMap((t) => Object.entries(t.branches).flatMap(([n, r]) => x.find((e) => e.id === n)?.state === "open" ? (t.edges ?? []).filter((t) => t.targetContentId === e && t.sourceRevisionId === r.revisionId).map((e) => ({
 				edge: { ...e },
 				releaseId: "",
 				changeSetId: n,
@@ -1657,14 +1833,14 @@ function M(v = {}) {
 			let t;
 			if ("revisionId" in e) t = e.revisionId;
 			else {
-				for (let n of E) {
+				for (let n of C) {
 					let r = Object.values(n.branches).find((t) => t.branchId === e.branchId);
 					r && (t = r.revisionId);
 				}
-				if (!t) throw k("Branch", e.branchId);
+				if (!t) throw D("Branch", e.branchId);
 			}
-			return E.flatMap((e) => (e.edges ?? []).filter((e) => e.sourceRevisionId === t)).filter((e) => e.pinReleaseId !== "").flatMap((e) => {
-				let t = E.find((t) => t.id === e.targetContentId)?.inForce?.releaseId ?? "";
+			return C.flatMap((e) => (e.edges ?? []).filter((e) => e.sourceRevisionId === t)).filter((e) => e.pinReleaseId !== "").flatMap((e) => {
+				let t = C.find((t) => t.id === e.targetContentId)?.inForce?.releaseId ?? "";
 				return t === e.pinReleaseId ? [] : [{
 					edge: { ...e },
 					supersededByReleaseId: t,
@@ -1673,138 +1849,226 @@ function M(v = {}) {
 			});
 		},
 		async setContentCollections({ contentId: e, collectionIds: t }) {
-			let n = U(e), r = [...new Set(t)];
-			if (r.length > 100) throw new _("at most 100 Collections");
-			for (let e of r) if (!T.some((t) => t.id === e)) throw k("Collection", e);
+			let n = H(e), r = [...new Set(t)];
+			if (r.length > 100) throw new u("at most 100 Collections");
+			for (let e of r) if (!S.some((t) => t.id === e)) throw D("Collection", e);
 			return n.collectionIds = r.sort(), [...n.collectionIds];
 		},
 		async setContentAssignees({ contentId: e, assigneeIds: t }) {
-			let n = U(e);
-			if (new Set(t).size !== t.length) throw new _("each assignee is given once");
-			if (t.length > 50) throw new _("at most 50 assignees");
-			return n.assigneeIds = [...t], W(n);
+			let n = H(e);
+			if (new Set(t).size !== t.length) throw new u("each assignee is given once");
+			if (t.length > 50) throw new u("at most 50 assignees");
+			return n.assigneeIds = [...t], U(n);
 		},
 		async blockContent({ contentId: e, blockReasonId: t, allowedUserIds: n }) {
-			let r = U(e);
-			if (!C.some((e) => e.id === t)) throw k("Block Reason", t);
-			if (new Set(n).size !== n.length) throw new _("each allowed user is given once");
+			let r = H(e);
+			if (!b.some((e) => e.id === t)) throw D("Block Reason", t);
+			if (new Set(n).size !== n.length) throw new u("each allowed user is given once");
 			return r.block = {
 				blockReasonId: t,
 				allowedUserIds: [...n],
-				blockedBy: b,
-				blockTime: y()
-			}, W(r);
+				blockedBy: y,
+				blockTime: v()
+			}, U(r);
 		},
 		async unblockContent(e) {
-			let t = U(e);
-			return t.block = void 0, W(t);
+			let t = H(e);
+			if (!t.block && t.editingBlock) throw new u(`Content ${e} is being edited by ${t.editingBlock.editorId} in a Direct Edit: its Editing Block can't be lifted`);
+			return t.block = void 0, U(t);
 		},
 		async archiveContent(e) {
-			let t = U(e);
-			if (t.archiveTime) return W(t);
-			if (!t.main) throw new _(`Content ${e} is not published: discard its Change Set instead of archiving it`);
-			if (ee(t.timeline ?? [], He())) throw new _(`Content ${e} has a Release In Force today or later: end its force first`);
-			return t.archiveTime = y(), W(t);
+			let t = H(e);
+			if (t.archiveTime) return U(t);
+			if (!t.main) throw new u(`Content ${e} is not published: discard its Change Set instead of archiving it`);
+			if (h(t.timeline ?? [], Ze())) throw new u(`Content ${e} has a Release In Force today or later: end its force first`);
+			return t.archiveTime = v(), U(t);
 		},
 		async unarchiveContent(e) {
-			let t = U(e);
-			return t.archiveTime = void 0, W(t);
-		},
-		async openDirectEdit({ contentId: e, idempotencyKey: t }) {
-			return V(t, ["openDirectEdit", e], async () => {
-				let t = U(e), n = w.find((t) => t.kind === "direct_edit" && t.state === "open" && t.editorId === b && t.chains[0]?.contentId === e);
-				if (n) {
-					let [e] = ft(t, {
+			let t = H(e);
+			return t.archiveTime = void 0, U(t);
+		},
+		async openDirectEdit({ contentId: e, effectiveOn: n, idempotencyKey: r }) {
+			return B(r, [
+				"openDirectEdit",
+				e,
+				n
+			], async () => {
+				let r = H(e), i = x.find((t) => t.kind === "direct_edit" && t.state === "open" && t.editorId === y && t.chains[0]?.contentId === e);
+				if (i) {
+					let [e] = $(r, {
 						kind: "change_set",
-						changeSetId: n.id
+						changeSetId: i.id
 					}, "");
 					return {
-						changeSet: A(n),
+						changeSet: O(i),
 						content: e,
 						reopened: !0
 					};
 				}
-				if (t.main && G(t)) throw new oe("dated_content", `Content ${e} is Dated: change it in a Change Set`, e);
-				let r = M[t.blueprintReleaseId]?.accessor || t.blueprintId, i = je(z.find((e) => e.blueprintAccessor === r)).editingMode;
-				if (t.main && i === "change_sets") throw new s(e, r, i);
-				let a = await $.startEditing({
+				let a = W(r);
+				if (!a && n) throw new u("effective_on is refused for undated Content");
+				let o = Re(r), s = R(L.find((e) => e.blueprintAccessor === o)), c = s.editingMode;
+				if (r.main && c === "change_sets") throw new t(e, o, c);
+				if (r.editingBlock && r.editingBlock.editorId !== y) throw new l("editing_blocked", `Content ${e} is being edited by ${r.editingBlock.editorId} in a Direct Edit`, e, r.editingBlock.editorId);
+				let d = a ? n || Ze() : void 0, f = await Q.startEditing({
 					contentId: e,
-					changeSetName: `Direct Edit of ${e}`
-				}), o = X(a.changeSet.id);
-				return o.kind = "direct_edit", o.editorId = b, {
-					changeSet: A(o),
-					content: a.content,
+					changeSetName: `Direct Edit of ${e}`,
+					effectiveOn: d
+				}), p = Y(f.changeSet.id);
+				p.kind = "direct_edit", p.editorId = y;
+				let m = p.chains[0];
+				if (d && m?.branches[0]) {
+					let e = r.timeline ?? [], t = (e) => !!e.validityPeriod && e.validityPeriod.firstDay <= d && (e.validityPeriod.lastDay === "" || d <= e.validityPeriod.lastDay), n = [...e].reverse().find(t);
+					m.branches[0].effectiveOn = d, m.branches[0].carriedReleaseId = n?.releaseId ?? "";
+					for (let t of e) !t.validityPeriod || t.validityPeriod.firstDay <= d || m.branches.push({
+						id: `br_stub_${V++}`,
+						position: m.branches.length,
+						kind: "carry_forward",
+						headRevisionId: t.revisionId,
+						effectiveOn: t.validityPeriod.firstDay,
+						carriedReleaseId: t.releaseId
+					});
+				}
+				return s.editingBlock && (r.editingBlock = {
+					editorId: y,
+					changeSetId: p.id,
+					blockTime: v()
+				}), {
+					changeSet: O(p),
+					content: f.content,
 					reopened: !1
 				};
 			});
 		},
-		async publishDirectEdit({ id: e, expectedHeadId: t, idempotencyKey: n }) {
-			return V(n, [
+		async previewDirectEditPublish({ id: e, validityLastDay: t }) {
+			let n = Y(e);
+			if (n.kind !== "direct_edit") throw new l("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
+			return structuredClone(xt(n, t));
+		},
+		async publishDirectEdit({ id: e, expectedHeadId: t, releaseSpec: n, validityLastDay: r, carryForward: i, idempotencyKey: a }) {
+			return B(a, [
 				"publishDirectEdit",
 				e,
-				t
+				t,
+				n,
+				r,
+				i
 			], async () => {
-				let n = X(e);
-				if (n.kind !== "direct_edit") throw new oe("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
-				let r = n.chains[0], i = r?.branches[0];
-				if (!r || !i) throw Error(`Direct Edit ${e} has no Branch`);
-				n.state === "open" && !n.plannedReleases.some((e) => e.branchId === i.id) && await $.planRelease({
-					changeSetId: e,
-					branchId: i.id
-				});
-				let a = await $.publish({
-					id: e,
-					reviewedHeads: { [i.id]: t }
-				}), o = U(r.contentId), s = o.branches[e], c = a.releases.find((e) => e.branchId === i.id);
-				if (s && c && o.main?.revisionId !== s.revisionId) {
-					let { branchId: e, ...t } = structuredClone(s);
-					o.main = t, o.inForce = {
-						...structuredClone(t),
-						releaseId: c.id
-					}, o.timeline = [...o.timeline ?? [], {
-						ordinal: (o.timeline?.length ?? 0) + 1,
-						releaseId: c.id,
-						kind: "revision",
-						revisionId: s.revisionId,
-						blueprintReleaseId: o.blueprintReleaseId,
-						publishTime: a.publishTime,
-						first: !1
-					}];
+				let a = Y(e);
+				if (a.kind !== "direct_edit") throw new l("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
+				let o = H(a.chains[0]?.contentId ?? ""), s = {
+					cs: structuredClone(a),
+					c: structuredClone(o)
+				};
+				try {
+					return await St(a, t, n, {
+						validityLastDay: r,
+						carryForward: i
+					});
+				} catch (e) {
+					throw bt(a, s.cs), bt(o, s.c), e;
+				}
+			});
+		},
+		async saveAndPublishDirectEdit({ id: e, expectedHeadId: t, data: n, fieldMask: r, releaseSpec: i, validityLastDay: a, carryForward: o, idempotencyKey: s }) {
+			return B(s, [
+				"saveAndPublishDirectEdit",
+				e,
+				t,
+				n,
+				r,
+				i,
+				a,
+				o
+			], async () => {
+				let s = Y(e);
+				if (s.kind !== "direct_edit") throw new l("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
+				let c = s.chains[0]?.branches[0];
+				if (!c) throw Error(`Direct Edit ${e} has no Branch`);
+				let u = H(s.chains[0]?.contentId ?? ""), d = {
+					cs: structuredClone(s),
+					c: structuredClone(u)
+				};
+				try {
+					let l = await ot({
+						changeSetId: e,
+						branchId: c.id,
+						expectedHeadId: t,
+						data: n,
+						fieldMask: r
+					});
+					return {
+						content: l,
+						outcome: await St(s, l.revisionId, i, {
+							validityLastDay: a,
+							carryForward: o
+						})
+					};
+				} catch (e) {
+					throw bt(s, d.cs), bt(u, d.c), e;
 				}
-				return a;
 			});
 		},
 		async discardDirectEdit({ id: e, idempotencyKey: t }) {
-			return V(t, ["discardDirectEdit", e], async () => {
-				if (X(e).kind !== "direct_edit") throw new oe("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
-				return $.discardChangeSet(e);
+			return B(t, ["discardDirectEdit", e], async () => {
+				if (Y(e).kind !== "direct_edit") throw new l("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
+				let t = await Q.discardChangeSet(e);
+				for (let t of C) t.editingBlock?.changeSetId === e && (t.editingBlock = void 0);
+				return t;
+			});
+		},
+		async forceDirectEdit({ id: e, idempotencyKey: t }) {
+			return B(t, ["forceDirectEdit", e], async () => {
+				let t = Y(e);
+				if (t.kind !== "direct_edit") throw new l("not_a_direct_edit", `Change Set ${e} is not a Direct Edit`);
+				let n = t.chains[0]?.contentId ?? "", r = H(n);
+				if (t.state !== "open" || r.editingBlock?.changeSetId !== e) throw new l("no_editing_block", `Change Set ${e} holds no Editing Block`);
+				let i = R(L.find((e) => e.blueprintAccessor === Re(r))).forceGroup;
+				if (!ze(i)) throw new ne(`forcing the Editing Block of Content ${n} needs the Force Group`);
+				let a = x.find((e) => e.kind === "direct_edit" && e.state === "open" && e.editorId === y && e.chains[0]?.contentId === n);
+				if (a) throw new l("own_direct_edit", `you have a Direct Edit of Content ${n}, ${a.id}`, n);
+				let o = t.editorId ?? "";
+				t.editorId = y, r.editingBlock = {
+					editorId: y,
+					changeSetId: e,
+					blockTime: v()
+				};
+				let [s] = $(r, {
+					kind: "change_set",
+					changeSetId: e
+				}, "");
+				return {
+					changeSet: O(t),
+					content: s,
+					previousEditorId: o
+				};
 			});
 		},
 		async startEditing({ contentId: e, changeSetId: t, effectiveOn: n = "", changeSetName: r = "" }) {
-			let i = U(e);
-			if (!i.main) throw new _(`Content ${e} is not published`);
-			if (J(i), G(i) && !g.test(n)) throw new _("effective_on is required for Dated Content, as YYYY-MM-DD");
-			if (!G(i) && n !== "") throw new _("effective_on is refused for undated Content");
+			let i = H(e);
+			if (!i.main) throw new u(`Content ${e} is not published`);
+			if (q(i), W(i) && !_.test(n)) throw new u("effective_on is required for Dated Content, as YYYY-MM-DD");
+			if (!W(i) && n !== "") throw new u("effective_on is refused for undated Content");
 			let a;
 			if (t) {
-				if (a = Z(t), a.kind === "direct_edit") throw new oe("one_branch", `Change Set ${t} is a Direct Edit`);
-				if (a.chains.some((t) => t.contentId === e)) throw new _(`Content ${e} already has a Chain in this Change Set`);
+				if (a = X(t), a.kind === "direct_edit") throw new l("one_branch", `Change Set ${t} is a Direct Edit`);
+				if (a.chains.some((t) => t.contentId === e)) throw new u(`Content ${e} already has a Chain in this Change Set`);
 			} else {
 				let t = Object.values(i.main.data).filter((e) => typeof e == "string").slice(0, 2).join(" ");
 				a = {
-					id: `cs_stub_${H++}`,
-					name: r.trim() ? O(r, "change_set_name", 200) : t || e,
+					id: `cs_stub_${V++}`,
+					name: r.trim() ? E(r, "change_set_name", 200) : t || e,
 					state: "open",
-					createdBy: b,
-					createTime: y(),
+					createdBy: y,
+					createTime: v(),
 					chains: [],
 					dependsOnChangeSetIds: [],
 					status: "",
 					assigneeIds: [],
 					plannedReleases: []
-				}, w.unshift(a);
+				}, x.unshift(a);
 			}
-			let o = H++, s = `br_stub_${o}`, c = {
+			let o = V++, s = `br_stub_${o}`, c = {
 				...structuredClone(i.main),
 				branchId: s
 			};
@@ -1819,21 +2083,21 @@ function M(v = {}) {
 					headRevisionId: c.revisionId
 				}]
 			});
-			let [l] = ft(i, {
+			let [d] = $(i, {
 				kind: "change_set",
 				changeSetId: a.id
 			}, "");
 			return {
-				changeSet: A(a),
-				content: l
+				changeSet: O(a),
+				content: d
 			};
 		},
 		async previewChain({ changeSetId: e, contentId: t, effectiveOn: n, validityPeriod: r }) {
-			Z(e);
-			let i = U(t);
-			if (!i.main) throw new _(`Content ${t} is not published`);
-			if (!G(i)) throw new _("undated Content's Chain takes no date");
-			if (!g.test(n)) throw new _("effective_on is YYYY-MM-DD");
+			X(e);
+			let i = H(t);
+			if (!i.main) throw new u(`Content ${t} is not published`);
+			if (!W(i)) throw new u("undated Content's Chain takes no date");
+			if (!_.test(n)) throw new u("effective_on is YYYY-MM-DD");
 			let a = i.timeline ?? [], o = a.find((e) => e.validityPeriod && e.validityPeriod.firstDay <= n && (e.validityPeriod.lastDay === "" || n <= e.validityPeriod.lastDay));
 			return {
 				forkReleaseId: o?.releaseId ?? "",
@@ -1844,31 +2108,31 @@ function M(v = {}) {
 			};
 		},
 		async planRepeal({ changeSetId: e, contentId: t, lastDay: n }) {
-			Z(e);
-			let r = U(t);
-			if (J(r), !G(r)) throw new _("a Repeal is for Dated Content");
-			if (!g.test(n)) throw new _("last_day is YYYY-MM-DD");
-			return dt(r, e, {
+			X(e);
+			let r = H(t);
+			if (q(r), !W(r)) throw new u("a Repeal is for Dated Content");
+			if (!_.test(n)) throw new u("last_day is YYYY-MM-DD");
+			return Ct(r, e, {
 				kind: "repeal",
 				validityPeriod: {
-					firstDay: te(r.timeline ?? [], n)?.validityPeriod?.firstDay ?? n,
+					firstDay: ee(r.timeline ?? [], n)?.validityPeriod?.firstDay ?? n,
 					lastDay: n
 				}
 			});
 		},
 		async planWithdrawal({ changeSetId: e, contentId: t }) {
-			Z(e);
-			let n = U(t);
-			if (J(n), G(n)) throw new _("a Withdrawal is for undated Content");
-			return dt(n, e, { kind: "withdrawal" });
+			X(e);
+			let n = H(t);
+			if (q(n), W(n)) throw new u("a Withdrawal is for undated Content");
+			return Ct(n, e, { kind: "withdrawal" });
 		},
 		async planRelease({ idempotencyKey: e, ...t }) {
-			return V(e, ["planRelease", t], async () => {
-				let { changeSetId: e, branchId: n, validityPeriod: r, releaseSpec: i, supersedesReleaseIds: a } = t, { cs: o, chain: s, branch: c, c: l } = $e(e, n);
-				if (J(l), c.kind !== "editorial") throw new _("only an editorial Branch's head is released");
-				if (o.plannedReleases.some((e) => e.branchId === n)) throw new _(`Branch ${n} is planned already`);
-				let u = {
-					id: `rls_stub_${H++}`,
+			return B(e, ["planRelease", t], async () => {
+				let { changeSetId: e, branchId: n, validityPeriod: r, releaseSpec: i, supersedesReleaseIds: a } = t, { cs: o, chain: s, branch: c, c: l } = ct(e, n);
+				if (q(l), c.kind !== "editorial") throw new u("only an editorial Branch's head is released");
+				if (o.plannedReleases.some((e) => e.branchId === n)) throw new u(`Branch ${n} is planned already`);
+				let d = {
+					id: `rls_stub_${V++}`,
 					contentId: s.contentId,
 					kind: "revision",
 					branchId: n,
@@ -1881,35 +2145,35 @@ function M(v = {}) {
 					splitFromReleaseId: "",
 					withheld: !1
 				};
-				return nt(l, u), o.plannedReleases.push(u), rt(o, l), structuredClone(u);
+				return dt(l, d), o.plannedReleases.push(d), ft(o, l), structuredClone(d);
 			});
 		},
 		async updatePlannedRelease({ idempotencyKey: e, ...t }) {
-			return V(e, ["updatePlannedRelease", t], async () => {
-				let { changeSetId: e, plannedReleaseId: n, validityPeriod: r, releaseSpec: i, supersedesReleaseIds: a } = t, o = Z(e), s = o.plannedReleases.findIndex((e) => e.id === n);
-				if (s < 0) throw k("Planned Release", n);
+			return B(e, ["updatePlannedRelease", t], async () => {
+				let { changeSetId: e, plannedReleaseId: n, validityPeriod: r, releaseSpec: i, supersedesReleaseIds: a } = t, o = X(e), s = o.plannedReleases.findIndex((e) => e.id === n);
+				if (s < 0) throw D("Planned Release", n);
 				let c = o.plannedReleases[s];
-				if (c.proposed) throw new _("a proposal is derived from the plans and can't be set");
-				let l = U(c.contentId);
-				J(l);
-				let u = {
+				if (c.proposed) throw new u("a proposal is derived from the plans and can't be set");
+				let l = H(c.contentId);
+				q(l);
+				let d = {
 					...structuredClone(c),
 					...r ? { validityPeriod: { ...r } } : {},
 					...i ? { releaseSpec: structuredClone(i) } : {},
 					...a ? { supersedesReleaseIds: [...a] } : {}
 				};
-				return nt(l, u), o.plannedReleases[s] = u, rt(o, l), structuredClone(u);
+				return dt(l, d), o.plannedReleases[s] = d, ft(o, l), structuredClone(d);
 			});
 		},
 		async appendBranch({ idempotencyKey: e, ...t }) {
-			return V(e, ["appendBranch", t], async () => {
-				let { changeSetId: e, chainId: n, effectiveOn: r } = t, i = Z(e), a = i.chains.find((e) => e.id === n);
-				if (!a) throw k("Chain", n);
-				let o = U(a.contentId);
-				if (a.born || !G(o)) throw new _("only a Chain on published Dated Content takes dates");
+			return B(e, ["appendBranch", t], async () => {
+				let { changeSetId: e, chainId: n, effectiveOn: r } = t, i = X(e), a = i.chains.find((e) => e.id === n);
+				if (!a) throw D("Chain", n);
+				let o = H(a.contentId);
+				if (a.born || !W(o)) throw new u("only a Chain on published Dated Content takes dates");
 				let s = a.branches.filter((e) => e.kind === "editorial").at(-1);
-				if (!g.test(r) || s?.effectiveOn && r <= s.effectiveOn) throw new _("effective_on is a day after the Chain's last editorial Branch's");
-				let c = a.branches.at(-1), l = `br_stub_${H++}`;
+				if (!_.test(r) || s?.effectiveOn && r <= s.effectiveOn) throw new u("effective_on is a day after the Chain's last editorial Branch's");
+				let c = a.branches.at(-1), l = `br_stub_${V++}`;
 				a.branches.push({
 					id: l,
 					position: a.branches.length,
@@ -1917,66 +2181,66 @@ function M(v = {}) {
 					headRevisionId: c?.headRevisionId ?? "",
 					effectiveOn: r
 				});
-				let u = o.branches[e];
-				return u && (o.branches[e] = {
-					...u,
+				let d = o.branches[e];
+				return d && (o.branches[e] = {
+					...d,
 					branchId: l
 				}), {
-					changeSet: A(i),
+					changeSet: O(i),
 					branchId: l
 				};
 			});
 		},
 		async dropChain({ idempotencyKey: e, ...t }) {
-			return V(e, ["dropChain", t], async () => {
-				let { changeSetId: e, chainId: n } = t, r = Z(e), i = r.chains.find((e) => e.id === n);
-				if (!i) throw k("Chain", n);
-				if (i.born) throw new _("the Chain of Content born in the Change Set can't be dropped: discard the Change Set");
-				for (let e of i.branches) tt(e.id);
-				return r.chains = r.chains.filter((e) => e.id !== n), r.plannedReleases = r.plannedReleases.filter((e) => e.contentId !== i.contentId), delete U(i.contentId).branches[e], A(r);
+			return B(e, ["dropChain", t], async () => {
+				let { changeSetId: e, chainId: n } = t, r = X(e), i = r.chains.find((e) => e.id === n);
+				if (!i) throw D("Chain", n);
+				if (i.born) throw new u("the Chain of Content born in the Change Set can't be dropped: discard the Change Set");
+				for (let e of i.branches) ut(e.id);
+				return r.chains = r.chains.filter((e) => e.id !== n), r.plannedReleases = r.plannedReleases.filter((e) => e.contentId !== i.contentId), delete H(i.contentId).branches[e], O(r);
 			});
 		},
 		async getPendingMerge(e) {
-			let t = B.get(e);
+			let t = z.get(e);
 			return t ? structuredClone(t) : null;
 		},
 		async resolveMerge({ idempotencyKey: e, ...t }) {
-			return V(e, ["resolveMerge", t], async () => {
-				let { changeSetId: e, branchId: n, expectedHeadId: r, resolutions: a } = t, { chain: o, branch: s, c } = $e(e, n), l = B.get(n);
-				if (!l) throw new _(`Branch ${n} has no Pending Merge`);
-				if (s.headRevisionId !== r) throw new i({
+			return B(e, ["resolveMerge", t], async () => {
+				let { changeSetId: e, branchId: n, expectedHeadId: r, resolutions: i } = t, { chain: a, branch: s, c } = ct(e, n), l = z.get(n);
+				if (!l) throw new u(`Branch ${n} has no Pending Merge`);
+				if (s.headRevisionId !== r) throw new o({
 					contentId: c.id,
 					branchId: n,
 					expectedHeadId: r,
 					currentHeadId: s.headRevisionId
 				});
-				let u = a.map((e) => e.path), d = l.fields.map((e) => e.path);
-				if (new Set(u).size !== u.length || u.some((e) => !d.includes(e)) || d.some((e) => !u.includes(e))) throw new _("decide every field the Pending Merge lists, once");
-				let f = structuredClone(l.merged);
-				for (let e of a) {
+				let d = i.map((e) => e.path), f = l.fields.map((e) => e.path);
+				if (new Set(d).size !== d.length || d.some((e) => !f.includes(e)) || f.some((e) => !d.includes(e))) throw new u("decide every field the Pending Merge lists, once");
+				let p = structuredClone(l.merged);
+				for (let e of i) {
 					let t = l.fields.find((t) => t.path === e.path), n = "side" in e ? e.side === "ours" ? t.ours : t.theirs : e.value, r = e.path.replace(/^\//, "");
-					n === void 0 ? delete f[r] : f[r] = structuredClone(n);
+					n === void 0 ? delete p[r] : p[r] = structuredClone(n);
 				}
-				let p = Qe({
+				let m = st({
 					changeSetId: e,
-					chain: o,
+					chain: a,
 					branch: s,
 					c,
-					data: f,
+					data: p,
 					cause: "resolve",
 					secondParentId: l.theirsRevisionId
 				});
-				return tt(n), p;
+				return ut(n), qe.delete(n), m;
 			});
 		},
 		async abortMerge({ idempotencyKey: e, ...t }) {
-			return V(e, ["abortMerge", t], async () => {
-				if ($e(t.changeSetId, t.branchId), !B.has(t.branchId)) throw new _(`Branch ${t.branchId} has no Pending Merge`);
-				tt(t.branchId);
+			return B(e, ["abortMerge", t], async () => {
+				if (ct(t.changeSetId, t.branchId), !z.has(t.branchId)) throw new u(`Branch ${t.branchId} has no Pending Merge`);
+				ut(t.branchId);
 			});
 		},
 		async previewInForce({ contentId: e, changeSetId: t, validOn: n }) {
-			let r = Z(t), i = U(e), a = n || He(), o = r.chains.find((t) => t.contentId === e), s = (e) => !e.validityPeriod || e.validityPeriod.firstDay <= a && (e.validityPeriod.lastDay === "" || a <= e.validityPeriod.lastDay), c = r.plannedReleases.find((t) => t.contentId === e && t.kind !== "repeal" && s(t));
+			let r = X(t), i = H(e), a = n || Ze(), o = r.chains.find((t) => t.contentId === e), s = (e) => !e.validityPeriod || e.validityPeriod.firstDay <= a && (e.validityPeriod.lastDay === "" || a <= e.validityPeriod.lastDay), c = r.plannedReleases.find((t) => t.contentId === e && t.kind !== "repeal" && s(t));
 			if (c) {
 				let e = c.branchId ? o?.branches.find((e) => e.id === c.branchId)?.headRevisionId ?? "" : c.revisionId;
 				return {
@@ -1985,24 +2249,24 @@ function M(v = {}) {
 					planned: !0,
 					withheld: !1,
 					validityPeriod: c.validityPeriod ? { ...c.validityPeriod } : void 0,
-					data: structuredClone(q(i, e) ?? {})
+					data: structuredClone(K(i, e) ?? {})
 				};
 			}
-			let l = te(i.timeline ?? [], a);
+			let l = ee(i.timeline ?? [], a);
 			return l ? {
 				releaseId: l.releaseId,
 				revisionId: l.revisionId,
 				planned: !1,
 				withheld: !1,
 				validityPeriod: l.validityPeriod ? { ...l.validityPeriod } : void 0,
-				data: structuredClone(q(i, l.revisionId) ?? {})
+				data: structuredClone(K(i, l.revisionId) ?? {})
 			} : null;
 		}
 	};
-	return $;
-	function dt(e, t, n) {
+	return Q;
+	function Ct(e, t, n) {
 		let r = {
-			id: `rls_stub_${H++}`,
+			id: `rls_stub_${V++}`,
 			contentId: e.id,
 			branchId: "",
 			revisionId: e.inForce?.revisionId ?? e.main?.revisionId ?? "",
@@ -2018,10 +2282,10 @@ function M(v = {}) {
 			plannedRelease: r
 		}], structuredClone({
 			plannedRelease: r,
-			gapReferrers: We(e.id)
+			gapReferrers: $e(e.id)
 		});
 	}
-	function ft(e, t, n) {
+	function $(e, t, n) {
 		let r = (t, n) => ({
 			id: e.id,
 			blueprintId: e.blueprintId,
@@ -2036,33 +2300,33 @@ function M(v = {}) {
 		if (t.kind === "in_force") return e.inForce ? [r(e.inForce, { releaseId: e.inForce.releaseId })] : [];
 		if (t.kind === "change_set") {
 			let i = e.branches[t.changeSetId];
-			return !i || n && !Ee(i.data, n) ? [] : [r(i, {
+			return !i || n && !Me(i.data, n) ? [] : [r(i, {
 				changeSetId: t.changeSetId,
 				branchId: i.branchId
 			})];
 		}
 		if (!n) return e.main ? [r(e.main, {})] : [];
 		let i = [];
-		e.main && Ee(e.main.data, n) && i.push(r(e.main, {}));
-		for (let [t, a] of Object.entries(e.branches).sort(([, e], [, t]) => e.branchId < t.branchId ? -1 : 1)) w.find((e) => e.id === t)?.state === "open" && Ee(a.data, n) && i.push(r(a, {
+		e.main && Me(e.main.data, n) && i.push(r(e.main, {}));
+		for (let [t, a] of Object.entries(e.branches).sort(([, e], [, t]) => e.branchId < t.branchId ? -1 : 1)) x.find((e) => e.id === t)?.state === "open" && Me(a.data, n) && i.push(r(a, {
 			changeSetId: t,
 			branchId: a.branchId
 		}));
 		return i;
 	}
 }
-function Ee(e, t) {
+function Me(e, t) {
 	let n = (e) => e.toLocaleLowerCase().replace(/\s+/g, " "), r = n(t);
 	return Object.values(e).some((e) => typeof e == "string" && n(e).includes(r));
 }
 //#endregion
 //#region src/testing/stub-status-source.ts
-function N(e = le()) {
+function j(e = fe()) {
 	return { async listChangeSetStatuses() {
 		return e.map((e) => ({ ...e }));
 	} };
 }
 //#endregion
-export { w as STUB_NOW, C as STUB_OTHER_USER_ID, S as STUB_USER_ID, x as STUB_WORKSPACE_ID, D as createStubBlueprintSource, M as createStubContenthubClient, N as createStubStatusSource, ce as stubBlockReasons, j as stubBlocker, he as stubBlueprintReleases, me as stubBlueprints, le as stubChangeSetStatuses, de as stubChangeSets, pe as stubCollections, ve as stubContents, T as stubIdentity, _e as stubRepealedContent, fe as stubRequiredChecks, ge as stubResolvedReleases, ue as stubStatusTransitions, E as stubUndatedContent };
+export { S as STUB_NOW, x as STUB_OTHER_USER_ID, b as STUB_USER_ID, ue as STUB_WORKSPACE_ID, T as createStubBlueprintSource, A as createStubContenthubClient, j as createStubStatusSource, de as stubBlockReasons, k as stubBlocker, ve as stubBlueprintReleases, _e as stubBlueprints, fe as stubChangeSetStatuses, me as stubChangeSets, ge as stubCollections, xe as stubContents, C as stubIdentity, be as stubRepealedContent, he as stubRequiredChecks, ye as stubResolvedReleases, pe as stubStatusTransitions, w as stubUndatedContent };
 
 //# sourceMappingURL=testing.js.map