@knkcs/contenthub-ui 0.3.1 → 0.4.0

package/dist/testing.js

@@ -1,4 +1,4 @@
-import { A as e, C as t, D as n, M as r, N as i, S as a, T as o, _ as s, b as c, f as l, g as u, h as d, i as f, j as p, n as m, o as ee, r as h, s as te, t as ne, u as re, v as ie, w as g, x as ae, y as _ } from "./heads-dBmqNcOB.js";
+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 { Code as v, ConnectError as y } from "@connectrpc/connect";
 import { createHostMembers as b } from "@knkcs/anker/host";
 //#region src/testing/fixtures.ts
@@ -18,7 +18,7 @@ function T() {
 		}])
 	};
 }
-function oe() {
+function ce() {
 	return [{
 		id: "br_author",
 		name: "Being revised by the author",
@@ -31,7 +31,7 @@ function oe() {
 		updateTime: w
 	}];
 }
-function E() {
+function le() {
 	return [
 		{
 			slug: "in_progress",
@@ -56,7 +56,7 @@ function E() {
 		}
 	];
 }
-function se() {
+function ue() {
 	return {
 		in_progress: ["in_review", "on_hold"],
 		in_review: [
@@ -68,7 +68,7 @@ function se() {
 		on_hold: ["in_progress"]
 	};
 }
-function ce() {
+function de() {
 	return [
 		{
 			id: "cs_bgbl_270",
@@ -194,7 +194,7 @@ function ce() {
 		}
 	];
 }
-function le() {
+function fe() {
 	return [{
 		id: "rc_print",
 		name: "Druckprobe",
@@ -209,7 +209,7 @@ function le() {
 		independent: !0
 	}];
 }
-function ue() {
+function pe() {
 	return [
 		{
 			id: "col_bgb",
@@ -237,7 +237,7 @@ function ue() {
 		}
 	];
 }
-function de() {
+function me() {
 	return [
 		{
 			id: "bp_commentary",
@@ -253,7 +253,7 @@ function de() {
 		}
 	];
 }
-function fe() {
+function he() {
 	return [
 		{
 			id: "bpr_paragraph_2",
@@ -275,7 +275,7 @@ function fe() {
 		}
 	];
 }
-function pe() {
+function ge() {
 	let e = (e, t) => ({
 		field_type: "text",
 		config: {
@@ -287,6 +287,7 @@ function pe() {
 		system: !1
 	}), t = {
 		displayName: "Paragraph",
+		accessor: "paragraph",
 		dated: !0,
 		fields: [e("number", "Number"), e("heading", "Heading")],
 		parts: {}
@@ -296,13 +297,51 @@ function pe() {
 		bpr_paragraph_2: t,
 		bpr_footnote_1: {
 			displayName: "Footnote",
+			accessor: "footnote",
 			dated: !0,
 			fields: [e("text", "Text")],
 			parts: {}
+		},
+		bpr_note_1: {
+			displayName: "Note",
+			accessor: "note",
+			dated: !1,
+			fields: [e("title", "Title")],
+			parts: {}
 		}
 	};
 }
-function D() {
+function E() {
+	let e = "2026-09-01T08:00:00.000Z";
+	return {
+		id: "content_note_1",
+		blueprintId: "bp_note",
+		blueprintReleaseId: "bpr_note_1",
+		collectionIds: [],
+		main: {
+			revisionId: "rev_note1_main",
+			data: { title: "Hinweis" },
+			revisionCreateTime: e
+		},
+		inForce: {
+			revisionId: "rev_note1_main",
+			data: { title: "Hinweis" },
+			revisionCreateTime: e,
+			releaseId: "rls_note1_1"
+		},
+		branches: {},
+		timeline: [{
+			ordinal: 1,
+			releaseId: "rls_note1_1",
+			kind: "revision",
+			revisionId: "rev_note1_main",
+			blueprintReleaseId: "bpr_note_1",
+			publishTime: e,
+			first: !0
+		}]
+	};
+}
+function _e() {
 	let e = "2001-11-01T08:00:00.000Z";
 	return {
 		id: "content_para_3",
@@ -333,7 +372,7 @@ function D() {
 		}]
 	};
 }
-function me() {
+function ve() {
 	let e = "2026-09-01T08:00:00.000Z";
 	return [
 		{
@@ -586,7 +625,7 @@ function me() {
 }
 //#endregion
 //#region src/testing/stub-blueprint-source.ts
-function he(e = de(), t = fe()) {
+function D(e = me(), t = he()) {
 	return {
 		async searchBlueprints({ query: t }) {
 			let n = t.trim().toLocaleLowerCase();
@@ -605,37 +644,37 @@ function he(e = de(), t = fe()) {
 }
 //#endregion
 //#region src/testing/stub-client.ts
-function ge(e, t) {
+function ye(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) {
 	let r = e.trim();
-	if (r === "") throw new a(`${t} is required`);
-	if ([...r].length > n) throw new a(`${t} is at most ${n} characters`);
-	if (/[\u0000-\u001f\u007f]/.test(r)) throw new a(`${t} is one line of text`);
+	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`);
 	return r;
 }
-function _e(e) {
-	if (!/^\d{4}-\d{2}-\d{2}$/.test(e.date.trim())) throw new a(`source.date "${e.date}" is not a day as YYYY-MM-DD`);
+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`);
 	return {
 		date: e.date.trim(),
 		reference: O(e.reference, "source.reference", 500)
 	};
 }
-function ve(e) {
+function xe(e) {
 	let t = e.trim();
-	if (t === "") throw new a("a Block Reason needs a name");
-	if ([...t].length > 200) throw new a("a Block Reason's name is at most 200 characters");
-	if (/[\u0000-\u001f\u007f]/.test(t)) throw new a("a Block Reason's name is one line of text");
+	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");
 	return t;
 }
-function ye(e) {
+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("a Required Check's scope is Branch or Change Set");
+	if (e.scope !== "branch" && e.scope !== "change_set") throw new _("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 a(`"${t}" is not a Blueprint accessor`);
+		if (t === "" || [...t].length > 200 || /[\u0000-\u001f\u007f]/.test(t)) throw new _(`"${t}" is not a Blueprint accessor`);
 		return t;
 	});
 	return {
@@ -645,7 +684,7 @@ function ye(e) {
 		independent: e.independent
 	};
 }
-var be = "who records a Required Check can be narrowed only in authz.mode guardian: in workspace mode every member records every check (ADR 0017)", xe = "this Change Set holds work you can't see: publishing, discarding or updating all of it needs you to see every Content in it", Se = "Restricted Collections need authz.mode guardian: in workspace mode a restriction could not be enforced (ADR 0017)";
+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) {
 	return new y(`${e} ${t}: not found`, v.NotFound);
 }
@@ -671,25 +710,40 @@ function j(e, t = {}) {
 	};
 }
 function M(v = {}) {
-	let y = v.now ?? (() => "2026-10-01T09:00:00.000Z"), b = v.userId ?? "user_stub", x = v.statuses ?? E(), S = v.statusTransitions ?? se(), C = (v.blockReasons ?? oe()).map((e) => ({ ...e })), w = (v.changeSets ?? ce()).map(A), T = (v.collections ?? ue()).map((e) => ({ ...e })), D = structuredClone(v.contents ?? me()), he = v.blueprints ?? de(), M = v.blueprintReleases ?? fe(), P = v.resolvedReleases ?? pe(), F = structuredClone(v.requiredChecks ?? le()), I = v.authzMode ?? "guardian", Ce = new Set(v.withheld ?? []), L = (e) => {
-		if (Ce.has(e)) throw new i(xe);
-	}, R = new Map(Object.entries(structuredClone(v.collectionGrants ?? {}))), z = new Map(Object.entries(structuredClone(v.recorders ?? {}))), we = (e) => z.get(e) ?? {
+	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) ?? {
 		everyMember: !0,
 		userIds: []
-	}, Te = v.memberIds ?? ["user_stub", "user_ben"], Ee = v.admin ?? !0, De = structuredClone(v.checkResults ?? []), Oe = v.publishBlockers ?? {}, ke = v.pendingMerges ?? {}, Ae = structuredClone(v.conflicts ?? {}), B = /* @__PURE__ */ new Map(), je = /* @__PURE__ */ new Map(), V = async (e, t, n) => {
+	}, ke = v.memberIds ?? ["user_stub", "user_ben"], Ae = v.admin ?? !0, R = structuredClone(v.editingSettings ?? {
+		editingMode: "change_sets",
+		editingBlock: !1
+	}), z = structuredClone(v.editingOverrides ?? []), je = (e) => ({
+		editingMode: e?.editingMode ?? R.editingMode,
+		editingBlock: e?.editingBlock ?? R.editingBlock
+	}), Me = (e) => ({
+		...structuredClone(e),
+		effective: je(e)
+	}), Ne = [
+		"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) => {
 		if (!e) return n();
-		let r = JSON.stringify(t), i = je.get(e);
+		let r = JSON.stringify(t), i = ze.get(e);
 		if (i) {
-			if (i.asked !== r) throw new a(`idempotency key ${e} names another request`);
+			if (i.asked !== r) throw new _(`idempotency key ${e} names another request`);
 			return structuredClone(i.answer);
 		}
-		let o = await n();
-		return je.set(e, {
+		let a = await n();
+		return ze.set(e, {
 			asked: r,
-			answer: structuredClone(o)
-		}), o;
-	}, Me = /* @__PURE__ */ new Map(), Ne = /* @__PURE__ */ new Map(), H = 1, U = (e) => {
-		let t = D.find((t) => t.id === e);
+			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);
 		return t;
 	}, W = (e) => structuredClone({
@@ -697,7 +751,7 @@ function M(v = {}) {
 		assigneeIds: e.assigneeIds ?? [],
 		block: e.block,
 		archiveTime: e.archiveTime
-	}), Pe = () => y().slice(0, 10), G = (e) => P[e.blueprintReleaseId]?.dated ?? !1, K = (e) => {
+	}), He = () => y().slice(0, 10), G = (e) => M[e.blueprintReleaseId]?.dated ?? !1, K = (e) => {
 		let t = [...e.revisions ?? []], n = [...Object.entries(e.branches).map(([e, t]) => ({
 			...t,
 			changeSetId: e
@@ -724,58 +778,58 @@ function M(v = {}) {
 		e.main,
 		e.inForce,
 		...Object.values(e.branches)
-	].find((e) => e?.revisionId === t)?.data ?? e.revisions?.find((e) => e.id === t)?.data, Fe = (e, t) => {
+	].find((e) => e?.revisionId === t)?.data ?? e.revisions?.find((e) => e.id === t)?.data, Ue = (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 s(e.id);
-		if (e.block && !e.block.allowedUserIds.includes(b)) throw new ie(e.id, e.block.blockReasonId);
-	}, Ie = (e) => D.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && n.pinReleaseId === "" && t.inForce?.revisionId === n.sourceRevisionId).map((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) => ({
 		edge: { ...e },
 		releaseId: t.inForce?.releaseId ?? ""
-	}))), Le = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), Re = (e, t) => C.some((n) => n.name === e && n.id !== t), ze = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), Y = (e) => {
+	}))), 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);
 		return t;
-	}, Be = (e, t, n) => T.some((r) => r.parentId === e && r.name === t && r.id !== n), Ve = (e) => {
-		if (I === "workspace") throw new n(Se);
-		if (!Y(e).restricted) throw new a(`Collection ${e} is open: only a Restricted Collection takes grants`);
-		let t = (R.get(e) ?? []).some((e) => e.userId === b && e.level === "owner");
-		if (!Ee && !t) throw new te("only its owner or a workspace admin manages its grants");
-	}, He = (e) => {
-		if (I === "workspace") throw new ae("required_check_recorders", be);
-		if (!Ee) throw new te("permission denied");
-		if (e === "") throw new a("required_check_id is required");
-		if (!F.some((t) => t.id === e)) throw k("Required Check", e);
-		return we(e);
-	}, Ue = async ({ changeSetId: t, branchId: n, expectedHeadId: r, data: i, fieldMask: o }) => {
-		let s = Z(t).chains.find((e) => e.branches.some((e) => e.id === n)), c = s?.branches.find((e) => e.id === n);
-		if (!s || !c) throw k("Branch", n);
-		let l = U(s.contentId);
-		if (J(l), B.has(n)) throw new a("a Pending Merge waits on this Branch: resolve or abort it first");
-		if (r === "") throw new a("expected_head_id is required");
-		if (c.headRevisionId !== r) throw new e({
-			contentId: l.id,
-			branchId: n,
-			expectedHeadId: r,
-			currentHeadId: c.headRevisionId
+	}, 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({
+			contentId: c.id,
+			branchId: t,
+			expectedHeadId: n,
+			currentHeadId: s.headRevisionId
 		});
-		let u = q(l, c.headRevisionId) ?? {}, d = JSON.parse(JSON.stringify(i)), f;
-		if (o) {
-			let e = Object.keys(d).filter((e) => !o.includes(e));
-			if (e.length > 0) throw new a(`data holds ${e.join(", ")}, which the mask doesn't name`);
-			f = structuredClone(u);
-			for (let e of o) e in d ? f[e] = d[e] : delete f[e];
-		} else f = d;
-		return We({
-			changeSetId: t,
-			chain: s,
-			branch: c,
-			c: l,
-			data: f,
+		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({
+			changeSetId: e,
+			chain: o,
+			branch: s,
+			c,
+			data: d,
 			cause: "save"
 		});
-	}, We = ({ changeSetId: e, chain: t, branch: n, c: r, data: i, cause: a, secondParentId: o = "" }) => {
+	}, 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();
 		return r.revisions = [{
 			id: c,
@@ -805,7 +859,7 @@ function M(v = {}) {
 			revisionCreateTime: l,
 			releaseId: ""
 		};
-	}, Ge = (e, t) => {
+	}, $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);
 		return {
@@ -814,7 +868,7 @@ function M(v = {}) {
 			branch: i,
 			c: U(r.contentId)
 		};
-	}, Ke = (e, t) => {
+	}, et = (e, t) => {
 		for (let n of w) for (let r of n.chains) {
 			let n = r.branches.find((t) => t.id === e);
 			if (!n) continue;
@@ -828,33 +882,33 @@ function M(v = {}) {
 				fields: structuredClone(t.fields),
 				merged: structuredClone(t.merged)
 			};
-			B.set(e, i), n.hasPendingMerge = !0, delete Ae[e];
+			B.set(e, i), n.hasPendingMerge = !0, delete Re[e];
 			return;
 		}
 		throw k("Branch", e);
-	}, qe = (e) => {
+	}, tt = (e) => {
 		B.delete(e);
 		for (let t of w) for (let n of t.chains) {
 			let t = n.branches.find((t) => t.id === e);
 			t && (t.hasPendingMerge = !1);
 		}
-	}, Je = (e, t) => {
+	}, nt = (e, t) => {
 		let n = t.validityPeriod;
 		if (G(e)) {
-			if (!n || !h.test(n.firstDay)) throw new a("validity_period.first_day is required for Dated Content");
-			if (n.lastDay !== "" && (!h.test(n.lastDay) || n.lastDay < n.firstDay)) throw new a("validity_period.last_day is a day on or after first_day");
-		} else if (n) throw new a("validity_period is refused for undated Content");
-		let r = Fe(P[e.blueprintReleaseId]?.releaseSpec, t.releaseSpec ?? {}).map((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) => ({
 			source: "fieldkit",
 			code: "required",
 			path: `/${e}`
 		}));
-		if (r.length > 0) throw new _("the Release Spec values break the Blueprint Release", r);
+		if (r.length > 0) throw new se("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 c(e.id, r);
+			if (r.length > 0) throw new u(e.id, r);
 		}
-	}, Ye = (e, t) => {
+	}, rt = (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({
@@ -877,9 +931,9 @@ 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: ge(n.firstDay, -1)
+					lastDay: ye(n.firstDay, -1)
 				}, ""), n.lastDay !== "" && (t.lastDay === "" || t.lastDay > n.lastDay) && a(r, {
-					firstDay: ge(n.lastDay, 1),
+					firstDay: ye(n.lastDay, 1),
 					lastDay: t.lastDay
 				}, r.releaseId));
 			}
@@ -891,9 +945,9 @@ function M(v = {}) {
 		return t;
 	}, Z = (e) => {
 		let t = X(e);
-		if (t.state !== "open") throw new d(t.state);
+		if (t.state !== "open") throw new p(t.state);
 		return t;
-	}, Xe = (e) => x.find((t) => t.slug === e)?.name ?? e, Ze = (e, t, n = /* @__PURE__ */ new Set()) => e === t || !n.has(e) && (n.add(e), (w.find((t) => t.id === e)?.dependsOnChangeSetIds ?? []).some((e) => Ze(e, t, n))), Qe = (e) => [...e.chains.flatMap((e) => e.branches.map((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) => ({
 		key: t.id,
 		branchless: !1,
 		contentId: e.contentId,
@@ -903,9 +957,9 @@ function M(v = {}) {
 		branchless: !0,
 		contentId: e.contentId,
 		revision: e.revisionId
-	}))], $e = (e) => D.find((t) => t.id === e)?.blueprintId, et = (e, t) => e.blueprintAccessors.length === 0 || e.blueprintAccessors.includes($e(t) ?? ""), tt = (e) => {
-		let t = Qe(e), n = (t, n) => De.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 ? !m(r.heads, t.heads) : !1;
+	}))], 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;
 			return {
 				check: structuredClone(e),
 				...t,
@@ -914,8 +968,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 [...F].sort(a)) {
-			let a = t.filter((t) => et(e, t.contentId));
+		for (let e of [...N].sort(a)) {
+			let a = t.filter((t) => ct(e, t.contentId));
 			if (e.scope === "change_set") {
 				if (a.length === 0) continue;
 				let o = Object.fromEntries(t.map((e) => [e.key, e.revision]));
@@ -935,8 +989,8 @@ function M(v = {}) {
 			}, n(e, t.key)));
 		}
 		return i;
-	}, nt = (e, t) => {
-		let n = [], r = ne(e);
+	}, ut = (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", {
 			contentId: r.contentId,
 			branchId: e.id,
@@ -951,26 +1005,26 @@ function M(v = {}) {
 			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 }));
 		}
-		for (let t of tt(e)) t.cleared || n.push(j("outstanding_check", {
+		for (let t of lt(e)) t.cleared || n.push(j("outstanding_check", {
 			requiredCheckId: t.check.id,
 			contentId: t.contentId,
 			branchId: t.branchId,
 			releaseId: t.releaseId
 		}));
 		for (let t of e.chains) {
-			let e = D.find((e) => e.id === t.contentId);
+			let e = E.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 Fe(P[e.blueprintReleaseId]?.fields, t)) n.push(j("missing_required_field", {
+				if (e && t) for (let i of Ue(M[e.blueprintReleaseId]?.fields, t)) n.push(j("missing_required_field", {
 					contentId: e.id,
 					revisionId: r.headRevisionId,
 					path: `/${i}`
 				}));
 			}
 		}
-		return [...n, ...structuredClone(Oe[e.id] ?? [])];
+		return [...n, ...structuredClone(Ie[e.id] ?? [])];
 	}, Q = (e) => {
-		let t = ne(e);
+		let t = re(e);
 		return e.plannedReleases.filter((e) => !e.withheld).map((n) => ({
 			id: n.id,
 			contentId: n.contentId,
@@ -982,14 +1036,14 @@ function M(v = {}) {
 			validityPeriod: n.validityPeriod ? { ...n.validityPeriod } : void 0
 		}));
 	};
-	for (let [e, t] of Object.entries(Ae)) t.pending && Ke(e, t);
-	return {
+	for (let [e, t] of Object.entries(Re)) t.pending && et(e, t);
+	let $ = {
 		async listBlockReasons() {
-			return [...C].sort(Le).map((e) => ({ ...e }));
+			return [...C].sort(Ge).map((e) => ({ ...e }));
 		},
 		async createBlockReason({ name: e }) {
-			let t = ve(e);
-			if (Re(t)) throw new re(t);
+			let t = xe(e);
+			if (Ke(t)) throw new ie(t);
 			let n = {
 				id: `br_stub_${H++}`,
 				name: t,
@@ -999,9 +1053,9 @@ function M(v = {}) {
 			return C.push(n), { ...n };
 		},
 		async renameBlockReason({ id: e, name: t }) {
-			let n = ve(t), r = C.find((t) => t.id === e);
+			let n = xe(t), r = C.find((t) => t.id === e);
 			if (!r) throw k("Block Reason", e);
-			if (Re(n, e)) throw new re(n);
+			if (Ke(n, e)) throw new ie(n);
 			return r.name = n, r.updateTime = y(), { ...r };
 		},
 		async deleteBlockReason({ id: e }) {
@@ -1009,7 +1063,7 @@ function M(v = {}) {
 			C = C.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))), n = Math.min(e.pageSize || 50, 200), r = e.pageToken ? Number(e.pageToken) : 0;
+			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;
 			return {
 				changeSets: t.slice(r, r + n).map((e) => ({
 					...A(e),
@@ -1021,7 +1075,7 @@ function M(v = {}) {
 			};
 		},
 		async createChangeSet({ name: e, source: t }) {
-			let n = O(e, "name", 200), r = t ? _e(t) : void 0, i = {
+			let n = O(e, "name", 200), r = t ? be(t) : void 0, i = {
 				id: `cs_stub_${H++}`,
 				name: n,
 				source: r,
@@ -1041,33 +1095,33 @@ function M(v = {}) {
 		},
 		async updateChangeSet({ id: e, updateMask: t, name: n, source: r }) {
 			let i = Z(e);
-			if (t.length === 0) throw new a("update_mask is required");
-			let o = t.includes("name") ? O(n ?? "", "name", 200) : i.name, s = i.source;
-			return t.includes("source") && (s = r ? _e(r) : void 0), i.name = o, i.source = s, A(i);
+			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);
 		},
 		async setChangeSetStatus({ id: e, expectedStatus: t, status: n }) {
-			let i = Z(e);
-			if (i.status !== t) throw new p(i.status);
-			if (i.status === n) return A(i);
-			if (!x.some((e) => e.slug === n)) throw new a(`status "${n}" is not in the workspace's catalogue`);
-			if (x.some((e) => e.slug === i.status) && !(S[i.status] ?? []).includes(n)) throw new r({
-				fromStatus: i.status,
+			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({
+				fromStatus: r.status,
 				toStatus: n,
-				reason: `There is no transition from ${Xe(i.status)} to ${Xe(n)}.`,
+				reason: `There is no transition from ${it(r.status)} to ${it(n)}.`,
 				requiresPermission: !1
 			});
-			return i.status = n, A(i);
+			return r.status = n, A(r);
 		},
 		async setChangeSetAssignees({ id: e, assigneeIds: t }) {
 			let n = X(e);
-			if (new Set(t).size !== t.length) throw new a("each assignee is given once");
-			if (t.length > 50) throw new a("at most 50 assignees");
+			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);
 		},
 		async addDependency({ id: e, dependsOnId: t }) {
 			let n = Z(e), r = X(t);
-			if (r.state !== "open") throw new a(`Change Set ${t} is ${r.state}`);
-			if (Ze(t, e)) throw new a("the dependency would close a cycle");
+			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);
 		},
 		async removeDependency({ id: e, dependsOnId: t }) {
@@ -1077,39 +1131,102 @@ function M(v = {}) {
 		},
 		async validatePublish({ id: e, reviewedHeads: t }) {
 			let n = X(e);
-			L(e);
-			let r = Me.get(e);
-			if (r && m(r, t)) return {
+			F(e);
+			let r = Be.get(e);
+			if (r && h(r, t)) return {
 				blockers: [],
 				releases: Q(n),
 				published: !0
 			};
-			if (n.state !== "open") throw new d(n.state);
+			if (n.state !== "open") throw new p(n.state);
 			return {
-				blockers: nt(n, t),
+				blockers: ut(n, t),
 				releases: Q(n),
 				published: !1
 			};
 		},
-		async publish({ id: e, reviewedHeads: t }) {
-			let n = X(e);
-			L(e);
-			let r = Me.get(e);
-			if (r && m(r, t)) return {
-				changeSet: A(n),
-				publishTime: n.closeTime ?? y(),
-				releases: Q(n)
+		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)
 			};
-			if (n.state !== "open") throw new d(n.state);
-			let i = nt(n, t);
-			if (i.length > 0) throw new o(i);
-			let a = Q(n);
-			return n.state = "published", n.closeTime = y(), Me.set(e, { ...t }), {
-				changeSet: A(n),
-				publishTime: n.closeTime,
-				releases: a
+			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
 			};
 		},
+		async changeValidity({ releaseId: e, validityPeriod: n, changeSetName: r, idempotencyKey: i }) {
+			return V(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 a = i.timeline ?? [], o = a.find((t) => t.releaseId === e);
+				if (!o?.validityPeriod || !G(i)) throw new _("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);
+				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++}`,
+					contentId: i.id,
+					kind: "date_only",
+					branchId: "",
+					revisionId: o.revisionId,
+					validityPeriod: {
+						firstDay: c,
+						lastDay: l
+					},
+					supersedesReleaseIds: [e],
+					proposed: !1,
+					proposedForReleaseId: "",
+					splitFromReleaseId: "",
+					withheld: !1
+				}, m = {
+					id: `cs_stub_${H++}`,
+					name: r?.trim() || `Change of validity of ${i.id}`,
+					state: "open",
+					createdBy: b,
+					createTime: y(),
+					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 ? {
+					...t,
+					releaseId: ee.id,
+					kind: "date_only",
+					validityPeriod: {
+						firstDay: c,
+						lastDay: l
+					},
+					publishTime: m.closeTime ?? y()
+				} : t), {
+					changeSet: A(m),
+					publishTime: m.closeTime,
+					releases: te
+				};
+			});
+		},
 		async updateFromMain({ id: e, chainId: t, idempotencyKey: n }) {
 			return V(n, [
 				"updateFromMain",
@@ -1117,16 +1234,16 @@ function M(v = {}) {
 				t
 			], async () => {
 				let n = Z(e);
-				t || L(e);
+				t || F(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(ke[e] ?? []), a = [];
+				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 = Ae[t.id];
-					B.has(t.id) ? a.push(n) : r && (Ke(t.id, r), i.push(n));
+					}, r = Re[t.id];
+					B.has(t.id) ? a.push(n) : r && (et(t.id, r), i.push(n));
 				}
 				return {
 					changeSet: A(n),
@@ -1139,90 +1256,126 @@ function M(v = {}) {
 		},
 		async discardChangeSet(e) {
 			let t = Z(e);
-			return L(e), t.state = "discarded", t.closeTime = y(), t.chains = [], A(t);
+			return F(e), t.state = "discarded", t.closeTime = y(), t.chains = [], A(t);
 		},
 		async listCheckResults(e) {
-			return tt(X(e));
-		},
-		async recordCheckResult({ changeSetId: t, requiredCheckId: n, heads: r, outcome: i, note: o }) {
-			let s = Z(t);
-			if (i === "waived" && o.trim() === "") throw new a("a waived result needs a note saying why");
-			if ([...o].length > 2e3) throw new a(`a note is at most ${l} characters`);
-			let c = F.find((e) => e.id === n);
-			if (!c) throw k("Required Check", n);
-			let d = we(n);
-			if (I === "guardian" && !d.everyMember && !d.userIds.includes(b)) throw new u(`recording results of Required Check ${n} needs its recorder relation`);
-			let f = Qe(s), p = Object.keys(r);
-			if (c.scope === "branch" && p.length !== 1) throw new a("a Branch-scope result names one head");
-			if (c.scope === "change_set" && p.length !== f.length) throw new a("a Change Set-scope result names every head of the Change Set");
-			for (let t of p) {
-				let n = f.find((e) => e.key === t);
-				if (!n) throw new a(`heads name ${t}, which this Change Set doesn't hold`);
-				if (n.revision !== r[t]) throw new e({
-					contentId: n.contentId,
-					branchId: n.branchless ? "" : n.key,
-					expectedHeadId: r[t],
-					currentHeadId: n.revision
+			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) {
+				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({
+					contentId: t.contentId,
+					branchId: t.branchless ? "" : t.key,
+					expectedHeadId: n[e],
+					currentHeadId: t.revision
 				});
 			}
-			let m = {
+			let p = {
 				id: `cr_stub_${H++}`,
-				requiredCheckId: n,
-				heads: { ...r },
-				outcome: i,
-				note: o,
+				requiredCheckId: t,
+				heads: { ...n },
+				outcome: r,
+				note: a,
 				recordedBy: b,
 				recordTime: y()
 			};
-			return De.push({
-				...m,
-				changeSetId: t
-			}), structuredClone(m);
+			return Fe.push({
+				...p,
+				changeSetId: e
+			}), structuredClone(p);
+		},
+		async getEditingSettings() {
+			let e = [...z].sort((e, t) => e.blueprintAccessor < t.blueprintAccessor ? -1 : 1);
+			return {
+				workspace: { ...R },
+				overrides: e.map(Me)
+			};
+		},
+		async getEffectiveEditingSettings(e) {
+			let t = z.find((t) => t.blueprintAccessor === e.trim());
+			return {
+				effective: je(t),
+				editingModeOverridden: (t?.editingMode ?? null) !== null,
+				editingBlockOverridden: (t?.editingBlock ?? null) !== null
+			};
+		},
+		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,
+				editingMode: t,
+				editingBlock: n
+			};
+			return z = [...z.filter((e) => e.blueprintAccessor !== r), i], Me(i);
+		},
+		async deleteBlueprintEditingOverride({ blueprintAccessor: e }) {
+			Pe();
+			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);
 		},
 		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([...F].sort(e));
+			return structuredClone([...N].sort(e));
 		},
 		async createRequiredCheck(e) {
-			let t = ye(e);
-			if (F.some((e) => e.name === t.name)) throw new g(t.name);
-			let n = {
+			let t = Se(e);
+			if (N.some((e) => e.name === t.name)) throw new n(t.name);
+			let r = {
 				id: `rc_stub_${H++}`,
 				...t
 			};
-			return F.push(n), structuredClone(n);
+			return N.push(r), structuredClone(r);
 		},
 		async updateRequiredCheck({ id: e, ...t }) {
-			let n = ye(t), r = F.find((t) => t.id === e);
-			if (!r) throw k("Required Check", e);
-			if (F.some((t) => t.name === n.name && t.id !== e)) throw new g(n.name);
-			return Object.assign(r, n), structuredClone(r);
+			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);
 		},
 		async deleteRequiredCheck({ id: e }) {
-			if (!F.some((t) => t.id === e)) throw k("Required Check", e);
-			F = F.filter((t) => t.id !== e), z.delete(e);
+			if (!N.some((t) => t.id === e)) throw k("Required Check", e);
+			N = N.filter((t) => t.id !== e), L.delete(e);
 		},
 		async listRequiredCheckRecorders(e) {
-			return structuredClone(He(e));
+			return structuredClone(Xe(e));
 		},
 		async grantRequiredCheckRecorder({ requiredCheckId: e, recorder: t }) {
-			let n = He(e);
+			let n = Xe(e);
 			if ("everyMember" in t) {
-				z.set(e, {
+				L.set(e, {
 					...n,
 					everyMember: !0
 				});
 				return;
 			}
-			if (!Te.includes(t.userId)) throw new a(`user ${t.userId} is not a member of the workspace`);
-			z.set(e, {
+			if (!ke.includes(t.userId)) throw new _(`user ${t.userId} is not a member of the workspace`);
+			L.set(e, {
 				...n,
 				userIds: [.../* @__PURE__ */ new Set([...n.userIds, t.userId])].sort()
 			});
 		},
 		async revokeRequiredCheckRecorder({ requiredCheckId: e, recorder: t }) {
-			let n = He(e);
-			z.set(e, "everyMember" in t ? {
+			let n = Xe(e);
+			L.set(e, "everyMember" in t ? {
 				...n,
 				everyMember: !1
 			} : {
@@ -1233,7 +1386,7 @@ function M(v = {}) {
 		async searchBlueprints({ query: e }) {
 			let t = e.trim().toLocaleLowerCase();
 			return {
-				blueprints: he.filter((e) => !e.archived).filter((e) => e.name.toLocaleLowerCase().includes(t)).filter((e) => M.some((t) => t.blueprintId === e.id)).map((e) => ({
+				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
 				})),
@@ -1241,14 +1394,14 @@ function M(v = {}) {
 			};
 		},
 		async getBlueprints(e) {
-			if (e.length > 1e3) throw new a(`at most ${t} Blueprint ids`);
-			return he.filter((t) => e.includes(t.id)).map((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
 			}));
 		},
 		async listBlueprintReleases(e) {
-			return M.filter((t) => t.blueprintId === e).map((e) => ({
+			return D.filter((t) => t.blueprintId === e).map((e) => ({
 				id: e.id,
 				blueprintId: e.blueprintId,
 				name: e.name ?? e.id,
@@ -1257,94 +1410,94 @@ function M(v = {}) {
 			}));
 		},
 		async listCollections() {
-			return [...T].sort(ze).map((e) => ({ ...e }));
+			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 && I === "workspace") throw new n(Se);
-			if (Be(t, i)) throw new g(i);
+			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 T.push(a), r && R.set(a.id, [{
+			return T.push(a), r && I.set(a.id, [{
 				userId: b,
 				level: "owner"
 			}]), { ...a };
 		},
 		async renameCollection({ id: e, name: t }) {
-			let n = O(t, "a Collection's name", 200), r = Y(e);
-			if (Be(r.parentId, n, e)) throw new g(n);
-			return r.name = n, { ...r };
+			let r = O(t, "a Collection's name", 200), i = Y(e);
+			if (Je(i.parentId, r, e)) throw new n(r);
+			return i.name = r, { ...i };
 		},
 		async moveCollection({ id: e, parentId: t }) {
-			let n = Y(e);
-			for (let n = t; n !== ""; n = Y(n).parentId) if (n === e) throw new a(`Collection ${e} can't move under itself or a Collection under it`);
-			if (Be(t, n.name, e)) throw new g("");
-			return n.parentId = t, { ...n };
+			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("");
+			return r.parentId = t, { ...r };
 		},
 		async removeCollection({ id: e }) {
-			if (Y(e), T.some((t) => t.parentId === e)) throw new a(`Collection ${e} has Collections under it: remove or move those first`);
-			T.splice(T.findIndex((t) => t.id === e), 1), R.delete(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);
 			let t = [];
-			for (let n of D) n.collectionIds.includes(e) && (n.collectionIds = n.collectionIds.filter((t) => t !== e), t.push(n.id));
+			for (let n of E) 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: r = !1 }) {
-			if (t && I === "workspace") throw new n(Se);
-			let i = Y(e);
-			if (i.restricted === t) return { ...i };
-			if (!t && !r) throw new a(`unrestricting Collection ${e} discloses its Content to every viewer: confirm it with acknowledge_disclosure`);
-			return i.restricted = t, t ? R.set(e, [{
+		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,
 				level: "owner"
-			}]) : R.delete(e), { ...i };
+			}]) : I.delete(e), { ...r };
 		},
 		async listCollectionGrants(e) {
-			return Ve(e), structuredClone(R.get(e) ?? []).sort((e, t) => e.userId < t.userId ? -1 : +(e.userId > t.userId));
+			return Ye(e), structuredClone(I.get(e) ?? []).sort((e, t) => e.userId < t.userId ? -1 : +(e.userId > t.userId));
 		},
 		async grantCollectionAccess({ collectionId: e, userId: t, level: n }) {
-			if (Ve(e), n !== "viewer" && n !== "editor") throw new a("a grant is viewer or editor");
-			if (!Te.includes(t)) throw new a(`${t} is not a member of the workspace`);
-			let r = R.get(e) ?? [];
-			r.some((e) => e.level === "owner" && e.userId === t) || R.set(e, [...r.filter((e) => e.userId !== t), {
+			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), {
 				userId: t,
 				level: n
 			}]);
 		},
 		async revokeCollectionAccess({ collectionId: e, userId: t }) {
-			Ve(e), R.set(e, (R.get(e) ?? []).filter((e) => e.userId !== t || e.level === "owner"));
+			Ye(e), I.set(e, (I.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 a("filter.search: Editor Search covers Main and open Branch heads, never Releases");
-			if ([...n].length > 200) throw new a("filter.search is at most 200 characters");
+			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 = D.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), o = e.pageToken ? Number(e.pageToken) : 0;
+			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;
 			return {
-				contents: r.slice(o, o + i),
-				nextPageToken: o + i < r.length ? String(o + i) : ""
+				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;
 			if (n) {
-				let e = "revisionId" in n ? n.revisionId : D.find((e) => e.inForce?.releaseId === n.releaseId)?.inForce?.revisionId, r = D.find((t) => e && q(t, e));
+				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 o = M.find((e) => e.id === a);
-			if (!o) throw new _(`Blueprint Release ${a} can't be loaded`, [{
+			let o = D.find((e) => e.id === a);
+			if (!o) throw new se(`Blueprint Release ${a} can't be loaded`, [{
 				source: "contenthub",
 				code: "release_not_found",
 				path: ""
 			}]);
-			if (o.refusals?.length) throw new _(`Blueprint Release ${a} can't be loaded`, o.refusals.map((e) => ({ ...e })));
+			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 D.push({
+			return E.push({
 				id: c,
 				blueprintId: o.blueprintId,
 				blueprintReleaseId: a,
@@ -1378,14 +1531,14 @@ function M(v = {}) {
 			};
 		},
 		async saveRevision({ idempotencyKey: e, ...t }) {
-			if (!e) return Ue(t);
-			let n = JSON.stringify(t), r = Ne.get(e);
+			if (!e) return Ze(t);
+			let n = JSON.stringify(t), r = Ve.get(e);
 			if (r) {
-				if (r.asked !== n) throw new a(`idempotency key ${e} names another save`);
+				if (r.asked !== n) throw new _(`idempotency key ${e} names another save`);
 				return structuredClone(r.content);
 			}
-			let i = await Ue(t);
-			return Ne.set(e, {
+			let i = await Ze(t);
+			return Ve.set(e, {
 				asked: n,
 				content: structuredClone(i)
 			}), i;
@@ -1395,25 +1548,25 @@ function M(v = {}) {
 				kind: "change_set",
 				changeSetId: t
 			} : { kind: "main" };
-			if (n && !t) throw new a("branch_id names a Branch of a Change Set: give its change_set_id too");
-			let [o] = $(r, i, "");
-			if (!o) throw k("Content", e);
-			if (n && n !== o.branchId) {
+			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 && 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 a = K(r).find((e) => e.id === i.headRevisionId), s = a?.data ?? (r.main?.revisionId === i.headRevisionId ? r.main.data : {});
-				o = {
-					...o,
+				let o = K(r).find((e) => e.id === i.headRevisionId), s = o?.data ?? (r.main?.revisionId === i.headRevisionId ? r.main.data : {});
+				a = {
+					...a,
 					revisionId: i.headRevisionId,
 					data: structuredClone(s),
 					branchId: n,
-					revisionCreateTime: a?.createTime ?? o.revisionCreateTime
+					revisionCreateTime: o?.createTime ?? a.revisionCreateTime
 				};
 			}
-			let s = P[r.blueprintReleaseId];
+			let o = M[r.blueprintReleaseId];
 			return {
-				content: o,
-				blueprintRelease: s ? structuredClone(s) : void 0,
+				content: a,
+				blueprintRelease: o ? structuredClone(o) : void 0,
 				attributes: W(r)
 			};
 		},
@@ -1431,7 +1584,7 @@ function M(v = {}) {
 				if (!t.main) throw k("Content", e.contentId);
 				r = K(t);
 			} else {
-				let t = D.find((t) => K(t).some((t) => t.branchId === e.branchId));
+				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);
 			}
@@ -1442,36 +1595,36 @@ function M(v = {}) {
 			};
 		},
 		async compare({ revisionId: e, base: t }) {
-			let n = D.find((t) => K(t).some((t) => t.id === e));
+			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), o;
-			if (t.kind === "revision") o = t.revisionId;
+			let r = K(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 a("the Content is not published: it has no Main Branch");
-				o = n.main.revisionId;
-			} else o = r.find((e) => e.branchId === t.branchId)?.parentId ?? "";
-			let s = r.find((e) => e.id === o);
-			if (!s) throw k("Revision", o);
-			let c = q(n, i.id) ?? {}, l = q(n, s.id) ?? {}, u = [];
-			for (let e of [.../* @__PURE__ */ new Set([...Object.keys(c), ...Object.keys(l)])]) e in l ? e in c ? JSON.stringify(c[e]) !== JSON.stringify(l[e]) && u.push({
+				if (!n.main) throw new _("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 = [];
+			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",
-				before: l[e],
-				after: c[e]
-			}) : u.push({
+				before: c[e],
+				after: s[e]
+			}) : l.push({
 				path: `/${e}`,
 				kind: "removed",
-				before: l[e]
-			}) : u.push({
+				before: c[e]
+			}) : l.push({
 				path: `/${e}`,
 				kind: "added",
-				after: c[e]
+				after: s[e]
 			});
-			let d = ({ data: e, ...t }) => t;
+			let u = ({ data: e, ...t }) => t;
 			return {
-				base: d(s),
-				revision: d(i),
-				changes: u
+				base: u(o),
+				revision: u(i),
+				changes: l
 			};
 		},
 		async listReferences({ contentId: e, revisionId: t }) {
@@ -1485,14 +1638,14 @@ function M(v = {}) {
 					referrers: e.slice(i, i + t),
 					nextPageToken: i + t < e.length ? String(i + t) : ""
 				};
-			}, a = D.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && t.inForce?.revisionId === n.sourceRevisionId).map((e) => ({
+			}, a = E.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 = D.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 = 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) => ({
 				edge: { ...e },
 				releaseId: "",
 				changeSetId: n,
@@ -1504,14 +1657,14 @@ function M(v = {}) {
 			let t;
 			if ("revisionId" in e) t = e.revisionId;
 			else {
-				for (let n of D) {
+				for (let n of E) {
 					let r = Object.values(n.branches).find((t) => t.branchId === e.branchId);
 					r && (t = r.revisionId);
 				}
 				if (!t) throw k("Branch", e.branchId);
 			}
-			return D.flatMap((e) => (e.edges ?? []).filter((e) => e.sourceRevisionId === t)).filter((e) => e.pinReleaseId !== "").flatMap((e) => {
-				let t = D.find((t) => t.id === e.targetContentId)?.inForce?.releaseId ?? "";
+			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 t === e.pinReleaseId ? [] : [{
 					edge: { ...e },
 					supersededByReleaseId: t,
@@ -1521,20 +1674,20 @@ function M(v = {}) {
 		},
 		async setContentCollections({ contentId: e, collectionIds: t }) {
 			let n = U(e), r = [...new Set(t)];
-			if (r.length > 100) throw new a("at most 100 Collections");
+			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);
 			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 a("each assignee is given once");
-			if (t.length > 50) throw new a("at most 50 assignees");
+			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);
 		},
 		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 a("each allowed user is given once");
+			if (new Set(n).size !== n.length) throw new _("each allowed user is given once");
 			return r.block = {
 				blockReasonId: t,
 				allowedUserIds: [...n],
@@ -1549,25 +1702,96 @@ function M(v = {}) {
 		async archiveContent(e) {
 			let t = U(e);
 			if (t.archiveTime) return W(t);
-			if (!t.main) throw new a(`Content ${e} is not published: discard its Change Set instead of archiving it`);
-			if (f(t.timeline ?? [], Pe())) throw new a(`Content ${e} has a Release In Force today or later: end its force first`);
+			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);
 		},
 		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, {
+						kind: "change_set",
+						changeSetId: n.id
+					}, "");
+					return {
+						changeSet: A(n),
+						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({
+					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,
+					reopened: !1
+				};
+			});
+		},
+		async publishDirectEdit({ id: e, expectedHeadId: t, idempotencyKey: n }) {
+			return V(n, [
+				"publishDirectEdit",
+				e,
+				t
+			], 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
+					}];
+				}
+				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);
+			});
+		},
 		async startEditing({ contentId: e, changeSetId: t, effectiveOn: n = "", changeSetName: r = "" }) {
 			let i = U(e);
-			if (!i.main) throw new a(`Content ${e} is not published`);
-			if (J(i), G(i) && !h.test(n)) throw new a("effective_on is required for Dated Content, as YYYY-MM-DD");
-			if (!G(i) && n !== "") throw new a("effective_on is refused for undated Content");
-			let o;
+			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 a;
 			if (t) {
-				if (o = Z(t), o.chains.some((t) => t.contentId === e)) throw new a(`Content ${e} already has a Chain in this Change Set`);
+				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`);
 			} else {
 				let t = Object.values(i.main.data).filter((e) => typeof e == "string").slice(0, 2).join(" ");
-				o = {
+				a = {
 					id: `cs_stub_${H++}`,
 					name: r.trim() ? O(r, "change_set_name", 200) : t || e,
 					state: "open",
@@ -1578,56 +1802,56 @@ function M(v = {}) {
 					status: "",
 					assigneeIds: [],
 					plannedReleases: []
-				}, w.unshift(o);
+				}, w.unshift(a);
 			}
-			let s = H++, c = `br_stub_${s}`, l = {
+			let o = H++, s = `br_stub_${o}`, c = {
 				...structuredClone(i.main),
-				branchId: c
+				branchId: s
 			};
-			i.branches[o.id] = l, o.chains.push({
-				id: `chain_stub_${s}`,
+			i.branches[a.id] = c, a.chains.push({
+				id: `chain_stub_${o}`,
 				contentId: e,
 				born: !1,
 				branches: [{
-					id: c,
+					id: s,
 					position: 0,
 					kind: "editorial",
-					headRevisionId: l.revisionId
+					headRevisionId: c.revisionId
 				}]
 			});
-			let [u] = $(i, {
+			let [l] = ft(i, {
 				kind: "change_set",
-				changeSetId: o.id
+				changeSetId: a.id
 			}, "");
 			return {
-				changeSet: A(o),
-				content: u
+				changeSet: A(a),
+				content: l
 			};
 		},
 		async previewChain({ changeSetId: e, contentId: t, effectiveOn: n, validityPeriod: r }) {
 			Z(e);
 			let i = U(t);
-			if (!i.main) throw new a(`Content ${t} is not published`);
-			if (!G(i)) throw new a("undated Content's Chain takes no date");
-			if (!h.test(n)) throw new a("effective_on is YYYY-MM-DD");
-			let o = i.timeline ?? [], s = o.find((e) => e.validityPeriod && e.validityPeriod.firstDay <= n && (e.validityPeriod.lastDay === "" || n <= e.validityPeriod.lastDay));
+			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");
+			let a = i.timeline ?? [], o = a.find((e) => e.validityPeriod && e.validityPeriod.firstDay <= n && (e.validityPeriod.lastDay === "" || n <= e.validityPeriod.lastDay));
 			return {
-				forkReleaseId: s?.releaseId ?? "",
-				carryForwardReleaseIds: o.filter((e) => e.validityPeriod && e.validityPeriod.firstDay > n).map((e) => e.releaseId),
+				forkReleaseId: o?.releaseId ?? "",
+				carryForwardReleaseIds: a.filter((e) => e.validityPeriod && e.validityPeriod.firstDay > n).map((e) => e.releaseId),
 				mergesMain: !1,
-				cutIntoReleaseIds: s ? [s.releaseId] : [],
-				coveredReleaseIds: r && r.lastDay !== "" ? o.filter((e) => e.validityPeriod && e.validityPeriod.lastDay !== "" && r.firstDay <= e.validityPeriod.firstDay && e.validityPeriod.lastDay <= r.lastDay).map((e) => e.releaseId) : []
+				cutIntoReleaseIds: o ? [o.releaseId] : [],
+				coveredReleaseIds: r && r.lastDay !== "" ? a.filter((e) => e.validityPeriod && e.validityPeriod.lastDay !== "" && r.firstDay <= e.validityPeriod.firstDay && e.validityPeriod.lastDay <= r.lastDay).map((e) => e.releaseId) : []
 			};
 		},
 		async planRepeal({ changeSetId: e, contentId: t, lastDay: n }) {
 			Z(e);
 			let r = U(t);
-			if (J(r), !G(r)) throw new a("a Repeal is for Dated Content");
-			if (!h.test(n)) throw new a("last_day is YYYY-MM-DD");
-			return rt(r, e, {
+			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, {
 				kind: "repeal",
 				validityPeriod: {
-					firstDay: ee(r.timeline ?? [], n)?.validityPeriod?.firstDay ?? n,
+					firstDay: te(r.timeline ?? [], n)?.validityPeriod?.firstDay ?? n,
 					lastDay: n
 				}
 			});
@@ -1635,71 +1859,71 @@ function M(v = {}) {
 		async planWithdrawal({ changeSetId: e, contentId: t }) {
 			Z(e);
 			let n = U(t);
-			if (J(n), G(n)) throw new a("a Withdrawal is for undated Content");
-			return rt(n, e, { kind: "withdrawal" });
+			if (J(n), G(n)) throw new _("a Withdrawal is for undated Content");
+			return dt(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: o } = t, { cs: s, chain: c, branch: l, c: u } = Ge(e, n);
-				if (J(u), l.kind !== "editorial") throw new a("only an editorial Branch's head is released");
-				if (s.plannedReleases.some((e) => e.branchId === n)) throw new a(`Branch ${n} is planned already`);
-				let d = {
+				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++}`,
-					contentId: c.contentId,
+					contentId: s.contentId,
 					kind: "revision",
 					branchId: n,
 					revisionId: "",
 					validityPeriod: r ? { ...r } : void 0,
 					releaseSpec: structuredClone(i ?? {}),
-					supersedesReleaseIds: [...o ?? []],
+					supersedesReleaseIds: [...a ?? []],
 					proposed: !1,
 					proposedForReleaseId: "",
 					splitFromReleaseId: "",
 					withheld: !1
 				};
-				return Je(u, d), s.plannedReleases.push(d), Ye(s, u), structuredClone(d);
+				return nt(l, u), o.plannedReleases.push(u), rt(o, l), structuredClone(u);
 			});
 		},
 		async updatePlannedRelease({ idempotencyKey: e, ...t }) {
 			return V(e, ["updatePlannedRelease", t], async () => {
-				let { changeSetId: e, plannedReleaseId: n, validityPeriod: r, releaseSpec: i, supersedesReleaseIds: o } = t, s = Z(e), c = s.plannedReleases.findIndex((e) => e.id === n);
-				if (c < 0) throw k("Planned Release", n);
-				let l = s.plannedReleases[c];
-				if (l.proposed) throw new a("a proposal is derived from the plans and can't be set");
-				let u = U(l.contentId);
-				J(u);
-				let d = {
-					...structuredClone(l),
+				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);
+				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 = {
+					...structuredClone(c),
 					...r ? { validityPeriod: { ...r } } : {},
 					...i ? { releaseSpec: structuredClone(i) } : {},
-					...o ? { supersedesReleaseIds: [...o] } : {}
+					...a ? { supersedesReleaseIds: [...a] } : {}
 				};
-				return Je(u, d), s.plannedReleases[c] = d, Ye(s, u), structuredClone(d);
+				return nt(l, u), o.plannedReleases[s] = u, rt(o, l), structuredClone(u);
 			});
 		},
 		async appendBranch({ idempotencyKey: e, ...t }) {
 			return V(e, ["appendBranch", t], async () => {
-				let { changeSetId: e, chainId: n, effectiveOn: r } = t, i = Z(e), o = i.chains.find((e) => e.id === n);
-				if (!o) throw k("Chain", n);
-				let s = U(o.contentId);
-				if (o.born || !G(s)) throw new a("only a Chain on published Dated Content takes dates");
-				let c = o.branches.filter((e) => e.kind === "editorial").at(-1);
-				if (!h.test(r) || c?.effectiveOn && r <= c.effectiveOn) throw new a("effective_on is a day after the Chain's last editorial Branch's");
-				let l = o.branches.at(-1), u = `br_stub_${H++}`;
-				o.branches.push({
-					id: u,
-					position: o.branches.length,
+				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");
+				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++}`;
+				a.branches.push({
+					id: l,
+					position: a.branches.length,
 					kind: "editorial",
-					headRevisionId: l?.headRevisionId ?? "",
+					headRevisionId: c?.headRevisionId ?? "",
 					effectiveOn: r
 				});
-				let d = s.branches[e];
-				return d && (s.branches[e] = {
-					...d,
-					branchId: u
+				let u = o.branches[e];
+				return u && (o.branches[e] = {
+					...u,
+					branchId: l
 				}), {
 					changeSet: A(i),
-					branchId: u
+					branchId: l
 				};
 			});
 		},
@@ -1707,8 +1931,8 @@ function M(v = {}) {
 			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 a("the Chain of Content born in the Change Set can't be dropped: discard the Change Set");
-				for (let e of i.branches) qe(e.id);
+				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);
 			});
 		},
@@ -1716,43 +1940,43 @@ function M(v = {}) {
 			let t = B.get(e);
 			return t ? structuredClone(t) : null;
 		},
-		async resolveMerge({ idempotencyKey: t, ...n }) {
-			return V(t, ["resolveMerge", n], async () => {
-				let { changeSetId: t, branchId: r, expectedHeadId: i, resolutions: o } = n, { chain: s, branch: c, c: l } = Ge(t, r), u = B.get(r);
-				if (!u) throw new a(`Branch ${r} has no Pending Merge`);
-				if (c.headRevisionId !== i) throw new e({
-					contentId: l.id,
-					branchId: r,
-					expectedHeadId: i,
-					currentHeadId: c.headRevisionId
+		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({
+					contentId: c.id,
+					branchId: n,
+					expectedHeadId: r,
+					currentHeadId: s.headRevisionId
 				});
-				let d = o.map((e) => e.path), f = u.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 a("decide every field the Pending Merge lists, once");
-				let p = structuredClone(u.merged);
-				for (let e of o) {
-					let t = u.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 p[r] : p[r] = structuredClone(n);
+				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 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);
 				}
-				let m = We({
-					changeSetId: t,
-					chain: s,
-					branch: c,
-					c: l,
-					data: p,
+				let p = Qe({
+					changeSetId: e,
+					chain: o,
+					branch: s,
+					c,
+					data: f,
 					cause: "resolve",
-					secondParentId: u.theirsRevisionId
+					secondParentId: l.theirsRevisionId
 				});
-				return qe(r), m;
+				return tt(n), p;
 			});
 		},
 		async abortMerge({ idempotencyKey: e, ...t }) {
 			return V(e, ["abortMerge", t], async () => {
-				if (Ge(t.changeSetId, t.branchId), !B.has(t.branchId)) throw new a(`Branch ${t.branchId} has no Pending Merge`);
-				qe(t.branchId);
+				if ($e(t.changeSetId, t.branchId), !B.has(t.branchId)) throw new _(`Branch ${t.branchId} has no Pending Merge`);
+				tt(t.branchId);
 			});
 		},
 		async previewInForce({ contentId: e, changeSetId: t, validOn: n }) {
-			let r = Z(t), i = U(e), a = n || Pe(), 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 = 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));
 			if (c) {
 				let e = c.branchId ? o?.branches.find((e) => e.id === c.branchId)?.headRevisionId ?? "" : c.revisionId;
 				return {
@@ -1764,7 +1988,7 @@ function M(v = {}) {
 					data: structuredClone(q(i, e) ?? {})
 				};
 			}
-			let l = ee(i.timeline ?? [], a);
+			let l = te(i.timeline ?? [], a);
 			return l ? {
 				releaseId: l.releaseId,
 				revisionId: l.revisionId,
@@ -1775,7 +1999,8 @@ function M(v = {}) {
 			} : null;
 		}
 	};
-	function rt(e, t, n) {
+	return $;
+	function dt(e, t, n) {
 		let r = {
 			id: `rls_stub_${H++}`,
 			contentId: e.id,
@@ -1793,10 +2018,10 @@ function M(v = {}) {
 			plannedRelease: r
 		}], structuredClone({
 			plannedRelease: r,
-			gapReferrers: Ie(e.id)
+			gapReferrers: We(e.id)
 		});
 	}
-	function $(e, t, n) {
+	function ft(e, t, n) {
 		let r = (t, n) => ({
 			id: e.id,
 			blueprintId: e.blueprintId,
@@ -1811,33 +2036,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 && !N(i.data, n) ? [] : [r(i, {
+			return !i || n && !Ee(i.data, n) ? [] : [r(i, {
 				changeSetId: t.changeSetId,
 				branchId: i.branchId
 			})];
 		}
 		if (!n) return e.main ? [r(e.main, {})] : [];
 		let i = [];
-		e.main && N(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" && N(a.data, n) && i.push(r(a, {
+		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, {
 			changeSetId: t,
 			branchId: a.branchId
 		}));
 		return i;
 	}
 }
-function N(e, t) {
+function Ee(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 P(e = E()) {
+function N(e = le()) {
 	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, he as createStubBlueprintSource, M as createStubContenthubClient, P as createStubStatusSource, oe as stubBlockReasons, j as stubBlocker, fe as stubBlueprintReleases, de as stubBlueprints, E as stubChangeSetStatuses, ce as stubChangeSets, ue as stubCollections, me as stubContents, T as stubIdentity, D as stubRepealedContent, le as stubRequiredChecks, pe as stubResolvedReleases, se as stubStatusTransitions };
+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 };
 
 //# sourceMappingURL=testing.js.map