@knkcs/contenthub-ui 0.2.0 → 0.3.0

package/dist/testing.js

@@ -1,18 +1,18 @@
-import { A as e, C as t, E as n, M as r, S as i, _ as a, b as o, f as s, g as c, h as l, i as u, j as d, k as f, n as p, o as m, r as h, s as ee, t as te, u as ne, v as re, w as ie, x as ae, y as g } from "./heads-Brd2Gtjm.js";
-import { Code as _, ConnectError as v } from "@connectrpc/connect";
-import { createHostMembers as y } from "@knkcs/anker/host";
+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 { Code as v, ConnectError as y } from "@connectrpc/connect";
+import { createHostMembers as b } from "@knkcs/anker/host";
 //#region src/testing/fixtures.ts
-var b = "ws_stub", x = "user_stub", S = "user_ben", C = "2026-10-01T09:00:00.000Z";
-function w() {
+var x = "ws_stub", S = "user_stub", C = "user_ben", w = "2026-10-01T09:00:00.000Z";
+function T() {
 	return {
-		userId: x,
-		workspaceId: b,
-		members: y([{
-			userId: x,
+		userId: S,
+		workspaceId: x,
+		members: b([{
+			userId: S,
 			displayName: "Ada Editor",
 			email: "ada@example.com"
 		}, {
-			userId: S,
+			userId: C,
 			displayName: "Ben Reviewer",
 			email: "ben@example.com"
 		}])
@@ -22,16 +22,16 @@ function oe() {
 	return [{
 		id: "br_author",
 		name: "Being revised by the author",
-		createTime: C,
-		updateTime: C
+		createTime: w,
+		updateTime: w
 	}, {
 		id: "br_embargo",
 		name: "Embargoed until publication",
-		createTime: C,
-		updateTime: C
+		createTime: w,
+		updateTime: w
 	}];
 }
-function se() {
+function E() {
 	return [
 		{
 			slug: "in_progress",
@@ -55,7 +55,7 @@ function se() {
 		}
 	];
 }
-function ce() {
+function se() {
 	return {
 		in_progress: ["in_review", "on_hold"],
 		in_review: [
@@ -67,7 +67,7 @@ function ce() {
 		on_hold: ["in_progress"]
 	};
 }
-function le() {
+function ce() {
 	return [
 		{
 			id: "cs_bgbl_270",
@@ -77,7 +77,7 @@ function le() {
 				reference: "BGBl. 2026 I Nr. 270"
 			},
 			state: "open",
-			createdBy: x,
+			createdBy: S,
 			createTime: "2026-09-30T08:00:00.000Z",
 			chains: [{
 				id: "chain_para_1",
@@ -110,7 +110,7 @@ function le() {
 			}],
 			dependsOnChangeSetIds: [],
 			status: "in_progress",
-			assigneeIds: [x],
+			assigneeIds: [S],
 			plannedReleases: [
 				{
 					id: "rls_p1_2",
@@ -170,19 +170,19 @@ function le() {
 				reference: "BGBl. 2026 I Nr. 255"
 			},
 			state: "open",
-			createdBy: S,
+			createdBy: C,
 			createTime: "2026-09-25T08:00:00.000Z",
 			chains: [],
 			dependsOnChangeSetIds: [],
 			status: "",
-			assigneeIds: [S],
+			assigneeIds: [C],
 			plannedReleases: []
 		},
 		{
 			id: "cs_correction_3",
 			name: "Correction of § 3",
 			state: "published",
-			createdBy: x,
+			createdBy: S,
 			createTime: "2026-09-01T08:00:00.000Z",
 			closeTime: "2026-09-02T08:00:00.000Z",
 			chains: [],
@@ -193,7 +193,7 @@ function le() {
 		}
 	];
 }
-function ue() {
+function le() {
 	return [{
 		id: "rc_print",
 		name: "Druckprobe",
@@ -208,7 +208,7 @@ function ue() {
 		independent: !0
 	}];
 }
-function de() {
+function ue() {
 	return [
 		{
 			id: "col_bgb",
@@ -236,7 +236,7 @@ function de() {
 		}
 	];
 }
-function fe() {
+function de() {
 	return [
 		{
 			id: "bp_commentary",
@@ -252,7 +252,7 @@ function fe() {
 		}
 	];
 }
-function pe() {
+function fe() {
 	return [
 		{
 			id: "bpr_paragraph_2",
@@ -274,7 +274,7 @@ function pe() {
 		}
 	];
 }
-function me() {
+function pe() {
 	let e = (e, t) => ({
 		field_type: "text",
 		config: {
@@ -301,7 +301,7 @@ function me() {
 		}
 	};
 }
-function T() {
+function D() {
 	let e = "2001-11-01T08:00:00.000Z";
 	return {
 		id: "content_para_3",
@@ -332,7 +332,7 @@ function T() {
 		}]
 	};
 }
-function he() {
+function me() {
 	let e = "2026-09-01T08:00:00.000Z";
 	return [
 		{
@@ -365,7 +365,7 @@ function he() {
 			blueprintId: "bp_paragraph",
 			blueprintReleaseId: "bpr_paragraph_1",
 			collectionIds: ["col_bgb"],
-			assigneeIds: [x, S],
+			assigneeIds: [S, C],
 			main: {
 				revisionId: "rev_p1_main",
 				data: {
@@ -432,7 +432,7 @@ function he() {
 					secondParentId: "",
 					blueprintReleaseId: "bpr_paragraph_1",
 					createTime: "2026-09-30T09:00:00.000Z",
-					author: x,
+					author: S,
 					cause: "save",
 					branchId: "br_para_1_b",
 					changeSetId: "cs_bgbl_270",
@@ -448,7 +448,7 @@ function he() {
 					secondParentId: "",
 					blueprintReleaseId: "bpr_paragraph_1",
 					createTime: "2026-09-30T08:30:00.000Z",
-					author: S,
+					author: C,
 					cause: "save",
 					branchId: "br_para_1_a",
 					changeSetId: "cs_bgbl_270",
@@ -464,7 +464,7 @@ function he() {
 					secondParentId: "",
 					blueprintReleaseId: "bpr_paragraph_1",
 					createTime: e,
-					author: x,
+					author: S,
 					cause: "create",
 					branchId: "br_para_1_main",
 					changeSetId: "cs_correction_3"
@@ -548,7 +548,7 @@ function he() {
 			blueprintId: "bp_paragraph",
 			blueprintReleaseId: "bpr_paragraph_1",
 			collectionIds: ["col_stgb"],
-			assigneeIds: [S],
+			assigneeIds: [C],
 			main: {
 				revisionId: "rev_s211_main",
 				data: {
@@ -585,7 +585,7 @@ function he() {
 }
 //#endregion
 //#region src/testing/stub-blueprint-source.ts
-function ge(e = fe(), t = pe()) {
+function he(e = de(), t = fe()) {
 	return {
 		async searchBlueprints({ query: t }) {
 			let n = t.trim().toLocaleLowerCase();
@@ -604,37 +604,37 @@ function ge(e = fe(), t = pe()) {
 }
 //#endregion
 //#region src/testing/stub-client.ts
-function _e(e, t) {
+function ge(e, t) {
 	let n = /* @__PURE__ */ new Date(`${e}T00:00:00Z`);
 	return n.setUTCDate(n.getUTCDate() + t), n.toISOString().slice(0, 10);
 }
-function E(e, t, n) {
+function O(e, t, n) {
 	let r = e.trim();
-	if (r === "") throw new i(`${t} is required`);
-	if ([...r].length > n) throw new i(`${t} is at most ${n} characters`);
-	if (/[\u0000-\u001f\u007f]/.test(r)) throw new i(`${t} is one line of text`);
+	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`);
 	return r;
 }
-function ve(e) {
-	if (!/^\d{4}-\d{2}-\d{2}$/.test(e.date.trim())) throw new i(`source.date "${e.date}" is not a day as YYYY-MM-DD`);
+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`);
 	return {
 		date: e.date.trim(),
-		reference: E(e.reference, "source.reference", 500)
+		reference: O(e.reference, "source.reference", 500)
 	};
 }
-function ye(e) {
+function ve(e) {
 	let t = e.trim();
-	if (t === "") throw new i("a Block Reason needs a name");
-	if ([...t].length > 200) throw new i("a Block Reason's name is at most 200 characters");
-	if (/[\u0000-\u001f\u007f]/.test(t)) throw new i("a Block Reason's name is one line of text");
+	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");
 	return t;
 }
-function be(e) {
-	let t = E(e.name, "a Required Check's name", 200);
-	if (e.scope !== "branch" && e.scope !== "change_set") throw new i("a Required Check's scope is Branch or Change Set");
+function ye(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");
 	let n = e.blueprintAccessors.map((e) => {
 		let t = e.trim();
-		if (t === "" || [...t].length > 200 || /[\u0000-\u001f\u007f]/.test(t)) throw new i(`"${t}" is not a Blueprint accessor`);
+		if (t === "" || [...t].length > 200 || /[\u0000-\u001f\u007f]/.test(t)) throw new a(`"${t}" is not a Blueprint accessor`);
 		return t;
 	});
 	return {
@@ -644,12 +644,12 @@ function be(e) {
 		independent: e.independent
 	};
 }
-var xe = "who records a Required Check can be narrowed only in authz.mode guardian: in workspace mode every member records every check (ADR 0017)", Se = "this Change Set holds work you can't see: publishing, discarding or updating all of it needs you to see every Content in it", D = "Restricted Collections need authz.mode guardian: in workspace mode a restriction could not be enforced (ADR 0017)";
-function O(e, t) {
-	return new v(`${e} ${t}: not found`, _.NotFound);
+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)";
+function k(e, t) {
+	return new y(`${e} ${t}: not found`, v.NotFound);
 }
-var k = (e) => structuredClone(e);
-function A(e, t = {}) {
+var A = (e) => structuredClone(e);
+function j(e, t = {}) {
 	return {
 		code: e,
 		contentId: "",
@@ -669,34 +669,34 @@ function A(e, t = {}) {
 		...t
 	};
 }
-function j(_ = {}) {
-	let v = _.now ?? (() => "2026-10-01T09:00:00.000Z"), y = _.userId ?? "user_stub", b = _.statuses ?? se(), x = _.statusTransitions ?? ce(), S = (_.blockReasons ?? oe()).map((e) => ({ ...e })), C = (_.changeSets ?? le()).map(k), w = (_.collections ?? de()).map((e) => ({ ...e })), T = structuredClone(_.contents ?? he()), ge = _.blueprints ?? fe(), j = _.blueprintReleases ?? pe(), N = _.resolvedReleases ?? me(), P = structuredClone(_.requiredChecks ?? ue()), F = _.authzMode ?? "guardian", Ce = new Set(_.withheld ?? []), I = (e) => {
-		if (Ce.has(e)) throw new r(Se);
-	}, L = new Map(Object.entries(structuredClone(_.collectionGrants ?? {}))), R = new Map(Object.entries(structuredClone(_.recorders ?? {}))), we = (e) => R.get(e) ?? {
+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) ?? {
 		everyMember: !0,
 		userIds: []
-	}, Te = _.memberIds ?? ["user_stub", "user_ben"], Ee = _.admin ?? !0, De = structuredClone(_.checkResults ?? []), Oe = _.publishBlockers ?? {}, ke = _.pendingMerges ?? {}, z = structuredClone(_.conflicts ?? {}), B = /* @__PURE__ */ new Map(), Ae = /* @__PURE__ */ new Map(), V = async (e, t, n) => {
+	}, 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) => {
 		if (!e) return n();
-		let r = JSON.stringify(t), a = Ae.get(e);
-		if (a) {
-			if (a.asked !== r) throw new i(`idempotency key ${e} names another request`);
-			return structuredClone(a.answer);
+		let r = JSON.stringify(t), i = je.get(e);
+		if (i) {
+			if (i.asked !== r) throw new a(`idempotency key ${e} names another request`);
+			return structuredClone(i.answer);
 		}
 		let o = await n();
-		return Ae.set(e, {
+		return je.set(e, {
 			asked: r,
 			answer: structuredClone(o)
 		}), o;
-	}, je = /* @__PURE__ */ new Map(), Me = /* @__PURE__ */ new Map(), H = 1, U = (e) => {
-		let t = T.find((t) => t.id === e);
-		if (!t) throw O("Content", e);
+	}, Me = /* @__PURE__ */ new Map(), Ne = /* @__PURE__ */ new Map(), H = 1, U = (e) => {
+		let t = D.find((t) => t.id === e);
+		if (!t) throw k("Content", e);
 		return t;
 	}, W = (e) => structuredClone({
 		collectionIds: [...e.collectionIds].sort(),
 		assigneeIds: e.assigneeIds ?? [],
 		block: e.block,
 		archiveTime: e.archiveTime
-	}), Ne = () => v().slice(0, 10), G = (e) => N[e.blueprintReleaseId]?.dated ?? !1, K = (e) => {
+	}), Pe = () => y().slice(0, 10), G = (e) => P[e.blueprintReleaseId]?.dated ?? !1, K = (e) => {
 		let t = [...e.revisions ?? []], n = [...Object.entries(e.branches).map(([e, t]) => ({
 			...t,
 			changeSetId: e
@@ -712,7 +712,7 @@ function j(_ = {}) {
 			secondParentId: "",
 			blueprintReleaseId: e.blueprintReleaseId,
 			createTime: r.revisionCreateTime,
-			author: y,
+			author: b,
 			cause: "create",
 			branchId: r.branchId,
 			changeSetId: r.changeSetId,
@@ -723,59 +723,59 @@ function j(_ = {}) {
 		e.main,
 		e.inForce,
 		...Object.values(e.branches)
-	].find((e) => e?.revisionId === t)?.data ?? e.revisions?.find((e) => e.id === t)?.data, Pe = (e, t) => {
+	].find((e) => e?.revisionId === t)?.data ?? e.revisions?.find((e) => e.id === t)?.data, Fe = (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 a(e.id);
-		if (e.block && !e.block.allowedUserIds.includes(y)) throw new re(e.id, e.block.blockReasonId);
-	}, Fe = (e) => T.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && n.pinReleaseId === "" && t.inForce?.revisionId === n.sourceRevisionId).map((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) => ({
 		edge: { ...e },
 		releaseId: t.inForce?.releaseId ?? ""
-	}))), Ie = (e, t) => e.name < t.name ? -1 : e.name > t.name ? 1 : e.id < t.id ? -1 : +(e.id > t.id), Le = (e, t) => S.some((n) => n.name === e && n.id !== t), Re = (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 = w.find((t) => t.id === e);
-		if (!t) throw O("Collection", e);
+	}))), 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) => {
+		let t = T.find((t) => t.id === e);
+		if (!t) throw k("Collection", e);
 		return t;
-	}, ze = (e, t, n) => w.some((r) => r.parentId === e && r.name === t && r.id !== n), Be = (e) => {
-		if (F === "workspace") throw new n(D);
-		if (!Y(e).restricted) throw new i(`Collection ${e} is open: only a Restricted Collection takes grants`);
-		let t = (L.get(e) ?? []).some((e) => e.userId === y && e.level === "owner");
-		if (!Ee && !t) throw new ee("only its owner or a workspace admin manages its grants");
-	}, Ve = (e) => {
-		if (F === "workspace") throw new ae("required_check_recorders", xe);
-		if (!Ee) throw new ee("permission denied");
-		if (e === "") throw new i("required_check_id is required");
-		if (!P.some((t) => t.id === e)) throw O("Required Check", e);
+	}, 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);
-	}, He = 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 O("Branch", t);
-		let c = U(o.contentId);
-		if (J(c), B.has(t)) throw new i("a Pending Merge waits on this Branch: resolve or abort it first");
-		if (n === "") throw new i("expected_head_id is required");
-		if (s.headRevisionId !== n) throw new f({
-			contentId: c.id,
-			branchId: t,
-			expectedHeadId: n,
-			currentHeadId: s.headRevisionId
+	}, 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
 		});
-		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 i(`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 Ue({
-			changeSetId: e,
-			chain: o,
-			branch: s,
-			c,
-			data: d,
+		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,
 			cause: "save"
 		});
-	}, Ue = ({ changeSetId: e, chain: t, branch: n, c: r, data: i, cause: a, secondParentId: o = "" }) => {
-		let s = n.id, c = `rev_stub_${H++}`, l = v();
+	}, We = ({ 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,
 			contentId: r.id,
@@ -783,7 +783,7 @@ function j(_ = {}) {
 			secondParentId: o,
 			blueprintReleaseId: r.blueprintReleaseId,
 			createTime: l,
-			author: y,
+			author: b,
 			cause: a,
 			branchId: s,
 			changeSetId: e,
@@ -804,17 +804,17 @@ function j(_ = {}) {
 			revisionCreateTime: l,
 			releaseId: ""
 		};
-	}, We = (e, t) => {
+	}, Ge = (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 O("Branch", t);
+		if (!r || !i) throw k("Branch", t);
 		return {
 			cs: n,
 			chain: r,
 			branch: i,
 			c: U(r.contentId)
 		};
-	}, Ge = (e, t) => {
-		for (let n of C) for (let r of n.chains) {
+	}, Ke = (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;
 			let i = {
@@ -827,33 +827,33 @@ function j(_ = {}) {
 				fields: structuredClone(t.fields),
 				merged: structuredClone(t.merged)
 			};
-			B.set(e, i), n.hasPendingMerge = !0, delete z[e];
+			B.set(e, i), n.hasPendingMerge = !0, delete Ae[e];
 			return;
 		}
-		throw O("Branch", e);
-	}, Ke = (e) => {
+		throw k("Branch", e);
+	}, qe = (e) => {
 		B.delete(e);
-		for (let t of C) for (let n of t.chains) {
+		for (let t of w) for (let n of t.chains) {
 			let t = n.branches.find((t) => t.id === e);
 			t && (t.hasPendingMerge = !1);
 		}
-	}, qe = (e, t) => {
+	}, Je = (e, t) => {
 		let n = t.validityPeriod;
 		if (G(e)) {
-			if (!n || !h.test(n.firstDay)) throw new i("validity_period.first_day is required for Dated Content");
-			if (n.lastDay !== "" && (!h.test(n.lastDay) || n.lastDay < n.firstDay)) throw new i("validity_period.last_day is a day on or after first_day");
-		} else if (n) throw new i("validity_period is refused for undated Content");
-		let r = Pe(N[e.blueprintReleaseId]?.releaseSpec, t.releaseSpec ?? {}).map((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) => ({
 			source: "fieldkit",
 			code: "required",
 			path: `/${e}`
 		}));
-		if (r.length > 0) throw new g("the Release Spec values break the Blueprint Release", r);
+		if (r.length > 0) throw new _("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 o(e.id, r);
+			if (r.length > 0) throw new c(e.id, r);
 		}
-	}, Je = (e, t) => {
+	}, Ye = (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({
@@ -876,23 +876,23 @@ function j(_ = {}) {
 				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: _e(n.firstDay, -1)
+					lastDay: ge(n.firstDay, -1)
 				}, ""), n.lastDay !== "" && (t.lastDay === "" || t.lastDay > n.lastDay) && a(r, {
-					firstDay: _e(n.lastDay, 1),
+					firstDay: ge(n.lastDay, 1),
 					lastDay: t.lastDay
 				}, r.releaseId));
 			}
 		}
 		e.plannedReleases = [...r, ...i];
 	}, X = (e) => {
-		let t = C.find((t) => t.id === e);
-		if (!t) throw O("Change Set", e);
+		let t = w.find((t) => t.id === e);
+		if (!t) throw k("Change Set", e);
 		return t;
 	}, Z = (e) => {
 		let t = X(e);
-		if (t.state !== "open") throw new l(t.state);
+		if (t.state !== "open") throw new d(t.state);
 		return t;
-	}, Ye = (e) => b.find((t) => t.slug === e)?.name ?? e, Xe = (e, t, n = /* @__PURE__ */ new Set()) => e === t || !n.has(e) && (n.add(e), (C.find((t) => t.id === e)?.dependsOnChangeSetIds ?? []).some((e) => Xe(e, t, n))), Ze = (e) => [...e.chains.flatMap((e) => e.branches.map((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) => ({
 		key: t.id,
 		branchless: !1,
 		contentId: e.contentId,
@@ -902,9 +902,9 @@ function j(_ = {}) {
 		branchless: !0,
 		contentId: e.contentId,
 		revision: e.revisionId
-	}))], Qe = (e) => T.find((t) => t.id === e)?.blueprintId, $e = (e, t) => e.blueprintAccessors.length === 0 || e.blueprintAccessors.includes(Qe(t) ?? ""), et = (e) => {
-		let t = Ze(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 ? !p(r.heads, t.heads) : !1;
+	}))], $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;
 			return {
 				check: structuredClone(e),
 				...t,
@@ -913,8 +913,8 @@ function j(_ = {}) {
 				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 [...P].sort(a)) {
-			let a = t.filter((t) => $e(e, t.contentId));
+		for (let e of [...F].sort(a)) {
+			let a = t.filter((t) => et(e, t.contentId));
 			if (e.scope === "change_set") {
 				if (a.length === 0) continue;
 				let o = Object.fromEntries(t.map((e) => [e.key, e.revision]));
@@ -934,33 +934,33 @@ function j(_ = {}) {
 			}, n(e, t.key)));
 		}
 		return i;
-	}, tt = (e, t) => {
-		let n = [], r = te(e);
-		for (let r of e.chains) for (let e of r.branches) t[e.id] !== e.headRevisionId && n.push(A("moved_head", {
+	}, nt = (e, t) => {
+		let n = [], r = ne(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,
 			expectedHeadId: t[e.id] ?? "",
 			currentHeadId: e.headRevisionId
 		}));
-		for (let [e, i] of Object.entries(t)) e in r || n.push(A("moved_head", {
+		for (let [e, i] of Object.entries(t)) e in r || n.push(j("moved_head", {
 			branchId: e,
 			expectedHeadId: i
 		}));
 		for (let t of e.dependsOnChangeSetIds) {
-			let e = C.find((e) => e.id === t)?.state;
-			e === "open" ? n.push(A("unpublished_dependency", { dependencyChangeSetId: t })) : e === "discarded" && n.push(A("discarded_dependency", { dependencyChangeSetId: t }));
+			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 et(e)) t.cleared || n.push(A("outstanding_check", {
+		for (let t of tt(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 = T.find((e) => e.id === t.contentId);
+			let e = D.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 Pe(N[e.blueprintReleaseId]?.fields, t)) n.push(A("missing_required_field", {
+				if (e && t) for (let i of Fe(P[e.blueprintReleaseId]?.fields, t)) n.push(j("missing_required_field", {
 					contentId: e.id,
 					revisionId: r.headRevisionId,
 					path: `/${i}`
@@ -969,7 +969,7 @@ function j(_ = {}) {
 		}
 		return [...n, ...structuredClone(Oe[e.id] ?? [])];
 	}, Q = (e) => {
-		let t = te(e);
+		let t = ne(e);
 		return e.plannedReleases.filter((e) => !e.withheld).map((n) => ({
 			id: n.id,
 			contentId: n.contentId,
@@ -981,37 +981,37 @@ function j(_ = {}) {
 			validityPeriod: n.validityPeriod ? { ...n.validityPeriod } : void 0
 		}));
 	};
-	for (let [e, t] of Object.entries(z)) t.pending && Ge(e, t);
+	for (let [e, t] of Object.entries(Ae)) t.pending && Ke(e, t);
 	return {
 		async listBlockReasons() {
-			return [...S].sort(Ie).map((e) => ({ ...e }));
+			return [...C].sort(Le).map((e) => ({ ...e }));
 		},
 		async createBlockReason({ name: e }) {
-			let t = ye(e);
-			if (Le(t)) throw new ne(t);
+			let t = ve(e);
+			if (Re(t)) throw new re(t);
 			let n = {
 				id: `br_stub_${H++}`,
 				name: t,
-				createTime: v(),
-				updateTime: v()
+				createTime: y(),
+				updateTime: y()
 			};
-			return S.push(n), { ...n };
+			return C.push(n), { ...n };
 		},
 		async renameBlockReason({ id: e, name: t }) {
-			let n = ye(t), r = S.find((t) => t.id === e);
-			if (!r) throw O("Block Reason", e);
-			if (Le(n, e)) throw new ne(n);
-			return r.name = n, r.updateTime = v(), { ...r };
+			let n = ve(t), r = C.find((t) => t.id === e);
+			if (!r) throw k("Block Reason", e);
+			if (Re(n, e)) throw new re(n);
+			return r.name = n, r.updateTime = y(), { ...r };
 		},
 		async deleteBlockReason({ id: e }) {
-			if (!S.some((t) => t.id === e)) throw O("Block Reason", e);
-			S = S.filter((t) => t.id !== e);
+			if (!C.some((t) => t.id === e)) throw k("Block Reason", e);
+			C = C.filter((t) => t.id !== e);
 		},
 		async listChangeSets(e = {}) {
-			let t = C.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))), n = Math.min(e.pageSize || 50, 200), r = e.pageToken ? Number(e.pageToken) : 0;
 			return {
 				changeSets: t.slice(r, r + n).map((e) => ({
-					...k(e),
+					...A(e),
 					chains: [],
 					dependsOnChangeSetIds: [],
 					plannedReleases: []
@@ -1020,91 +1020,91 @@ function j(_ = {}) {
 			};
 		},
 		async createChangeSet({ name: e, source: t }) {
-			let n = E(e, "name", 200), r = t ? ve(t) : void 0, i = {
+			let n = O(e, "name", 200), r = t ? _e(t) : void 0, i = {
 				id: `cs_stub_${H++}`,
 				name: n,
 				source: r,
 				state: "open",
-				createdBy: y,
-				createTime: v(),
+				createdBy: b,
+				createTime: y(),
 				chains: [],
 				dependsOnChangeSetIds: [],
 				status: "",
 				assigneeIds: [],
 				plannedReleases: []
 			};
-			return C.unshift(i), k(i);
+			return w.unshift(i), A(i);
 		},
 		async getChangeSet(e) {
-			return k(X(e));
+			return A(X(e));
 		},
 		async updateChangeSet({ id: e, updateMask: t, name: n, source: r }) {
-			let a = Z(e);
-			if (t.length === 0) throw new i("update_mask is required");
-			let o = t.includes("name") ? E(n ?? "", "name", 200) : a.name, s = a.source;
-			return t.includes("source") && (s = r ? ve(r) : void 0), a.name = o, a.source = s, k(a);
-		},
-		async setChangeSetStatus({ id: t, expectedStatus: n, status: r }) {
-			let a = Z(t);
-			if (a.status !== n) throw new e(a.status);
-			if (a.status === r) return k(a);
-			if (!b.some((e) => e.slug === r)) throw new i(`status "${r}" is not in the workspace's catalogue`);
-			if (b.some((e) => e.slug === a.status) && !(x[a.status] ?? []).includes(r)) throw new d({
-				fromStatus: a.status,
-				toStatus: r,
-				reason: `There is no transition from ${Ye(a.status)} to ${Ye(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);
+		},
+		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,
+				toStatus: n,
+				reason: `There is no transition from ${Xe(i.status)} to ${Xe(n)}.`,
 				requiresPermission: !1
 			});
-			return a.status = r, k(a);
+			return i.status = n, A(i);
 		},
 		async setChangeSetAssignees({ id: e, assigneeIds: t }) {
 			let n = X(e);
-			if (new Set(t).size !== t.length) throw new i("each assignee is given once");
-			if (t.length > 50) throw new i("at most 50 assignees");
-			return n.assigneeIds = [...t], k(n);
+			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");
+			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 i(`Change Set ${t} is ${r.state}`);
-			if (Xe(t, e)) throw new i("the dependency would close a cycle");
-			return n.dependsOnChangeSetIds.includes(t) || n.dependsOnChangeSetIds.push(t), k(n);
+			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");
+			return n.dependsOnChangeSetIds.includes(t) || n.dependsOnChangeSetIds.push(t), A(n);
 		},
 		async removeDependency({ id: e, dependsOnId: t }) {
 			let n = Z(e);
-			if (!n.dependsOnChangeSetIds.includes(t)) throw O(`dependency of Change Set ${e} on`, t);
-			return n.dependsOnChangeSetIds = n.dependsOnChangeSetIds.filter((e) => e !== t), k(n);
+			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);
 		},
 		async validatePublish({ id: e, reviewedHeads: t }) {
 			let n = X(e);
-			I(e);
-			let r = je.get(e);
-			if (r && p(r, t)) return {
+			L(e);
+			let r = Me.get(e);
+			if (r && m(r, t)) return {
 				blockers: [],
 				releases: Q(n),
 				published: !0
 			};
-			if (n.state !== "open") throw new l(n.state);
+			if (n.state !== "open") throw new d(n.state);
 			return {
-				blockers: tt(n, t),
+				blockers: nt(n, t),
 				releases: Q(n),
 				published: !1
 			};
 		},
 		async publish({ id: e, reviewedHeads: t }) {
 			let n = X(e);
-			I(e);
-			let r = je.get(e);
-			if (r && p(r, t)) return {
-				changeSet: k(n),
-				publishTime: n.closeTime ?? v(),
+			L(e);
+			let r = Me.get(e);
+			if (r && m(r, t)) return {
+				changeSet: A(n),
+				publishTime: n.closeTime ?? y(),
 				releases: Q(n)
 			};
-			if (n.state !== "open") throw new l(n.state);
-			let i = tt(n, t);
-			if (i.length > 0) throw new ie(i);
+			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 = v(), je.set(e, { ...t }), {
-				changeSet: k(n),
+			return n.state = "published", n.closeTime = y(), Me.set(e, { ...t }), {
+				changeSet: A(n),
 				publishTime: n.closeTime,
 				releases: a
 			};
@@ -1116,19 +1116,19 @@ function j(_ = {}) {
 				t
 			], async () => {
 				let n = Z(e);
-				t || I(e);
+				t || L(e);
 				let r = t ? n.chains.filter((e) => e.id === t) : n.chains;
-				if (t && r.length === 0) throw O("Chain", t);
+				if (t && r.length === 0) throw k("Chain", t);
 				let i = structuredClone(ke[e] ?? []), a = [];
 				for (let e of r) for (let t of e.branches) {
 					let n = {
 						branchId: t.id,
 						contentId: e.contentId
-					}, r = z[t.id];
-					B.has(t.id) ? a.push(n) : r && (Ge(t.id, r), i.push(n));
+					}, r = Ae[t.id];
+					B.has(t.id) ? a.push(n) : r && (Ke(t.id, r), i.push(n));
 				}
 				return {
-					changeSet: k(n),
+					changeSet: A(n),
 					mergedBranchIds: [],
 					conflicted: i,
 					pending: a,
@@ -1138,90 +1138,90 @@ function j(_ = {}) {
 		},
 		async discardChangeSet(e) {
 			let t = Z(e);
-			return I(e), t.state = "discarded", t.closeTime = v(), t.chains = [], k(t);
+			return L(e), t.state = "discarded", t.closeTime = y(), t.chains = [], A(t);
 		},
 		async listCheckResults(e) {
-			return et(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 i("a waived result needs a note saying why");
-			if ([...a].length > 2e3) throw new i(`a note is at most ${s} characters`);
-			let l = P.find((e) => e.id === t);
-			if (!l) throw O("Required Check", t);
-			let u = we(t);
-			if (F === "guardian" && !u.everyMember && !u.userIds.includes(y)) throw new c(`recording results of Required Check ${t} needs its recorder relation`);
-			let d = Ze(o), p = Object.keys(n);
-			if (l.scope === "branch" && p.length !== 1) throw new i("a Branch-scope result names one head");
-			if (l.scope === "change_set" && p.length !== d.length) throw new i("a Change Set-scope result names every head of the Change Set");
-			for (let e of p) {
-				let t = d.find((t) => t.key === e);
-				if (!t) throw new i(`heads name ${e}, which this Change Set doesn't hold`);
-				if (t.revision !== n[e]) throw new f({
-					contentId: t.contentId,
-					branchId: t.branchless ? "" : t.key,
-					expectedHeadId: n[e],
-					currentHeadId: t.revision
+			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
 				});
 			}
 			let m = {
 				id: `cr_stub_${H++}`,
-				requiredCheckId: t,
-				heads: { ...n },
-				outcome: r,
-				note: a,
-				recordedBy: y,
-				recordTime: v()
+				requiredCheckId: n,
+				heads: { ...r },
+				outcome: i,
+				note: o,
+				recordedBy: b,
+				recordTime: y()
 			};
 			return De.push({
 				...m,
-				changeSetId: e
+				changeSetId: t
 			}), structuredClone(m);
 		},
 		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([...P].sort(e));
+			return structuredClone([...F].sort(e));
 		},
 		async createRequiredCheck(e) {
-			let n = be(e);
-			if (P.some((e) => e.name === n.name)) throw new t(n.name);
-			let r = {
+			let t = ye(e);
+			if (F.some((e) => e.name === t.name)) throw new g(t.name);
+			let n = {
 				id: `rc_stub_${H++}`,
-				...n
+				...t
 			};
-			return P.push(r), structuredClone(r);
+			return F.push(n), structuredClone(n);
 		},
-		async updateRequiredCheck({ id: e, ...n }) {
-			let r = be(n), i = P.find((t) => t.id === e);
-			if (!i) throw O("Required Check", e);
-			if (P.some((t) => t.name === r.name && t.id !== e)) throw new t(r.name);
-			return Object.assign(i, r), structuredClone(i);
+		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);
 		},
 		async deleteRequiredCheck({ id: e }) {
-			if (!P.some((t) => t.id === e)) throw O("Required Check", e);
-			P = P.filter((t) => t.id !== e), R.delete(e);
+			if (!F.some((t) => t.id === e)) throw k("Required Check", e);
+			F = F.filter((t) => t.id !== e), z.delete(e);
 		},
 		async listRequiredCheckRecorders(e) {
-			return structuredClone(Ve(e));
+			return structuredClone(He(e));
 		},
 		async grantRequiredCheckRecorder({ requiredCheckId: e, recorder: t }) {
-			let n = Ve(e);
+			let n = He(e);
 			if ("everyMember" in t) {
-				R.set(e, {
+				z.set(e, {
 					...n,
 					everyMember: !0
 				});
 				return;
 			}
-			if (!Te.includes(t.userId)) throw new i(`user ${t.userId} is not a member of the workspace`);
-			R.set(e, {
+			if (!Te.includes(t.userId)) throw new a(`user ${t.userId} is not a member of the workspace`);
+			z.set(e, {
 				...n,
 				userIds: [.../* @__PURE__ */ new Set([...n.userIds, t.userId])].sort()
 			});
 		},
 		async revokeRequiredCheckRecorder({ requiredCheckId: e, recorder: t }) {
-			let n = Ve(e);
-			R.set(e, "everyMember" in t ? {
+			let n = He(e);
+			z.set(e, "everyMember" in t ? {
 				...n,
 				everyMember: !1
 			} : {
@@ -1232,12 +1232,22 @@ function j(_ = {}) {
 		async searchBlueprints({ query: e }) {
 			let t = e.trim().toLocaleLowerCase();
 			return {
-				blueprints: ge.filter((e) => e.name.toLocaleLowerCase().includes(t)).filter((e) => j.some((t) => t.blueprintId === e.id)).map((e) => ({ ...e })),
+				blueprints: he.filter((e) => !e.archived).filter((e) => e.name.toLocaleLowerCase().includes(t)).filter((e) => M.some((t) => t.blueprintId === e.id)).map((e) => ({
+					id: e.id,
+					name: e.name
+				})),
 				nextPageToken: ""
 			};
 		},
+		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) => ({
+				id: e.id,
+				name: e.name
+			}));
+		},
 		async listBlueprintReleases(e) {
-			return j.filter((t) => t.blueprintId === e).map((e) => ({
+			return M.filter((t) => t.blueprintId === e).map((e) => ({
 				id: e.id,
 				blueprintId: e.blueprintId,
 				name: e.name ?? e.id,
@@ -1246,94 +1256,94 @@ function j(_ = {}) {
 			}));
 		},
 		async listCollections() {
-			return [...w].sort(Re).map((e) => ({ ...e }));
+			return [...T].sort(ze).map((e) => ({ ...e }));
 		},
-		async createCollection({ name: e, parentId: r = "", restricted: i = !1 }) {
-			let a = E(e, "a Collection's name", 200);
-			if (r !== "" && Y(r), i && F === "workspace") throw new n(D);
-			if (ze(r, a)) throw new t(a);
-			let o = {
+		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);
+			let a = {
 				id: `col_stub_${H++}`,
-				name: a,
-				parentId: r,
-				restricted: i
+				name: i,
+				parentId: t,
+				restricted: r
 			};
-			return w.push(o), i && L.set(o.id, [{
-				userId: y,
+			return T.push(a), r && R.set(a.id, [{
+				userId: b,
 				level: "owner"
-			}]), { ...o };
+			}]), { ...a };
 		},
-		async renameCollection({ id: e, name: n }) {
-			let r = E(n, "a Collection's name", 200), i = Y(e);
-			if (ze(i.parentId, r, e)) throw new t(r);
-			return i.name = r, { ...i };
+		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 };
 		},
-		async moveCollection({ id: e, parentId: n }) {
-			let r = Y(e);
-			for (let t = n; t !== ""; t = Y(t).parentId) if (t === e) throw new i(`Collection ${e} can't move under itself or a Collection under it`);
-			if (ze(n, r.name, e)) throw new t("");
-			return r.parentId = n, { ...r };
+		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 };
 		},
 		async removeCollection({ id: e }) {
-			if (Y(e), w.some((t) => t.parentId === e)) throw new i(`Collection ${e} has Collections under it: remove or move those first`);
-			w.splice(w.findIndex((t) => t.id === e), 1), L.delete(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);
 			let t = [];
-			for (let n of T) n.collectionIds.includes(e) && (n.collectionIds = n.collectionIds.filter((t) => t !== e), t.push(n.id));
+			for (let n of D) 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 && F === "workspace") throw new n(D);
-			let a = Y(e);
-			if (a.restricted === t) return { ...a };
-			if (!t && !r) throw new i(`unrestricting Collection ${e} discloses its Content to every viewer: confirm it with acknowledge_disclosure`);
-			return a.restricted = t, t ? L.set(e, [{
-				userId: y,
+			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, [{
+				userId: b,
 				level: "owner"
-			}]) : L.delete(e), { ...a };
+			}]) : R.delete(e), { ...i };
 		},
 		async listCollectionGrants(e) {
-			return Be(e), structuredClone(L.get(e) ?? []).sort((e, t) => e.userId < t.userId ? -1 : +(e.userId > t.userId));
+			return Ve(e), structuredClone(R.get(e) ?? []).sort((e, t) => e.userId < t.userId ? -1 : +(e.userId > t.userId));
 		},
 		async grantCollectionAccess({ collectionId: e, userId: t, level: n }) {
-			if (Be(e), n !== "viewer" && n !== "editor") throw new i("a grant is viewer or editor");
-			if (!Te.includes(t)) throw new i(`${t} is not a member of the workspace`);
-			let r = L.get(e) ?? [];
-			r.some((e) => e.level === "owner" && e.userId === t) || L.set(e, [...r.filter((e) => e.userId !== t), {
+			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), {
 				userId: t,
 				level: n
 			}]);
 		},
 		async revokeCollectionAccess({ collectionId: e, userId: t }) {
-			Be(e), L.set(e, (L.get(e) ?? []).filter((e) => e.userId !== t || e.level === "owner"));
+			Ve(e), R.set(e, (R.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 i("filter.search: Editor Search covers Main and open Branch heads, never Releases");
-			if ([...n].length > 200) throw new i("filter.search is at most 200 characters");
-			if (e.collectionId && !w.some((t) => t.id === e.collectionId)) throw O("Collection", e.collectionId);
+			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 (e.collectionId && !T.some((t) => t.id === e.collectionId)) throw k("Collection", e.collectionId);
 			t.kind === "change_set" && X(t.changeSetId);
-			let r = T.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)), a = Math.min(e.pageSize || 50, 200), o = e.pageToken ? Number(e.pageToken) : 0;
+			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;
 			return {
-				contents: r.slice(o, o + a),
-				nextPageToken: o + a < r.length ? String(o + a) : ""
+				contents: r.slice(o, o + i),
+				nextPageToken: o + i < r.length ? String(o + 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 : T.find((e) => e.inForce?.releaseId === n.releaseId)?.inForce?.revisionId, r = T.find((t) => e && q(t, e));
-				if (!r || !e) throw O("copy source", JSON.stringify(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));
+				if (!r || !e) throw k("copy source", JSON.stringify(n));
 				i = structuredClone(q(r, e) ?? {}), a = t || r.blueprintReleaseId;
 			}
-			let o = j.find((e) => e.id === a);
-			if (!o) throw new g(`Blueprint Release ${a} can't be loaded`, [{
+			let o = M.find((e) => e.id === a);
+			if (!o) throw new _(`Blueprint Release ${a} can't be loaded`, [{
 				source: "contenthub",
 				code: "release_not_found",
 				path: ""
 			}]);
-			if (o.refusals?.length) throw new g(`Blueprint Release ${a} can't be loaded`, o.refusals.map((e) => ({ ...e })));
+			if (o.refusals?.length) throw new _(`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 T.push({
+			return D.push({
 				id: c,
 				blueprintId: o.blueprintId,
 				blueprintReleaseId: a,
@@ -1342,7 +1352,7 @@ function j(_ = {}) {
 					branchId: l,
 					revisionId: u,
 					data: i,
-					revisionCreateTime: v()
+					revisionCreateTime: y()
 				} }
 			}), r.chains.push({
 				id: `chain_stub_${s}`,
@@ -1362,30 +1372,30 @@ function j(_ = {}) {
 				data: structuredClone(i),
 				changeSetId: e,
 				branchId: l,
-				revisionCreateTime: v(),
+				revisionCreateTime: y(),
 				releaseId: ""
 			};
 		},
 		async saveRevision({ idempotencyKey: e, ...t }) {
-			if (!e) return He(t);
-			let n = JSON.stringify(t), r = Me.get(e);
+			if (!e) return Ue(t);
+			let n = JSON.stringify(t), r = Ne.get(e);
 			if (r) {
-				if (r.asked !== n) throw new i(`idempotency key ${e} names another save`);
+				if (r.asked !== n) throw new a(`idempotency key ${e} names another save`);
 				return structuredClone(r.content);
 			}
-			let a = await He(t);
-			return Me.set(e, {
+			let i = await Ue(t);
+			return Ne.set(e, {
 				asked: n,
-				content: structuredClone(a)
-			}), a;
+				content: structuredClone(i)
+			}), i;
 		},
 		async getContent({ id: e, changeSetId: t }) {
 			let n = U(e), [r] = $(n, t ? {
 				kind: "change_set",
 				changeSetId: t
 			} : { kind: "main" }, "");
-			if (!r) throw O("Content", e);
-			let i = N[n.blueprintReleaseId];
+			if (!r) throw k("Content", e);
+			let i = P[n.blueprintReleaseId];
 			return {
 				content: r,
 				blueprintRelease: i ? structuredClone(i) : void 0,
@@ -1393,7 +1403,7 @@ function j(_ = {}) {
 			};
 		},
 		async getTimeline(e) {
-			let t = U(e), n = (e) => C.find((t) => t.id === e)?.state === "open";
+			let t = U(e), n = (e) => w.find((t) => t.id === e)?.state === "open";
 			return structuredClone({
 				entries: t.timeline ?? [],
 				plannedReleases: (t.plannedReleases ?? []).filter((e) => n(e.changeSetId))
@@ -1403,11 +1413,11 @@ function j(_ = {}) {
 			let r;
 			if ("contentId" in e) {
 				let t = U(e.contentId);
-				if (!t.main) throw O("Content", e.contentId);
+				if (!t.main) throw k("Content", e.contentId);
 				r = K(t);
 			} else {
-				let t = T.find((t) => K(t).some((t) => t.branchId === e.branchId));
-				if (!t) throw O("Branch", e.branchId);
+				let t = D.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 i = Math.min(t || 50, 200), a = n ? Number(n) : 0;
@@ -1417,17 +1427,17 @@ function j(_ = {}) {
 			};
 		},
 		async compare({ revisionId: e, base: t }) {
-			let n = T.find((t) => K(t).some((t) => t.id === e));
-			if (!n) throw O("Revision", e);
-			let r = K(n), a = r.find((t) => t.id === e), o;
+			let n = D.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;
 			else if (t.kind === "main_head") {
-				if (!n.main) throw new i("the Content is not published: it has no Main Branch");
+				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 O("Revision", o);
-			let c = q(n, a.id) ?? {}, l = q(n, s.id) ?? {}, u = [];
+			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({
 				path: `/${e}`,
 				kind: "changed",
@@ -1445,7 +1455,7 @@ function j(_ = {}) {
 			let d = ({ data: e, ...t }) => t;
 			return {
 				base: d(s),
-				revision: d(a),
+				revision: d(i),
 				changes: u
 			};
 		},
@@ -1460,14 +1470,14 @@ function j(_ = {}) {
 					referrers: e.slice(i, i + t),
 					nextPageToken: i + t < e.length ? String(i + t) : ""
 				};
-			}, a = T.flatMap((t) => (t.edges ?? []).filter((n) => n.targetContentId === e && t.inForce?.revisionId === n.sourceRevisionId).map((e) => ({
+			}, a = D.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 = T.flatMap((t) => Object.entries(t.branches).flatMap(([n, r]) => C.find((e) => e.id === n)?.state === "open" ? (t.edges ?? []).filter((t) => t.targetContentId === e && t.sourceRevisionId === r.revisionId).map((e) => ({
+			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) => ({
 				edge: { ...e },
 				releaseId: "",
 				changeSetId: n,
@@ -1479,14 +1489,14 @@ function j(_ = {}) {
 			let t;
 			if ("revisionId" in e) t = e.revisionId;
 			else {
-				for (let n of T) {
+				for (let n of D) {
 					let r = Object.values(n.branches).find((t) => t.branchId === e.branchId);
 					r && (t = r.revisionId);
 				}
-				if (!t) throw O("Branch", e.branchId);
+				if (!t) throw k("Branch", e.branchId);
 			}
-			return T.flatMap((e) => (e.edges ?? []).filter((e) => e.sourceRevisionId === t)).filter((e) => e.pinReleaseId !== "").flatMap((e) => {
-				let t = T.find((t) => t.id === e.targetContentId)?.inForce?.releaseId ?? "";
+			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 t === e.pinReleaseId ? [] : [{
 					edge: { ...e },
 					supersededByReleaseId: t,
@@ -1496,25 +1506,25 @@ function j(_ = {}) {
 		},
 		async setContentCollections({ contentId: e, collectionIds: t }) {
 			let n = U(e), r = [...new Set(t)];
-			if (r.length > 100) throw new i("at most 100 Collections");
-			for (let e of r) if (!w.some((t) => t.id === e)) throw O("Collection", e);
+			if (r.length > 100) throw new a("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 i("each assignee is given once");
-			if (t.length > 50) throw new i("at most 50 assignees");
+			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");
 			return n.assigneeIds = [...t], W(n);
 		},
 		async blockContent({ contentId: e, blockReasonId: t, allowedUserIds: n }) {
 			let r = U(e);
-			if (!S.some((e) => e.id === t)) throw O("Block Reason", t);
-			if (new Set(n).size !== n.length) throw new i("each allowed user is given once");
+			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");
 			return r.block = {
 				blockReasonId: t,
 				allowedUserIds: [...n],
-				blockedBy: y,
-				blockTime: v()
+				blockedBy: b,
+				blockTime: y()
 			}, W(r);
 		},
 		async unblockContent(e) {
@@ -1524,42 +1534,42 @@ function j(_ = {}) {
 		async archiveContent(e) {
 			let t = U(e);
 			if (t.archiveTime) return W(t);
-			if (!t.main) throw new i(`Content ${e} is not published: discard its Change Set instead of archiving it`);
-			if (u(t.timeline ?? [], Ne())) throw new i(`Content ${e} has a Release In Force today or later: end its force first`);
-			return t.archiveTime = v(), 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`);
+			return t.archiveTime = y(), W(t);
 		},
 		async unarchiveContent(e) {
 			let t = U(e);
 			return t.archiveTime = void 0, W(t);
 		},
 		async startEditing({ contentId: e, changeSetId: t, effectiveOn: n = "", changeSetName: r = "" }) {
-			let a = U(e);
-			if (!a.main) throw new i(`Content ${e} is not published`);
-			if (J(a), G(a) && !h.test(n)) throw new i("effective_on is required for Dated Content, as YYYY-MM-DD");
-			if (!G(a) && n !== "") throw new i("effective_on is refused for undated Content");
+			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 (t) {
-				if (o = Z(t), o.chains.some((t) => t.contentId === e)) throw new i(`Content ${e} already has a Chain in this Change Set`);
+				if (o = Z(t), o.chains.some((t) => t.contentId === e)) throw new a(`Content ${e} already has a Chain in this Change Set`);
 			} else {
-				let t = Object.values(a.main.data).filter((e) => typeof e == "string").slice(0, 2).join(" ");
+				let t = Object.values(i.main.data).filter((e) => typeof e == "string").slice(0, 2).join(" ");
 				o = {
 					id: `cs_stub_${H++}`,
-					name: r.trim() ? E(r, "change_set_name", 200) : t || e,
+					name: r.trim() ? O(r, "change_set_name", 200) : t || e,
 					state: "open",
-					createdBy: y,
-					createTime: v(),
+					createdBy: b,
+					createTime: y(),
 					chains: [],
 					dependsOnChangeSetIds: [],
 					status: "",
 					assigneeIds: [],
 					plannedReleases: []
-				}, C.unshift(o);
+				}, w.unshift(o);
 			}
 			let s = H++, c = `br_stub_${s}`, l = {
-				...structuredClone(a.main),
+				...structuredClone(i.main),
 				branchId: c
 			};
-			a.branches[o.id] = l, o.chains.push({
+			i.branches[o.id] = l, o.chains.push({
 				id: `chain_stub_${s}`,
 				contentId: e,
 				born: !1,
@@ -1570,22 +1580,22 @@ function j(_ = {}) {
 					headRevisionId: l.revisionId
 				}]
 			});
-			let [u] = $(a, {
+			let [u] = $(i, {
 				kind: "change_set",
 				changeSetId: o.id
 			}, "");
 			return {
-				changeSet: k(o),
+				changeSet: A(o),
 				content: u
 			};
 		},
 		async previewChain({ changeSetId: e, contentId: t, effectiveOn: n, validityPeriod: r }) {
 			Z(e);
-			let a = U(t);
-			if (!a.main) throw new i(`Content ${t} is not published`);
-			if (!G(a)) throw new i("undated Content's Chain takes no date");
-			if (!h.test(n)) throw new i("effective_on is YYYY-MM-DD");
-			let o = a.timeline ?? [], s = o.find((e) => e.validityPeriod && e.validityPeriod.firstDay <= n && (e.validityPeriod.lastDay === "" || n <= e.validityPeriod.lastDay));
+			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));
 			return {
 				forkReleaseId: s?.releaseId ?? "",
 				carryForwardReleaseIds: o.filter((e) => e.validityPeriod && e.validityPeriod.firstDay > n).map((e) => e.releaseId),
@@ -1597,12 +1607,12 @@ function j(_ = {}) {
 		async planRepeal({ changeSetId: e, contentId: t, lastDay: n }) {
 			Z(e);
 			let r = U(t);
-			if (J(r), !G(r)) throw new i("a Repeal is for Dated Content");
-			if (!h.test(n)) throw new i("last_day is YYYY-MM-DD");
-			return nt(r, e, {
+			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, {
 				kind: "repeal",
 				validityPeriod: {
-					firstDay: m(r.timeline ?? [], n)?.validityPeriod?.firstDay ?? n,
+					firstDay: ee(r.timeline ?? [], n)?.validityPeriod?.firstDay ?? n,
 					lastDay: n
 				}
 			});
@@ -1610,14 +1620,14 @@ function j(_ = {}) {
 		async planWithdrawal({ changeSetId: e, contentId: t }) {
 			Z(e);
 			let n = U(t);
-			if (J(n), G(n)) throw new i("a Withdrawal is for undated Content");
-			return nt(n, e, { kind: "withdrawal" });
+			if (J(n), G(n)) throw new a("a Withdrawal is for undated Content");
+			return rt(n, e, { kind: "withdrawal" });
 		},
 		async planRelease({ idempotencyKey: e, ...t }) {
 			return V(e, ["planRelease", t], async () => {
-				let { changeSetId: e, branchId: n, validityPeriod: r, releaseSpec: a, supersedesReleaseIds: o } = t, { cs: s, chain: c, branch: l, c: u } = We(e, n);
-				if (J(u), l.kind !== "editorial") throw new i("only an editorial Branch's head is released");
-				if (s.plannedReleases.some((e) => e.branchId === n)) throw new i(`Branch ${n} is planned already`);
+				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 = {
 					id: `rls_stub_${H++}`,
 					contentId: c.contentId,
@@ -1625,41 +1635,41 @@ function j(_ = {}) {
 					branchId: n,
 					revisionId: "",
 					validityPeriod: r ? { ...r } : void 0,
-					releaseSpec: structuredClone(a ?? {}),
+					releaseSpec: structuredClone(i ?? {}),
 					supersedesReleaseIds: [...o ?? []],
 					proposed: !1,
 					proposedForReleaseId: "",
 					splitFromReleaseId: "",
 					withheld: !1
 				};
-				return qe(u, d), s.plannedReleases.push(d), Je(s, u), structuredClone(d);
+				return Je(u, d), s.plannedReleases.push(d), Ye(s, u), structuredClone(d);
 			});
 		},
 		async updatePlannedRelease({ idempotencyKey: e, ...t }) {
 			return V(e, ["updatePlannedRelease", t], async () => {
-				let { changeSetId: e, plannedReleaseId: n, validityPeriod: r, releaseSpec: a, supersedesReleaseIds: o } = t, s = Z(e), c = s.plannedReleases.findIndex((e) => e.id === n);
-				if (c < 0) throw O("Planned Release", n);
+				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 i("a proposal is derived from the plans and can't be set");
+				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),
 					...r ? { validityPeriod: { ...r } } : {},
-					...a ? { releaseSpec: structuredClone(a) } : {},
+					...i ? { releaseSpec: structuredClone(i) } : {},
 					...o ? { supersedesReleaseIds: [...o] } : {}
 				};
-				return qe(u, d), s.plannedReleases[c] = d, Je(s, u), structuredClone(d);
+				return Je(u, d), s.plannedReleases[c] = d, Ye(s, u), structuredClone(d);
 			});
 		},
 		async appendBranch({ idempotencyKey: e, ...t }) {
 			return V(e, ["appendBranch", t], async () => {
-				let { changeSetId: e, chainId: n, effectiveOn: r } = t, a = Z(e), o = a.chains.find((e) => e.id === n);
-				if (!o) throw O("Chain", n);
+				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 i("only a Chain on published Dated Content takes dates");
+				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 i("effective_on is a day after the Chain's last editorial Branch's");
+				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,
@@ -1673,61 +1683,61 @@ function j(_ = {}) {
 					...d,
 					branchId: u
 				}), {
-					changeSet: k(a),
+					changeSet: A(i),
 					branchId: u
 				};
 			});
 		},
 		async dropChain({ idempotencyKey: e, ...t }) {
 			return V(e, ["dropChain", t], async () => {
-				let { changeSetId: e, chainId: n } = t, r = Z(e), a = r.chains.find((e) => e.id === n);
-				if (!a) throw O("Chain", n);
-				if (a.born) throw new i("the Chain of Content born in the Change Set can't be dropped: discard the Change Set");
-				for (let e of a.branches) Ke(e.id);
-				return r.chains = r.chains.filter((e) => e.id !== n), r.plannedReleases = r.plannedReleases.filter((e) => e.contentId !== a.contentId), delete U(a.contentId).branches[e], k(r);
+				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);
+				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);
 			});
 		},
 		async getPendingMerge(e) {
 			let t = B.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 } = We(e, n), l = B.get(n);
-				if (!l) throw new i(`Branch ${n} has no Pending Merge`);
-				if (s.headRevisionId !== r) throw new f({
-					contentId: c.id,
-					branchId: n,
-					expectedHeadId: r,
-					currentHeadId: s.headRevisionId
+		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
 				});
-				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 i("decide every field the Pending Merge lists, once");
-				let p = 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(/^\//, "");
+				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 m = Ue({
-					changeSetId: e,
-					chain: o,
-					branch: s,
-					c,
+				let m = We({
+					changeSetId: t,
+					chain: s,
+					branch: c,
+					c: l,
 					data: p,
 					cause: "resolve",
-					secondParentId: l.theirsRevisionId
+					secondParentId: u.theirsRevisionId
 				});
-				return Ke(n), m;
+				return qe(r), m;
 			});
 		},
 		async abortMerge({ idempotencyKey: e, ...t }) {
 			return V(e, ["abortMerge", t], async () => {
-				if (We(t.changeSetId, t.branchId), !B.has(t.branchId)) throw new i(`Branch ${t.branchId} has no Pending Merge`);
-				Ke(t.branchId);
+				if (Ge(t.changeSetId, t.branchId), !B.has(t.branchId)) throw new a(`Branch ${t.branchId} has no Pending Merge`);
+				qe(t.branchId);
 			});
 		},
 		async previewInForce({ contentId: e, changeSetId: t, validOn: n }) {
-			let r = Z(t), i = U(e), a = n || Ne(), 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 || 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));
 			if (c) {
 				let e = c.branchId ? o?.branches.find((e) => e.id === c.branchId)?.headRevisionId ?? "" : c.revisionId;
 				return {
@@ -1739,7 +1749,7 @@ function j(_ = {}) {
 					data: structuredClone(q(i, e) ?? {})
 				};
 			}
-			let l = m(i.timeline ?? [], a);
+			let l = ee(i.timeline ?? [], a);
 			return l ? {
 				releaseId: l.releaseId,
 				revisionId: l.revisionId,
@@ -1750,7 +1760,7 @@ function j(_ = {}) {
 			} : null;
 		}
 	};
-	function nt(e, t, n) {
+	function rt(e, t, n) {
 		let r = {
 			id: `rls_stub_${H++}`,
 			contentId: e.id,
@@ -1768,7 +1778,7 @@ function j(_ = {}) {
 			plannedRelease: r
 		}], structuredClone({
 			plannedRelease: r,
-			gapReferrers: Fe(e.id)
+			gapReferrers: Ie(e.id)
 		});
 	}
 	function $(e, t, n) {
@@ -1786,33 +1796,33 @@ function j(_ = {}) {
 		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 && !M(i.data, n) ? [] : [r(i, {
+			return !i || n && !N(i.data, n) ? [] : [r(i, {
 				changeSetId: t.changeSetId,
 				branchId: i.branchId
 			})];
 		}
 		if (!n) return e.main ? [r(e.main, {})] : [];
 		let i = [];
-		e.main && M(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)) C.find((e) => e.id === t)?.state === "open" && M(a.data, n) && i.push(r(a, {
+		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, {
 			changeSetId: t,
 			branchId: a.branchId
 		}));
 		return i;
 	}
 }
-function M(e, t) {
+function N(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 = se()) {
+function P(e = E()) {
 	return { async listChangeSetStatuses() {
 		return e.map((e) => ({ ...e }));
 	} };
 }
 //#endregion
-export { C as STUB_NOW, S as STUB_OTHER_USER_ID, x as STUB_USER_ID, b as STUB_WORKSPACE_ID, ge as createStubBlueprintSource, j as createStubContenthubClient, N as createStubStatusSource, oe as stubBlockReasons, A as stubBlocker, pe as stubBlueprintReleases, fe as stubBlueprints, se as stubChangeSetStatuses, le as stubChangeSets, de as stubCollections, he as stubContents, w as stubIdentity, T as stubRepealedContent, ue as stubRequiredChecks, me as stubResolvedReleases, ce as stubStatusTransitions };
+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 };
 
 //# sourceMappingURL=testing.js.map