@voltro/cms 0.85.0 → 0.87.0

package/dist/templates.js

@@ -0,0 +1,106 @@
+//#region src/templates.ts
+var e = (e) => Array.isArray(e) ? e.map((e) => typeof e == "object" && e ? String(e.componentId ?? "") : "") : [], t = (e, t) => {
+	let n = e.templates, r = n === void 0 ? void 0 : t[n.field];
+	if (n !== void 0 && typeof r == "string" && r !== "") return n.list.find((e) => e.id === r) ?? null;
+}, n = (n, i) => {
+	let a = n.templates, o = t(n, i);
+	if (a === void 0 || o === void 0) return [];
+	if (o === null) return [{
+		field: a.field,
+		rule: "unknown",
+		message: `no template '${String(i[a.field])}' for ${n.name}`
+	}];
+	let s = e(i[a.components]), c = [];
+	for (let e of o.required ?? []) s.includes(e.id) || c.push({
+		field: a.components,
+		rule: "required",
+		message: `the ${o.displayName} template needs a ${e.displayName}`
+	});
+	o.first !== void 0 && s.length > 0 && s[0] !== o.first.id && c.push({
+		field: a.components,
+		rule: "position",
+		message: `the ${o.displayName} template starts with a ${o.first.displayName}`
+	});
+	for (let e of o.max ?? []) s.filter((t) => t === e.component.id).length > e.count && c.push({
+		field: a.components,
+		rule: "max",
+		message: `the ${o.displayName} template allows at most ${e.count} ${e.component.displayName}`
+	});
+	for (let [t, r] of Object.entries(o.regions ?? {})) {
+		let a = e(i[t]), s = r.allowed === void 0 ? void 0 : new Set(r.allowed.map((e) => e.id)), l = new Map((n.fields[t]?.components ?? []).map((e) => [e.id, e.displayName]));
+		for (let e of new Set(a)) s !== void 0 && !s.has(e) && c.push({
+			field: t,
+			rule: "region",
+			message: `the ${o.displayName} template does not allow a ${l.get(e) ?? e} in ${t}`
+		});
+		for (let e of r.required ?? []) a.includes(e.id) || c.push({
+			field: t,
+			rule: "required",
+			message: `the ${o.displayName} template needs a ${e.displayName} in ${t}`
+		});
+		r.maxItems !== void 0 && a.length > r.maxItems && c.push({
+			field: t,
+			rule: "max",
+			message: `the ${o.displayName} template allows at most ${r.maxItems} in ${t}`
+		});
+	}
+	let l = a.width ?? "width", u = [a.components, ...Object.keys(o.regions ?? {})].flatMap((e) => (Array.isArray(i[e]) ? i[e] : []).map((t, n) => ({
+		field: e,
+		index: n,
+		item: t
+	})));
+	for (let e of o.widths ?? []) for (let { field: t, index: n, item: r } of u) {
+		let i = r?.props?.[l];
+		r?.componentId === e.component.id && typeof i == "string" && !e.allowed.includes(i) && c.push({
+			field: `${t}[${n}].props.${l}`,
+			rule: "width",
+			message: `in the ${o.displayName} template a ${e.component.displayName} is ${e.allowed.join(" or ")}, not ${i}`
+		});
+	}
+	if (o.maxDepth !== void 0) for (let { field: e, index: t, item: n } of u) r(n) > o.maxDepth && c.push({
+		field: `${e}[${t}]`,
+		rule: "depth",
+		message: `the ${o.displayName} template nests components at most ${o.maxDepth} deep`
+	});
+	return c;
+}, r = (e) => {
+	let t = Object.values(e?.props ?? {}).filter((e) => Array.isArray(e) && e.some((e) => typeof e == "object" && !!e && typeof e.componentId == "string"));
+	return 1 + Math.max(0, ...t.flatMap((e) => e.map(r)));
+}, i = (e, t) => {
+	let n = e.templates, r = n?.list.find((e) => e.id === t);
+	return n === void 0 || r === void 0 ? null : {
+		...r.values,
+		[n.field]: r.id,
+		[n.components]: (r.sections ?? []).map((e) => ({
+			componentId: e.component.id,
+			props: { ...e.props }
+		}))
+	};
+}, a = (e, t, n) => {
+	let r = (t) => {
+		throw Error(`defineContentType('${e}'): templates ${t}`);
+	}, i = t[n.field];
+	(i === void 0 || i.kind !== "string" || !i.isOptional) && r(`field '${n.field}' must be a declared optional string field.`);
+	let a = t[n.components];
+	(a === void 0 || a.kind !== "components") && r(`components '${n.components}' must be a declared Schema.Components field.`);
+	let o = new Set((a?.components ?? []).map((e) => e.id)), s = /* @__PURE__ */ new Set();
+	for (let e of n.list) {
+		s.has(e.id) && r(`id '${e.id}' is declared twice.`), s.add(e.id);
+		let i = [
+			...(e.sections ?? []).map((e) => e.component),
+			...e.required ?? [],
+			...e.first ? [e.first] : [],
+			...(e.max ?? []).map((e) => e.component)
+		];
+		for (let t of i) o.has(t.id) || r(`'${e.id}' uses '${t.id}', which '${n.components}' does not allow.`);
+		for (let [i, a] of Object.entries(e.regions ?? {})) {
+			let o = t[i];
+			(o === void 0 || o.kind !== "components" || i === n.components) && r(`'${e.id}' region '${i}' must be another declared Schema.Components field.`);
+			let s = new Set((o?.components ?? []).map((e) => e.id));
+			for (let t of [...a.allowed ?? [], ...a.required ?? []]) s.has(t.id) || r(`'${e.id}' region '${i}' uses '${t.id}', which '${i}' does not allow.`);
+		}
+		e.maxDepth !== void 0 && (!Number.isInteger(e.maxDepth) || e.maxDepth < 1) && r(`'${e.id}' maxDepth must be a whole number from 1.`);
+	}
+};
+//#endregion
+export { a as checkTemplates, t as templateOf, i as templateValues, n as templateViolations };

package/dist/trackChanges.js

@@ -0,0 +1,197 @@
+import { newBlockId as e } from "./richDocument.js";
+import { inlineText as t, mergeInline as n, sliceInline as r } from "./richInline.js";
+//#region src/trackChanges.ts
+var i = (e, t) => e.map((e) => ({
+	...e,
+	change: t
+})), a = (e) => {
+	switch (e.type) {
+		case "paragraph":
+		case "heading": return [e.content];
+		case "list": return e.items;
+		case "table": return e.rows.flat();
+		case "image":
+		case "file":
+		case "component": return [];
+	}
+}, o = (e) => e.change !== void 0 || a(e).some((e) => e.some((e) => e.change !== void 0)), s = (e) => e.blocks.some(o), c = /[\p{L}\p{N}_]/u, l = (e, a, o) => {
+	let s = t(e), l = t(a);
+	if (s === l) return a;
+	let u = 0;
+	for (; u < s.length && u < l.length && s[u] === l[u];) u += 1;
+	let d = 0;
+	for (; d < s.length - u && d < l.length - u && s[s.length - 1 - d] === l[l.length - 1 - d];) d += 1;
+	for (; u > 0 && c.test(s[u - 1]);) --u;
+	for (; d > 0 && c.test(s[s.length - d]);) --d;
+	return n([
+		...r(a, 0, u),
+		...i(r(e, u, s.length - d), {
+			...o,
+			kind: "delete"
+		}),
+		...i(r(a, u, l.length - d), {
+			...o,
+			kind: "insert"
+		}),
+		...r(a, l.length - d, l.length)
+	]);
+}, u = (e, t, n) => Array.from({ length: Math.max(e.length, t.length) }, (r, a) => {
+	let o = e[a], s = t[a];
+	return o === void 0 ? i(s ?? [], {
+		...n,
+		kind: "insert"
+	}) : s === void 0 ? i(o, {
+		...n,
+		kind: "delete"
+	}) : l(o, s, n);
+}), d = (e, t) => JSON.stringify(e) === JSON.stringify(t), f = (e, t, n) => {
+	if ((e.type === "paragraph" || e.type === "heading") && t.type === e.type) return {
+		...t,
+		content: l(e.content, t.content, n)
+	};
+	if (e.type === "list" && t.type === "list") {
+		let r = u(e.items, t.items, n), i = r.map((n, r) => t.levels?.[r] ?? e.levels?.[r] ?? 0);
+		return {
+			...t,
+			items: r,
+			...i.some((e) => e > 0) ? { levels: i } : {}
+		};
+	}
+	if (e.type === "table" && t.type === "table") {
+		let r = Array.from({ length: Math.max(e.rows.length, t.rows.length) }, (r, i) => u(e.rows[i] ?? [], t.rows[i] ?? [], n));
+		return {
+			...t,
+			rows: r
+		};
+	}
+	return null;
+}, p = (t, n, r) => {
+	let i = new Map(t.blocks.map((e) => [e.id, e])), a = new Set(n.blocks.map((e) => e.id)), s = [], c = [];
+	for (let t of n.blocks) {
+		let n = i.get(t.id);
+		if (n === void 0) {
+			c.push({
+				...t,
+				change: {
+					...r,
+					kind: "insert"
+				}
+			});
+			continue;
+		}
+		if (d(n, t)) {
+			c.push(n);
+			continue;
+		}
+		if (o(n)) {
+			s.push(t.id), c.push(n);
+			continue;
+		}
+		let a = f(n, t, r);
+		a === null ? c.push({
+			...n,
+			change: {
+				...r,
+				kind: "delete"
+			}
+		}, {
+			...t,
+			id: e(),
+			change: {
+				...r,
+				kind: "insert"
+			}
+		}) : c.push(a);
+	}
+	return t.blocks.forEach((e, n) => {
+		if (a.has(e.id)) return;
+		let i = o(e) ? e : {
+			...e,
+			change: {
+				...r,
+				kind: "delete"
+			}
+		};
+		o(e) && s.push(e.id);
+		let l = t.blocks.slice(0, n).reverse().find((e) => c.some((t) => t.id === e.id)), u = l === void 0 ? 0 : c.findIndex((e) => e.id === l.id) + 1;
+		for (; u < c.length && c[u].change?.kind === "delete" && !a.has(c[u].id);) u += 1;
+		c.splice(u, 0, i);
+	}), {
+		document: {
+			...t,
+			blocks: c
+		},
+		conflicts: s
+	};
+}, m = (e, t) => {
+	if (e === void 0) return "keep";
+	let n = t(e);
+	return n === "keep" ? "keep" : n === "accept" == (e.kind === "insert") ? "unmark" : "drop";
+}, h = (e) => {
+	let { change: t, ...n } = e;
+	return n;
+}, g = (e, t) => n(e.flatMap((e) => {
+	let n = m(e.change, t);
+	return n === "drop" ? [] : [n === "unmark" ? h(e) : e];
+})), _ = (e, t) => t.length === 0 && e.length > 0 && e.every((e) => e.change !== void 0), v = (e, t) => ({
+	...e,
+	blocks: e.blocks.flatMap((e) => {
+		let n = m(e.change, t);
+		if (n === "drop") return [];
+		let r = n === "unmark" ? h(e) : e;
+		switch (r.type) {
+			case "paragraph":
+			case "heading": return [{
+				...r,
+				content: g(r.content, t)
+			}];
+			case "list": {
+				let e = r.items.map((e) => g(e, t)), n = e.map((e, t) => !_(r.items[t], e)), i = r.levels?.filter((e, t) => n[t]);
+				return [{
+					...r,
+					items: e.filter((e, t) => n[t]),
+					...i === void 0 ? {} : { levels: i }
+				}];
+			}
+			case "table": {
+				let e = r.rows.map((e) => e.map((e) => g(e, t)));
+				return [{
+					...r,
+					rows: e.filter((e, t) => !e.every((e, n) => _(r.rows[t][n], e)))
+				}];
+			}
+			case "image":
+			case "file":
+			case "component": return [r];
+		}
+	})
+}), y = (e) => {
+	let n = /* @__PURE__ */ new Map(), r = (e, t) => {
+		let r = n.get(e.id) ?? {
+			id: e.id,
+			by: e.by,
+			at: e.at,
+			blockIds: [],
+			inserted: "",
+			deleted: "",
+			blocks: 0
+		};
+		return r.blockIds.includes(t) || r.blockIds.push(t), n.set(e.id, r), r;
+	};
+	for (let n of e.blocks) {
+		if (n.change !== void 0) {
+			let e = r(n.change, n.id);
+			e.blocks += 1;
+			let i = a(n).map(t).join(" ");
+			n.change.kind === "insert" ? e.inserted += i : e.deleted += i;
+		}
+		for (let e of a(n)) for (let t of e) {
+			if (t.change === void 0) continue;
+			let e = r(t.change, n.id);
+			t.change.kind === "insert" ? e.inserted += t.text : e.deleted += t.text;
+		}
+	}
+	return [...n.values()];
+};
+//#endregion
+export { o as blockHasChanges, s as documentHasChanges, y as pendingChanges, v as resolveChanges, p as trackChanges, l as trackInline };

package/dist/translation.js

@@ -0,0 +1,64 @@
+import { asTyped as e } from "./effectForm.js";
+import { CMS_REVISIONS_TABLE as t } from "./contentType.js";
+import { changedFields as n } from "./history.js";
+import { and as r, eq as i, inSet as a } from "@voltro/database";
+//#region src/translation.ts
+var o = (e, t, n) => e.query({
+	table: t,
+	predicate: n,
+	order: [],
+	take: void 0,
+	skip: void 0,
+	projection: void 0
+}), s = 500, c = async (e, t, n, i, ...c) => {
+	let l = [];
+	for (let u = 0; u < i.length; u += s) l.push(...await o(e, t, r(a(n, i.slice(u, u + s)), ...c)));
+	return l;
+}, l = async (e, t, n, r, i, a) => (await u(e, t, [n], r, i, a)).get(n), u = async (e, r, a, o, s, l) => {
+	let u = [...new Set(a)], d = await c(e, `${r.name}_drafts`, "documentId", u, i("site", o.site), i("environment", o.environment)), f = /* @__PURE__ */ new Map();
+	for (let e of d) {
+		let t = String(e.documentId);
+		f.set(t, (f.get(t) ?? /* @__PURE__ */ new Map()).set(String(e.locale), e));
+	}
+	let p = await c(e, t, "id", [...new Set(d.map((e) => String(e.revisionId)))]), m = new Map(p.map((e) => [String(e.id), e])), h = [...new Set(p.map((e) => e.basedOn).filter((e) => typeof e == "string"))], g = new Map((await c(e, t, "id", h)).map((e) => [String(e.id), e])), _ = (e) => {
+		let t = e.get(s), i = t === void 0 ? void 0 : m.get(String(t.revisionId)), a = l.filter((e) => e !== s).map((a) => {
+			let o = e.get(a);
+			if (o === void 0) return {
+				locale: a,
+				state: "missing",
+				variantId: null,
+				changed: []
+			};
+			let s = String(o.id), c = m.get(String(o.revisionId))?.basedOn;
+			if (typeof c != "string" || t === void 0) return {
+				locale: a,
+				state: "unknown",
+				variantId: s,
+				changed: []
+			};
+			if (c === t.revisionId) return {
+				locale: a,
+				state: "upToDate",
+				variantId: s,
+				changed: []
+			};
+			let l = g.get(c);
+			return {
+				locale: a,
+				state: "outdated",
+				variantId: s,
+				changed: l === void 0 || i === void 0 ? [] : n(r.fields, l.values ?? {}, i.values ?? {})
+			};
+		});
+		return {
+			source: t === void 0 ? null : {
+				variantId: String(t.id),
+				revisionId: String(t.revisionId)
+			},
+			targets: a
+		};
+	};
+	return new Map(u.map((e) => [e, _(f.get(e) ?? /* @__PURE__ */ new Map())]));
+}, d = (...t) => e(() => l(...t)), f = (...t) => e(() => u(...t));
+//#endregion
+export { l as translationStatus, d as translationStatusEffect, u as translationStatuses, f as translationStatusesEffect };

package/dist/tree.js

@@ -0,0 +1,87 @@
+//#region src/tree.ts
+var e = (e, t) => {
+	let n = e[t.parent];
+	return typeof n == "string" && n !== "" ? n : null;
+}, t = (e, t) => {
+	let n = t.order === void 0 ? void 0 : e[t.order];
+	return typeof n == "number" && Number.isFinite(n) ? n : Infinity;
+}, n = (e, t) => {
+	let n = e[t.segment];
+	return typeof n == "string" ? n : "";
+}, r = (r, i) => {
+	let a = /* @__PURE__ */ new Map();
+	for (let e of r) {
+		let t = e.row.documentId;
+		typeof t == "string" && !a.has(t) && a.set(t, e);
+	}
+	let o = /* @__PURE__ */ new Map();
+	for (let t of a.values()) {
+		let n = e(t.row, i), r = o.get(n) ?? [];
+		r.push(t), o.set(n, r);
+	}
+	let s = (e, t) => e < t ? -1 : +(e > t), c = (e, r) => t(e.row, i) - t(r.row, i) || s(n(e.row, i), n(r.row, i)) || s(String(e.row.documentId), String(r.row.documentId)), l = [], u = /* @__PURE__ */ new Set(), d = (e, t) => {
+		for (let r of [...o.get(e) ?? []].sort(c)) {
+			let a = r.row.documentId, o = n(r.row, i);
+			if (o === "" || u.has(a)) continue;
+			u.add(a);
+			let s = [...t, o];
+			l.push({
+				documentId: a,
+				parent: e,
+				depth: t.length,
+				segments: s,
+				path: s.join("/"),
+				row: r.row,
+				locale: r.locale,
+				fallback: r.fallback
+			}), d(a, s);
+		}
+	};
+	return d(null, []), {
+		nodes: l,
+		orphans: [...a.keys()].filter((e) => !u.has(e)).sort()
+	};
+}, i = (e) => e != null && e !== "", a = (e, t, n, r = {}) => {
+	let a = new Map(e.nodes.map((e) => [e.documentId, e])), o = r.ancestorsOnly === !0 ? t.parent === null ? void 0 : a.get(t.parent) : t, s = /* @__PURE__ */ new Set();
+	for (; o !== void 0 && !s.has(o.documentId);) {
+		if (s.add(o.documentId), i(o.row[n])) return {
+			value: o.row[n],
+			from: o.documentId,
+			how: o.documentId === t.documentId ? "own" : "ancestor"
+		};
+		if (r.mask !== void 0 && o.row[r.mask] === !0) return {
+			value: void 0,
+			from: o.documentId,
+			how: "masked"
+		};
+		o = o.parent === null ? void 0 : a.get(o.parent);
+	}
+	return {
+		value: void 0,
+		from: null,
+		how: "none"
+	};
+}, o = (e, t, n) => {
+	let r = t.nodes.some((e) => e.documentId === n.documentId) ? {
+		...t,
+		nodes: t.nodes.map((e) => e.documentId === n.documentId ? n : e)
+	} : {
+		...t,
+		nodes: [...t.nodes, n]
+	};
+	return Object.entries(e).map(([e, t]) => {
+		let i = t.mask === void 0 ? {} : { mask: t.mask };
+		return {
+			field: e,
+			locked: t.locked === !0,
+			mask: t.mask ?? null,
+			...a(r, n, e, i),
+			inherited: a(r, n, e, {
+				...i,
+				ancestorsOnly: !0
+			})
+		};
+	});
+};
+//#endregion
+export { r as buildTree, o as effectiveInheritance, a as inheritedValue };

package/dist/usage.js

@@ -0,0 +1,50 @@
+import { asTyped as e } from "./effectForm.js";
+import { and as t, eq as n, neq as r } from "@voltro/database";
+//#region src/usage.ts
+var i = async (e, i, a) => {
+	let o = {}, s = /* @__PURE__ */ new Set();
+	for (let c of i) {
+		let i = await e.query({
+			table: `${c.name}_drafts`,
+			predicate: t(n("site", a), r("status", "archived")),
+			order: [],
+			take: void 0,
+			skip: void 0,
+			projection: void 0,
+			groupBy: ["environment"],
+			aggregations: [{
+				op: "column",
+				column: "environment",
+				alias: "environment"
+			}, {
+				op: "count-distinct",
+				column: "documentId",
+				alias: "documents"
+			}]
+		});
+		if (i.length > 1) {
+			let [i] = await e.query({
+				table: `${c.name}_drafts`,
+				predicate: t(n("site", a), r("status", "archived")),
+				order: [],
+				take: void 0,
+				skip: void 0,
+				projection: void 0,
+				aggregations: [{
+					op: "count-distinct",
+					column: "documentId",
+					alias: "documents"
+				}]
+			});
+			o[c.name] = Number(i?.documents ?? 0);
+		} else o[c.name] = Number(i[0]?.documents ?? 0);
+		for (let e of i) s.add(String(e.environment));
+	}
+	return {
+		documents: Object.values(o).reduce((e, t) => e + t, 0),
+		documentsByType: o,
+		environments: [...s].sort()
+	};
+}, a = (...t) => e(() => i(...t));
+//#endregion
+export { i as contentUsage, a as contentUsageEffect };