@pgcorp/ui-kit 0.13.0 → 0.14.0

package/dist/src/components/shared/data-display/_internal/richDocumentTableValidation.js

@@ -0,0 +1,240 @@
+import { visitRichDocumentContent as e } from "./richDocumentTraversal.js";
+import { SEMANTIC_METADATA_FIELDS as t, S_RICH_DOCUMENT_MAX_NODES as n, assertFields as r, consumeRichNode as i, fail as a, leave as o, readArray as s, readEnum as c, readIdentity as l, readIdentityArray as u, readInteger as d, readLabel as f, readRecord as p, readSemanticMetadata as m } from "./richDocumentValidation.js";
+//#region src/components/shared/data-display/_internal/richDocumentTableValidation.ts
+var h = /* @__PURE__ */ new Set([
+	"type",
+	"cellId",
+	"headers",
+	"scope",
+	"rowSpan",
+	"colSpan",
+	"align",
+	"content",
+	"children",
+	...t
+]), g = /* @__PURE__ */ new Set(["cells", ...t]), _ = /* @__PURE__ */ new Set([
+	"row",
+	"col",
+	"rowgroup",
+	"colgroup"
+]);
+function v(t, s, f, g, v) {
+	i(s, f, g);
+	let y = p(t, s, f);
+	try {
+		r(y, s, h);
+		let t = c(y.type, `${s}.type`, /* @__PURE__ */ new Set(["header", "data"]));
+		t === "data" && y.scope !== void 0 && a("invalid_structure", `${s}.scope`, "scope is only valid on header cells");
+		let i = y.scope === void 0 ? void 0 : c(y.scope, `${s}.scope`, _), o = y.cellId === void 0 ? void 0 : l(y.cellId, `${s}.cellId`), p = y.headers === void 0 ? void 0 : u(y.headers, `${s}.headers`, f), b = y.rowSpan === void 0 ? void 0 : d(y.rowSpan, `${s}.rowSpan`, 0, n), x = y.colSpan === void 0 ? void 0 : d(y.colSpan, `${s}.colSpan`, 1, 100), S = y.align === void 0 ? void 0 : c(y.align, `${s}.align`, /* @__PURE__ */ new Set([
+			"left",
+			"center",
+			"right"
+		])), C = c(y.content, `${s}.content`, /* @__PURE__ */ new Set(["inline", "block"])), w = {
+			...m(y, s, f),
+			...o === void 0 ? {} : { cellId: o },
+			...p === void 0 ? {} : { headers: p },
+			...b === void 0 ? {} : { rowSpan: b },
+			...x === void 0 ? {} : { colSpan: x },
+			...S === void 0 ? {} : { align: S }
+		}, T = C === "inline" ? {
+			content: C,
+			children: v.inline(y.children, `${s}.children`, g + 1)
+		} : {
+			content: C,
+			children: v.block(y.children, `${s}.children`, g + 1)
+		};
+		return t === "header" && T.content === "block" && e(T.children, `${s}.children`, { node: (e, t) => {
+			(e.type === "heading" || e.type === "section" || e.type === "footnoteDefinition" || e.type === "callout" && e.tone === "neutral" && e.title !== void 0) && a("invalid_structure", t, "header cells cannot contain native heading or sectioning descendants, including shared compositions");
+		} }), Object.freeze(t === "header" ? {
+			...w,
+			type: t,
+			...i === void 0 ? {} : { scope: i },
+			...T
+		} : {
+			...w,
+			type: t,
+			...T
+		});
+	} finally {
+		o(t, f);
+	}
+}
+function y(e, t, a, c, l) {
+	let u = s(e, t, a, {
+		minimum: 0,
+		maximum: n
+	});
+	try {
+		return Object.freeze(u.map((e, n) => {
+			let u = `${t}[${n}]`;
+			i(u, a, c);
+			let d = p(e, u, a);
+			try {
+				r(d, u, g);
+				let e = s(d.cells, `${u}.cells`, a, {
+					minimum: 0,
+					maximum: 100
+				});
+				try {
+					return Object.freeze({
+						...m(d, u, a),
+						cells: Object.freeze(e.map((e, t) => v(e, `${u}.cells[${t}]`, a, c + 1, l)))
+					});
+				} finally {
+					o(d.cells, a);
+				}
+			} finally {
+				o(e, a);
+			}
+		}));
+	} finally {
+		o(e, a);
+	}
+}
+function b(e, t, n, r) {
+	let i = e.map(() => []);
+	for (let [n, o] of e.entries()) {
+		let s = 0;
+		for (let [c, l] of o.cells.entries()) {
+			let o = `${t}[${n}].cells[${c}]`;
+			for (; i[n]?.[s];) s += 1;
+			let u = l.rowSpan === 0 ? e.length - n : l.rowSpan ?? 1, d = l.colSpan ?? 1;
+			if (l.type === "header" && l.scope === "colgroup") {
+				let e = 0;
+				r?.some((t) => {
+					let n = e + t.span, r = s >= e && s + d <= n;
+					return e = n, r;
+				}) || a("invalid_structure", `${o}.scope`, "colgroup scope requires an explicit column group containing the complete header span");
+			}
+			n + u > e.length && a("invalid_structure", `${o}.rowSpan`, "rowSpan cannot extend beyond its row group"), s + d > 100 && a("limit_exceeded", `${o}.colSpan`, "table width cannot exceed 100 columns");
+			for (let e = n; e < n + u; e += 1) {
+				let t = i[e];
+				t === void 0 && a("invalid_structure", o, "row grid is unavailable");
+				for (let e = s; e < s + d; e += 1) t[e] && a("invalid_structure", o, "cell spans overlap"), t[e] = !0;
+			}
+			s += d;
+		}
+	}
+	let o = n;
+	for (let [e, n] of i.entries()) o === void 0 && (o = n.length), (n.length !== o || n.length === 0 || Array.from({ length: o }, (e, t) => n[t]).some((e) => e !== !0)) && a("invalid_structure", `${t}[${e}].cells`, "rows must form a complete rectangular grid with the same width in every row group");
+	return o;
+}
+function x(e) {
+	let t = [], n = /* @__PURE__ */ new Map();
+	for (let r of e) for (let [e, i] of r.rows.entries()) for (let [o, s] of i.cells.entries()) {
+		let i = {
+			cell: s,
+			path: `${r.path}[${e}].cells[${o}]`,
+			edges: []
+		};
+		if (t.push(i), s.cellId !== void 0) {
+			let e = n.get(s.cellId);
+			e !== void 0 && a("duplicate_id", `${i.path}.cellId`, `duplicate cell ID; first declared at ${e.path}.cellId`), n.set(s.cellId, i);
+		}
+	}
+	for (let e of t) {
+		let { cell: t, path: r } = e;
+		for (let [i, o] of (t.headers ?? []).entries()) {
+			let s = `${r}.headers[${i}]`, c = n.get(o);
+			c === void 0 && a("missing_resource", s, `header ${JSON.stringify(o)} is not declared in this table`), (c.cell.type !== "header" || c.cell === t) && a("invalid_structure", s, "headers must reference another header cell in this table"), e.edges.push({
+				target: c,
+				path: s
+			});
+		}
+	}
+	let r = /* @__PURE__ */ new Map();
+	for (let e of t) {
+		if (r.has(e)) continue;
+		let t = [{
+			location: e,
+			next: 0
+		}];
+		r.set(e, "active");
+		let n = t[t.length - 1];
+		for (; n !== void 0;) {
+			let e = n.location.edges[n.next];
+			if (e === void 0) r.set(n.location, "complete"), t.pop();
+			else {
+				n.next += 1;
+				let i = r.get(e.target);
+				i === "active" && a("invalid_structure", e.path, "header references cannot transitively target themselves"), i === void 0 && (r.set(e.target, "active"), t.push({
+					location: e.target,
+					next: 0
+				}));
+			}
+			n = t[t.length - 1];
+		}
+	}
+}
+function S(e, t, n, a) {
+	let c = s(e, t, n, {
+		minimum: 1,
+		maximum: 100
+	});
+	try {
+		return Object.freeze(c.map((e, s) => {
+			let c = `${t}[${s}]`;
+			i(c, n, a);
+			let l = p(e, c, n);
+			try {
+				return r(l, c, /* @__PURE__ */ new Set(["span"])), Object.freeze({ span: d(l.span, `${c}.span`, 1, 100) });
+			} finally {
+				o(e, n);
+			}
+		}));
+	} finally {
+		o(e, n);
+	}
+}
+function C(e, n, s, c, l) {
+	let u = e.columnGroups === void 0 ? void 0 : S(e.columnGroups, `${n}.columnGroups`, s, c + 1);
+	for (let t of [
+		"head",
+		"body",
+		"foot"
+	]) e[t] !== void 0 && i(`${n}.${t}`, s, c + 1);
+	let d = e.head === void 0 ? void 0 : y(e.head, `${n}.head`, s, c + 1, l), h = y(e.body, `${n}.body`, s, c + 1, l), g = e.foot === void 0 ? void 0 : y(e.foot, `${n}.foot`, s, c + 1, l), _ = [
+		...d === void 0 ? [] : [{
+			rows: d,
+			path: `${n}.head`
+		}],
+		{
+			rows: h,
+			path: `${n}.body`
+		},
+		...g === void 0 ? [] : [{
+			rows: g,
+			path: `${n}.foot`
+		}]
+	], v = u?.reduce((e, t) => e + t.span, 0);
+	v !== void 0 && v > 100 && a("limit_exceeded", `${n}.columnGroups`, "table width cannot exceed 100 columns");
+	for (let e of _) v = b(e.rows, e.path, v, u);
+	x(_);
+	let C = {};
+	for (let i of [
+		"headMetadata",
+		"bodyMetadata",
+		"footMetadata"
+	]) {
+		if (e[i] === void 0) continue;
+		(i === "headMetadata" && d === void 0 || i === "footMetadata" && g === void 0) && a("invalid_structure", `${n}.${i}`, "row-group metadata requires its row group");
+		let c = p(e[i], `${n}.${i}`, s);
+		try {
+			r(c, `${n}.${i}`, new Set(t)), Object.assign(C, { [i]: m(c, `${n}.${i}`, s) });
+		} finally {
+			o(e[i], s);
+		}
+	}
+	return Object.freeze({
+		type: "semanticTable",
+		label: f(e.label, `${n}.label`),
+		...u === void 0 ? {} : { columnGroups: u },
+		...e.caption === void 0 ? {} : { caption: l.inline(e.caption, `${n}.caption`, c + 1) },
+		...d === void 0 ? {} : { head: d },
+		body: h,
+		...g === void 0 ? {} : { foot: g },
+		...C
+	});
+}
+//#endregion
+export { C as validateSemanticTable };

package/dist/src/components/shared/data-display/_internal/richDocumentTraversal.d.ts

@@ -0,0 +1,15 @@
+import { SRichDocumentNode, SRichDocumentV1, SRichInlineNode, SRichSemanticMetadata } from './richDocumentTypes';
+export interface RichDocumentVisitor {
+    readonly node: (node: SRichDocumentNode, path: string) => void;
+    readonly metadata?: (metadata: SRichSemanticMetadata, path: string) => void;
+}
+/** Traverses a typed subtree at its declared source coordinate. */
+export declare function visitRichDocumentContent(nodes: readonly SRichDocumentNode[], path: string, visitor: RichDocumentVisitor): void;
+/** Traverses every typed content position once, including structural metadata owners. */
+export declare function visitRichDocument(document: SRichDocumentV1, visitor: RichDocumentVisitor): void;
+/** Visits semantic nodes using their exact serialized source path. */
+export declare function visitRichDocumentNodes(document: SRichDocumentV1, visitor: (node: SRichDocumentNode, path: string) => void): void;
+/** Classifies declared interactive owners independently of their current disabled state. */
+export declare function richNodeIsInteractiveOwner(node: SRichDocumentNode): boolean;
+/** Interactive inline owners require sibling disclosure composition, not nesting inside native summary. */
+export declare function richContentHasInteractiveOwners(nodes: readonly SRichInlineNode[]): boolean;

package/dist/src/components/shared/data-display/_internal/richDocumentTraversal.js

@@ -0,0 +1,61 @@
+//#region src/components/shared/data-display/_internal/richDocumentTraversal.ts
+function e(e, n, r) {
+	e.caption !== void 0 && t(e.caption, `${n}.caption`, r);
+	for (let i of [
+		"head",
+		"body",
+		"foot"
+	]) {
+		let a = `${i}Metadata`, o = e[a];
+		o !== void 0 && r.metadata?.(o, `${n}.${a}`);
+		let s = e[i];
+		if (s !== void 0) for (let [e, a] of s.entries()) {
+			let o = `${n}.${i}[${e}]`;
+			r.metadata?.(a, o);
+			for (let [e, n] of a.cells.entries()) {
+				let i = `${o}.cells[${e}]`;
+				r.metadata?.(n, i), t(n.children, `${i}.children`, r);
+			}
+		}
+	}
+}
+function t(n, r, i) {
+	for (let [a, o] of n.entries()) {
+		let n = `${r}[${a}]`;
+		if (i.node(o, n), "children" in o && o.children !== void 0 && t(o.children, `${n}.children`, i), o.type === "image" && o.caption !== void 0 && t(o.caption, `${n}.caption`, i), o.type === "disclosure" && o.summaryChildren !== void 0 && t(o.summaryChildren, `${n}.summaryChildren`, i), o.type === "actionGroup" && t(o.actions, `${n}.actions`, i), o.type === "table") {
+			for (let [e, r] of o.columns.entries()) {
+				let a = `${n}.columns[${e}]`;
+				i.metadata?.(r, a), r.headerChildren !== void 0 && t(r.headerChildren, `${a}.headerChildren`, i);
+			}
+			for (let [e, r] of o.rows.entries()) {
+				let a = `${n}.rows[${e}]`;
+				i.metadata?.(r, a);
+				for (let [e, n] of r.cells.entries()) {
+					let r = `${a}.cells[${e}]`;
+					i.metadata?.(n, r), t(n.children, `${r}.children`, i);
+				}
+			}
+		}
+		if (o.type === "semanticTable" && e(o, n, i), o.type === "definitionList") for (let [e, r] of o.entries.entries()) for (let a of ["terms", "descriptions"]) for (let [o, s] of r[a].entries()) {
+			let r = `${n}.entries[${e}].${a}[${o}]`;
+			i.metadata?.(s, r), t(s.children, `${r}.children`, i);
+		}
+	}
+}
+function n(e, n) {
+	t(e.nodes, "document.nodes", n);
+}
+function r(e, t) {
+	n(e, { node: t });
+}
+function i(e) {
+	return e.type === "link" || e.type === "anchorLink" || e.type === "footnoteReference" || e.type === "footnoteBacklink" || e.type === "inlineCheckbox";
+}
+function a(e) {
+	let n = !1;
+	return t(e, "content", { node: (e) => {
+		i(e) && (n = !0);
+	} }), n;
+}
+//#endregion
+export { a as richContentHasInteractiveOwners, i as richNodeIsInteractiveOwner, n as visitRichDocument, t as visitRichDocumentContent, r as visitRichDocumentNodes };