@bettercms-ai/kit 1.0.0 → 2.0.0

package/{lib → dist/lib}/validate.js

@@ -1,7 +1,7 @@
-import { isObj, pathKey } from "./path.js";
 import { tableIssues } from "../schema/table.js";
+import { isObj, pathKey } from "./path.js";
 import { isEmptyValue, isHidden, itemSchemaFor, plainText, primitiveItem } from "./schema.js";
-//#region src/kit/lib/validate.ts
+//#region src/lib/validate.ts
 var textLength = (v) => plainText(v).length;
 var counted = (f) => f.type === "string" || f.type === "text" || f.type === "richtext";
 /** Validate one value against its field (not recursing into children). */
@@ -114,11 +114,50 @@ function validateValue(f, v) {
 	};
 	return null;
 }
+/**
+* What makes two values "the same" for `unique`, as the server judges a placement
+* (backend prop-fields tableProblem): a row's field compares text trimmed and case-folded, and
+* numbers; a list's items compare whole, strings case-folded, rows without their `_id` / `_key`.
+*/
+var cellKey = (v) => typeof v === "number" && Number.isFinite(v) ? String(v) : typeof v === "string" && v.trim() ? v.trim().toLocaleLowerCase("und") : null;
+var itemKey = (v) => {
+	if (typeof v === "string") return `s:${v.trim().toLocaleLowerCase("und")}`;
+	if (isObj(v)) {
+		const { _id: _i, _key: _k, ...rest } = v;
+		return `o:${JSON.stringify(Object.fromEntries(Object.entries(rest).sort(([a], [b]) => a.localeCompare(b))))}`;
+	}
+	return `j:${JSON.stringify(v)}`;
+};
+/** Indexes of the values whose key repeats one an earlier value already used. */
+function repeats(values, key) {
+	const seen = /* @__PURE__ */ new Set();
+	const out = [];
+	values.forEach((v, i) => {
+		const k = key(v);
+		if (k === null) return;
+		if (seen.has(k)) out.push(i);
+		else seen.add(k);
+	});
+	return out;
+}
+var shown = (v) => {
+	const s = typeof v === "string" ? v.trim() : String(v ?? "");
+	return s.length > 40 ? `${s.slice(0, 39)}…` : s;
+};
 /** Walk fields under `obj` and collect every issue, recursing into objects, array items and slot blocks. */
-function collectIssues(fields, obj, base, resolveSchema, out = []) {
+function collectIssues(fields, obj, base, resolveSchema, out = [], cc) {
 	const v = isObj(obj) ? obj : {};
+	const here = cc ?? {
+		root: v,
+		variant: typeof v._variant === "string" ? v._variant : void 0
+	};
+	const below = {
+		root: here.root,
+		parent: v,
+		variant: here.variant
+	};
 	for (const f of fields) {
-		if (isHidden(f, v)) continue;
+		if (isHidden(f, v, here)) continue;
 		const p = [...base, f.name];
 		const val = v[f.name];
 		const raw = validateValue(f, val);
@@ -127,14 +166,49 @@ function collectIssues(fields, obj, base, resolveSchema, out = []) {
 			key: pathKey(p),
 			path: p
 		});
-		if (f.type === "object" && f.fields) collectIssues(f.fields, val, p, resolveSchema, out);
-		if (f.type === "array" && Array.isArray(val) && !primitiveItem(f)) val.forEach((it, i) => {
-			const s = itemSchemaFor(f, it);
-			if (s?.fields) collectIssues(s.fields, it, [...p, i], resolveSchema, out);
-		});
+		if (f.type === "object" && f.fields) collectIssues(f.fields, val, p, resolveSchema, out, below);
+		if ((f.type === "array" || f.type === "tags" || f.type === "multiselect") && Array.isArray(val) && f.validation?.unique && !raw) {
+			const [r] = repeats(val, itemKey);
+			if (r !== void 0) out.push({
+				level: "error",
+				kind: "rule",
+				message: typeof val[r] === "string" ? `“${shown(val[r])}” is in the list twice. Each item can be added once.` : `Item ${r + 1} repeats an earlier item. Each item must be different.`,
+				key: pathKey(p),
+				path: p
+			});
+		}
+		if (f.type === "array" && Array.isArray(val) && !primitiveItem(f)) {
+			val.forEach((it, i) => {
+				const s = itemSchemaFor(f, it);
+				if (s?.fields) collectIssues(s.fields, it, [...p, i], resolveSchema, out, below);
+			});
+			const keys = /* @__PURE__ */ new Set();
+			for (const it of val) for (const x of itemSchemaFor(f, it)?.fields ?? []) if (x.validation?.unique) keys.add(x.name);
+			for (const k of keys) {
+				const vals = val.map((it) => isObj(it) ? it[k] : void 0);
+				for (const i of repeats(vals, cellKey)) {
+					const fp = [
+						...p,
+						i,
+						k
+					];
+					const title = itemSchemaFor(f, val[i])?.fields?.find((x) => x.name === k)?.title ?? k;
+					if (!out.some((x) => x.key === pathKey(fp))) out.push({
+						level: "error",
+						kind: "rule",
+						message: `${title} must be different on each item. “${shown(vals[i])}” is already used.`,
+						key: pathKey(fp),
+						path: fp
+					});
+				}
+			}
+		}
 		if (f.type === "slot" && Array.isArray(val) && resolveSchema) val.forEach((it, i) => {
 			const b = isObj(it) && typeof it._type === "string" ? resolveSchema(it._type) : void 0;
-			if (b) collectIssues(b.fields, it, [...p, i], resolveSchema, out);
+			if (b) collectIssues(b.fields, it, [...p, i], resolveSchema, out, {
+				root: it,
+				variant: isObj(it) && typeof it._variant === "string" ? it._variant : b.variants?.[0]?.id
+			});
 			if (f.slotSettings && isObj(it)) collectIssues(f.slotSettings, it._settings, [
 				...p,
 				i,
@@ -145,6 +219,6 @@ function collectIssues(fields, obj, base, resolveSchema, out = []) {
 	return out;
 }
 //#endregion
-export { collectIssues, textLength };
+export { collectIssues, textLength, validateValue };
 
 //# sourceMappingURL=validate.js.map

package/dist/lib/validate.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.js","names":[],"sources":["../../src/lib/validate.ts"],"sourcesContent":["/**\n * Validation — rules live in the schema (`validation`), messages state the rule in plain words.\n * Two kinds: \"required\" (shown after blur or a publish attempt) and \"rule\" (shown on blur too, never while\n * typing for the first time — the shell decides). Warnings (recommendedMax, missing alt) never block publish.\n */\nimport type { FieldPath, FieldSchema, TypeSchema } from \"../schema/types\";\nimport { isObj, pathKey } from \"./path\";\nimport { tableIssues } from \"../schema/table\";\nimport { isEmptyValue, isHidden, itemSchemaFor, plainText, primitiveItem, type CondCtx } from \"./schema\";\n\nexport interface KitIssue {\n  key: string;\n  path: FieldPath;\n  level: \"error\" | \"warning\";\n  kind: \"required\" | \"rule\";\n  message: string;\n  /** shown at once, even while the field is being typed in (a host's live check, e.g. the schema editor's help check) */\n  live?: boolean;\n  /** one fix the shell offers after the message (\"Clear help\") */\n  fix?: { label: string; apply: () => void };\n}\ntype Raw = Omit<KitIssue, \"key\" | \"path\">;\n\nexport const textLength = (v: unknown) => plainText(v).length;\nconst counted = (f: FieldSchema) => f.type === \"string\" || f.type === \"text\" || f.type === \"richtext\";\n\n/** Validate one value against its field (not recursing into children). */\nexport function validateValue(f: FieldSchema, v: unknown): Raw | null {\n  const r = f.validation ?? {};\n  const label = f.title;\n  if (r.required && isEmptyValue(v)) {\n    const msg =\n      f.type === \"image\" ? `Add an image for ${label.toLowerCase()}` :\n      f.type === \"reference\" ? `Choose ${label.toLowerCase()}` :\n      f.type === \"array\" || f.type === \"slot\" ? `Add at least one item to ${label.toLowerCase()}` :\n      `${label} is required`;\n    return { level: \"error\", kind: \"required\", message: msg };\n  }\n  if (isEmptyValue(v)) return null;\n\n  if (counted(f)) {\n    const n = textLength(v);\n    if (r.max && n > r.max) return { level: \"error\", kind: \"rule\", message: `Keep it under ${r.max} characters (${n - r.max} over)` };\n    if (r.min && n < r.min) return { level: \"error\", kind: \"rule\", message: `Use at least ${r.min} characters` };\n    if (r.recommendedMax && n > r.recommendedMax)\n      return { level: \"warning\", kind: \"rule\", message: `Longer than the recommended ${r.recommendedMax} characters. It may get cut off.` };\n  }\n  if ((f.type === \"array\" || f.type === \"slot\" || f.type === \"tags\" || f.type === \"multiselect\") && Array.isArray(v)) {\n    if (r.min && v.length < r.min) return { level: \"error\", kind: \"rule\", message: `Add at least ${r.min} ${r.min === 1 ? \"item\" : \"items\"}` };\n    if (r.max && v.length > r.max) return { level: \"error\", kind: \"rule\", message: `Use at most ${r.max} items` };\n  }\n  if (f.type === \"number\" && typeof v === \"number\") {\n    const lo = r.min ?? f.numeric?.min;\n    const hi = r.max ?? f.numeric?.max;\n    if (lo != null && v < lo) return { level: \"error\", kind: \"rule\", message: `Use ${lo} or more` };\n    if (hi != null && v > hi) return { level: \"error\", kind: \"rule\", message: `Use ${hi} or less` };\n  }\n  if (typeof v === \"string\") {\n    if (f.type === \"email\" && !/^[^\\s@]+@[^\\s@]+\\.[^\\s@]+$/.test(v)) return { level: \"error\", kind: \"rule\", message: \"Use a full email address, like hello@caldera.com\" };\n    if (f.type === \"url\" && !/^(https?:\\/\\/|\\/|#|mailto:|tel:)[^\\s]*$/.test(v)) return { level: \"error\", kind: \"rule\", message: \"Use a full URL, like https://example.com, or a path like /shop\" };\n    if (f.type === \"url\" && /^(javascript|data):/i.test(v)) return { level: \"error\", kind: \"rule\", message: \"This kind of link isn't allowed\" };\n    if (f.type === \"slug\" && !/^[a-z0-9]+(?:-[a-z0-9]+)*$/.test(v)) return { level: \"error\", kind: \"rule\", message: \"Use lowercase letters, numbers and hyphens\" };\n    if (f.type === \"json\") {\n      try {\n        JSON.parse(v);\n      } catch {\n        return { level: \"error\", kind: \"rule\", message: \"Invalid JSON\" };\n      }\n    }\n    if (r.pattern && !new RegExp(r.pattern).test(v)) return { level: \"error\", kind: \"rule\", message: r.patternMessage ?? \"This doesn't match the expected format\" };\n  }\n  if (f.type === \"table\") {\n    // caption, header labels, typed cells, row limits, markup readiness (src/schema/table.ts) — first error wins\n    const issues = tableIssues(v, { ...f.table, minRows: f.table?.minRows ?? r.min, maxRows: f.table?.maxRows ?? r.max });\n    const first = issues.find((i) => i.level === \"error\") ?? issues[0];\n    if (first) return { level: first.level, kind: \"rule\", message: first.message };\n  }\n  if (f.type === \"image\" && isObj(v) && v.url && !v.alt && r.required) return { level: \"warning\", kind: \"rule\", message: \"No alt text. Describe the image for accessibility.\" };\n  return null;\n}\n\n/**\n * What makes two values \"the same\" for `unique`, as the server judges a placement\n * (backend prop-fields tableProblem): a row's field compares text trimmed and case-folded, and\n * numbers; a list's items compare whole, strings case-folded, rows without their `_id` / `_key`.\n */\nconst cellKey = (v: unknown): string | null =>\n  typeof v === \"number\" && Number.isFinite(v) ? String(v) : typeof v === \"string\" && v.trim() ? v.trim().toLocaleLowerCase(\"und\") : null;\nconst itemKey = (v: unknown): string => {\n  if (typeof v === \"string\") return `s:${v.trim().toLocaleLowerCase(\"und\")}`;\n  if (isObj(v)) {\n    const { _id: _i, _key: _k, ...rest } = v;\n    return `o:${JSON.stringify(Object.fromEntries(Object.entries(rest).sort(([a], [b]) => a.localeCompare(b))))}`;\n  }\n  return `j:${JSON.stringify(v)}`;\n};\n/** Indexes of the values whose key repeats one an earlier value already used. */\nfunction repeats(values: unknown[], key: (v: unknown) => string | null): number[] {\n  const seen = new Set<string>();\n  const out: number[] = [];\n  values.forEach((v, i) => {\n    const k = key(v);\n    if (k === null) return;\n    if (seen.has(k)) out.push(i);\n    else seen.add(k);\n  });\n  return out;\n}\nconst shown = (v: unknown) => {\n  const s = typeof v === \"string\" ? v.trim() : String(v ?? \"\");\n  return s.length > 40 ? `${s.slice(0, 39)}…` : s;\n};\n\n/** Walk fields under `obj` and collect every issue, recursing into objects, array items and slot blocks. */\nexport function collectIssues(\n  fields: FieldSchema[],\n  obj: unknown,\n  base: FieldPath,\n  resolveSchema?: (t: string) => TypeSchema | undefined,\n  out: KitIssue[] = [],\n  /** what a `_variant` condition reads above this level (V2; the root call: the value itself) */\n  cc?: CondCtx,\n): KitIssue[] {\n  const v = isObj(obj) ? obj : {};\n  const here: CondCtx = cc ?? { root: v, variant: typeof v._variant === \"string\" ? v._variant : undefined };\n  const below: CondCtx = { root: here.root, parent: v, variant: here.variant };\n  for (const f of fields) {\n    if (isHidden(f, v, here)) continue;\n    const p = [...base, f.name];\n    const val = v[f.name];\n    const raw = validateValue(f, val);\n    if (raw) out.push({ ...raw, key: pathKey(p), path: p });\n    if (f.type === \"object\" && f.fields) collectIssues(f.fields, val, p, resolveSchema, out, below);\n    // A list's `unique`: no item twice (the first repeat is reported on the list).\n    if ((f.type === \"array\" || f.type === \"tags\" || f.type === \"multiselect\") && Array.isArray(val) && f.validation?.unique && !raw) {\n      const [r] = repeats(val, itemKey);\n      if (r !== undefined) out.push({ level: \"error\", kind: \"rule\", message: typeof val[r] === \"string\" ? `“${shown(val[r])}” is in the list twice. Each item can be added once.` : `Item ${r + 1} repeats an earlier item. Each item must be different.`, key: pathKey(p), path: p });\n    }\n    if (f.type === \"array\" && Array.isArray(val) && !primitiveItem(f)) {\n      val.forEach((it, i) => {\n        const s = itemSchemaFor(f, it);\n        if (s?.fields) collectIssues(s.fields, it, [...p, i], resolveSchema, out, below);\n      });\n      // A field inside the items with `unique`: no two items share its value.\n      const keys = new Set<string>();\n      for (const it of val) for (const x of itemSchemaFor(f, it)?.fields ?? []) if (x.validation?.unique) keys.add(x.name);\n      for (const k of keys) {\n        const vals = val.map((it) => (isObj(it) ? it[k] : undefined));\n        for (const i of repeats(vals, cellKey)) {\n          const fp = [...p, i, k];\n          const title = itemSchemaFor(f, val[i])?.fields?.find((x) => x.name === k)?.title ?? k;\n          if (!out.some((x) => x.key === pathKey(fp))) out.push({ level: \"error\", kind: \"rule\", message: `${title} must be different on each item. “${shown(vals[i])}” is already used.`, key: pathKey(fp), path: fp });\n        }\n      }\n    }\n    if (f.type === \"slot\" && Array.isArray(val) && resolveSchema) {\n      val.forEach((it, i) => {\n        const b = isObj(it) && typeof it._type === \"string\" ? resolveSchema(it._type) : undefined;\n        if (b) collectIssues(b.fields, it, [...p, i], resolveSchema, out, { root: it, variant: isObj(it) && typeof it._variant === \"string\" ? it._variant : b.variants?.[0]?.id });\n        if (f.slotSettings && isObj(it)) collectIssues(f.slotSettings, it._settings, [...p, i, \"_settings\"], resolveSchema, out);\n      });\n    }\n  }\n  return out;\n}\n"],"mappings":";;;;AAuBA,IAAa,cAAc,MAAe,UAAU,CAAC,CAAC,CAAC;AACvD,IAAM,WAAW,MAAmB,EAAE,SAAS,YAAY,EAAE,SAAS,UAAU,EAAE,SAAS;;AAG3F,SAAgB,cAAc,GAAgB,GAAwB;CACpE,MAAM,IAAI,EAAE,cAAc,CAAC;CAC3B,MAAM,QAAQ,EAAE;CAChB,IAAI,EAAE,YAAY,aAAa,CAAC,GAM9B,OAAO;EAAE,OAAO;EAAS,MAAM;EAAY,SAJzC,EAAE,SAAS,UAAU,oBAAoB,MAAM,YAAY,MAC3D,EAAE,SAAS,cAAc,UAAU,MAAM,YAAY,MACrD,EAAE,SAAS,WAAW,EAAE,SAAS,SAAS,4BAA4B,MAAM,YAAY,MACxF,GAAG,MAAM;CAC6C;CAE1D,IAAI,aAAa,CAAC,GAAG,OAAO;CAE5B,IAAI,QAAQ,CAAC,GAAG;EACd,MAAM,IAAI,WAAW,CAAC;EACtB,IAAI,EAAE,OAAO,IAAI,EAAE,KAAK,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,iBAAiB,EAAE,IAAI,eAAe,IAAI,EAAE,IAAI;EAAQ;EAChI,IAAI,EAAE,OAAO,IAAI,EAAE,KAAK,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,gBAAgB,EAAE,IAAI;EAAa;EAC3G,IAAI,EAAE,kBAAkB,IAAI,EAAE,gBAC5B,OAAO;GAAE,OAAO;GAAW,MAAM;GAAQ,SAAS,+BAA+B,EAAE,eAAe;EAAkC;CACxI;CACA,KAAK,EAAE,SAAS,WAAW,EAAE,SAAS,UAAU,EAAE,SAAS,UAAU,EAAE,SAAS,kBAAkB,MAAM,QAAQ,CAAC,GAAG;EAClH,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,gBAAgB,EAAE,IAAI,GAAG,EAAE,QAAQ,IAAI,SAAS;EAAU;EACzI,IAAI,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,eAAe,EAAE,IAAI;EAAQ;CAC9G;CACA,IAAI,EAAE,SAAS,YAAY,OAAO,MAAM,UAAU;EAChD,MAAM,KAAK,EAAE,OAAO,EAAE,SAAS;EAC/B,MAAM,KAAK,EAAE,OAAO,EAAE,SAAS;EAC/B,IAAI,MAAM,QAAQ,IAAI,IAAI,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,OAAO,GAAG;EAAU;EAC9F,IAAI,MAAM,QAAQ,IAAI,IAAI,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,OAAO,GAAG;EAAU;CAChG;CACA,IAAI,OAAO,MAAM,UAAU;EACzB,IAAI,EAAE,SAAS,WAAW,CAAC,6BAA6B,KAAK,CAAC,GAAG,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS;EAAmD;EACpK,IAAI,EAAE,SAAS,SAAS,CAAC,0CAA0C,KAAK,CAAC,GAAG,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS;EAAiE;EAC7L,IAAI,EAAE,SAAS,SAAS,uBAAuB,KAAK,CAAC,GAAG,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS;EAAkC;EAC1I,IAAI,EAAE,SAAS,UAAU,CAAC,6BAA6B,KAAK,CAAC,GAAG,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS;EAA6C;EAC7J,IAAI,EAAE,SAAS,QACb,IAAI;GACF,KAAK,MAAM,CAAC;EACd,QAAQ;GACN,OAAO;IAAE,OAAO;IAAS,MAAM;IAAQ,SAAS;GAAe;EACjE;EAEF,IAAI,EAAE,WAAW,CAAC,IAAI,OAAO,EAAE,OAAO,CAAC,CAAC,KAAK,CAAC,GAAG,OAAO;GAAE,OAAO;GAAS,MAAM;GAAQ,SAAS,EAAE,kBAAkB;EAAyC;CAChK;CACA,IAAI,EAAE,SAAS,SAAS;EAEtB,MAAM,SAAS,YAAY,GAAG;GAAE,GAAG,EAAE;GAAO,SAAS,EAAE,OAAO,WAAW,EAAE;GAAK,SAAS,EAAE,OAAO,WAAW,EAAE;EAAI,CAAC;EACpH,MAAM,QAAQ,OAAO,MAAM,MAAM,EAAE,UAAU,OAAO,KAAK,OAAO;EAChE,IAAI,OAAO,OAAO;GAAE,OAAO,MAAM;GAAO,MAAM;GAAQ,SAAS,MAAM;EAAQ;CAC/E;CACA,IAAI,EAAE,SAAS,WAAW,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,EAAE,OAAO,EAAE,UAAU,OAAO;EAAE,OAAO;EAAW,MAAM;EAAQ,SAAS;CAAqD;CAC5K,OAAO;AACT;;;;;;AAOA,IAAM,WAAW,MACf,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,IAAI,OAAO,CAAC,IAAI,OAAO,MAAM,YAAY,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,CAAC,kBAAkB,KAAK,IAAI;AACpI,IAAM,WAAW,MAAuB;CACtC,IAAI,OAAO,MAAM,UAAU,OAAO,KAAK,EAAE,KAAK,CAAC,CAAC,kBAAkB,KAAK;CACvE,IAAI,MAAM,CAAC,GAAG;EACZ,MAAM,EAAE,KAAK,IAAI,MAAM,IAAI,GAAG,SAAS;EACvC,OAAO,KAAK,KAAK,UAAU,OAAO,YAAY,OAAO,QAAQ,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,cAAc,CAAC,CAAC,CAAC,CAAC;CAC5G;CACA,OAAO,KAAK,KAAK,UAAU,CAAC;AAC9B;;AAEA,SAAS,QAAQ,QAAmB,KAA8C;CAChF,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,MAAgB,CAAC;CACvB,OAAO,SAAS,GAAG,MAAM;EACvB,MAAM,IAAI,IAAI,CAAC;EACf,IAAI,MAAM,MAAM;EAChB,IAAI,KAAK,IAAI,CAAC,GAAG,IAAI,KAAK,CAAC;OACtB,KAAK,IAAI,CAAC;CACjB,CAAC;CACD,OAAO;AACT;AACA,IAAM,SAAS,MAAe;CAC5B,MAAM,IAAI,OAAO,MAAM,WAAW,EAAE,KAAK,IAAI,OAAO,KAAK,EAAE;CAC3D,OAAO,EAAE,SAAS,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK;AAChD;;AAGA,SAAgB,cACd,QACA,KACA,MACA,eACA,MAAkB,CAAC,GAEnB,IACY;CACZ,MAAM,IAAI,MAAM,GAAG,IAAI,MAAM,CAAC;CAC9B,MAAM,OAAgB,MAAM;EAAE,MAAM;EAAG,SAAS,OAAO,EAAE,aAAa,WAAW,EAAE,WAAW,KAAA;CAAU;CACxG,MAAM,QAAiB;EAAE,MAAM,KAAK;EAAM,QAAQ;EAAG,SAAS,KAAK;CAAQ;CAC3E,KAAK,MAAM,KAAK,QAAQ;EACtB,IAAI,SAAS,GAAG,GAAG,IAAI,GAAG;EAC1B,MAAM,IAAI,CAAC,GAAG,MAAM,EAAE,IAAI;EAC1B,MAAM,MAAM,EAAE,EAAE;EAChB,MAAM,MAAM,cAAc,GAAG,GAAG;EAChC,IAAI,KAAK,IAAI,KAAK;GAAE,GAAG;GAAK,KAAK,QAAQ,CAAC;GAAG,MAAM;EAAE,CAAC;EACtD,IAAI,EAAE,SAAS,YAAY,EAAE,QAAQ,cAAc,EAAE,QAAQ,KAAK,GAAG,eAAe,KAAK,KAAK;EAE9F,KAAK,EAAE,SAAS,WAAW,EAAE,SAAS,UAAU,EAAE,SAAS,kBAAkB,MAAM,QAAQ,GAAG,KAAK,EAAE,YAAY,UAAU,CAAC,KAAK;GAC/H,MAAM,CAAC,KAAK,QAAQ,KAAK,OAAO;GAChC,IAAI,MAAM,KAAA,GAAW,IAAI,KAAK;IAAE,OAAO;IAAS,MAAM;IAAQ,SAAS,OAAO,IAAI,OAAO,WAAW,IAAI,MAAM,IAAI,EAAE,EAAE,wDAAwD,QAAQ,IAAI,EAAE;IAAyD,KAAK,QAAQ,CAAC;IAAG,MAAM;GAAE,CAAC;EACjR;EACA,IAAI,EAAE,SAAS,WAAW,MAAM,QAAQ,GAAG,KAAK,CAAC,cAAc,CAAC,GAAG;GACjE,IAAI,SAAS,IAAI,MAAM;IACrB,MAAM,IAAI,cAAc,GAAG,EAAE;IAC7B,IAAI,GAAG,QAAQ,cAAc,EAAE,QAAQ,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,eAAe,KAAK,KAAK;GACjF,CAAC;GAED,MAAM,uBAAO,IAAI,IAAY;GAC7B,KAAK,MAAM,MAAM,KAAK,KAAK,MAAM,KAAK,cAAc,GAAG,EAAE,CAAC,EAAE,UAAU,CAAC,GAAG,IAAI,EAAE,YAAY,QAAQ,KAAK,IAAI,EAAE,IAAI;GACnH,KAAK,MAAM,KAAK,MAAM;IACpB,MAAM,OAAO,IAAI,KAAK,OAAQ,MAAM,EAAE,IAAI,GAAG,KAAK,KAAA,CAAU;IAC5D,KAAK,MAAM,KAAK,QAAQ,MAAM,OAAO,GAAG;KACtC,MAAM,KAAK;MAAC,GAAG;MAAG;MAAG;KAAC;KACtB,MAAM,QAAQ,cAAc,GAAG,IAAI,EAAE,CAAC,EAAE,QAAQ,MAAM,MAAM,EAAE,SAAS,CAAC,CAAC,EAAE,SAAS;KACpF,IAAI,CAAC,IAAI,MAAM,MAAM,EAAE,QAAQ,QAAQ,EAAE,CAAC,GAAG,IAAI,KAAK;MAAE,OAAO;MAAS,MAAM;MAAQ,SAAS,GAAG,MAAM,oCAAoC,MAAM,KAAK,EAAE,EAAE;MAAqB,KAAK,QAAQ,EAAE;MAAG,MAAM;KAAG,CAAC;IAC9M;GACF;EACF;EACA,IAAI,EAAE,SAAS,UAAU,MAAM,QAAQ,GAAG,KAAK,eAC7C,IAAI,SAAS,IAAI,MAAM;GACrB,MAAM,IAAI,MAAM,EAAE,KAAK,OAAO,GAAG,UAAU,WAAW,cAAc,GAAG,KAAK,IAAI,KAAA;GAChF,IAAI,GAAG,cAAc,EAAE,QAAQ,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,eAAe,KAAK;IAAE,MAAM;IAAI,SAAS,MAAM,EAAE,KAAK,OAAO,GAAG,aAAa,WAAW,GAAG,WAAW,EAAE,WAAW,EAAE,EAAE;GAAG,CAAC;GACzK,IAAI,EAAE,gBAAgB,MAAM,EAAE,GAAG,cAAc,EAAE,cAAc,GAAG,WAAW;IAAC,GAAG;IAAG;IAAG;GAAW,GAAG,eAAe,GAAG;EACzH,CAAC;CAEL;CACA,OAAO;AACT"}

package/dist/library/analysis.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Static analysis of a catalog entry's schema — what the coverage matrix and the Model-notes facts show:
+ * field-type usage, deepest drill-in, and which schema features (conditions, localisation, groups…) it uses.
+ */
+import type { SchemaType, TypeSchema } from "../schema/types";
+import type { CatalogItem } from "./catalog";
+/** Field types in the order the matrix shows them (content → media → structure → technical). */
+export declare const TYPE_COLUMNS: SchemaType[];
+export type FeatureKey = "conditional" | "localized" | "validation" | "devLocked" | "ai" | "groups" | "fieldsets" | "variants" | "synced";
+export declare const FEATURE_COLUMNS: {
+    key: FeatureKey;
+    label: string;
+}[];
+export interface EntryStats {
+    types: Partial<Record<SchemaType, number>>;
+    fields: number;
+    /** deepest drill-in below the root (object, array item, slot child each add one level) */
+    depth: number;
+    features: Record<FeatureKey, boolean>;
+    /** block types reachable through slots */
+    slotTypes: string[];
+}
+export declare function statsOf(it: CatalogItem, resolve: (t: string) => TypeSchema | undefined): EntryStats;

package/dist/library/analysis.js

@@ -0,0 +1,160 @@
+//#region src/library/analysis.ts
+/** Field types in the order the matrix shows them (content → media → structure → technical). */
+var TYPE_COLUMNS = [
+	"string",
+	"text",
+	"richtext",
+	"number",
+	"boolean",
+	"select",
+	"multiselect",
+	"tags",
+	"slug",
+	"date",
+	"datetime",
+	"image",
+	"video",
+	"file",
+	"icon",
+	"color",
+	"link",
+	"button",
+	"url",
+	"email",
+	"reference",
+	"rating",
+	"geopoint",
+	"code",
+	"json",
+	"object",
+	"array",
+	"slot"
+];
+var FEATURE_COLUMNS = [
+	{
+		key: "conditional",
+		label: "Conditional"
+	},
+	{
+		key: "localized",
+		label: "Localized"
+	},
+	{
+		key: "validation",
+		label: "Validated"
+	},
+	{
+		key: "devLocked",
+		label: "Dev-locked"
+	},
+	{
+		key: "ai",
+		label: "AI assist"
+	},
+	{
+		key: "groups",
+		label: "Tabs"
+	},
+	{
+		key: "fieldsets",
+		label: "Fieldsets"
+	},
+	{
+		key: "variants",
+		label: "Variants"
+	},
+	{
+		key: "synced",
+		label: "Synced"
+	}
+];
+var subFields = (f) => f.type === "object" ? f.fields ?? [] : f.type === "array" && Array.isArray(f.of) ? f.of.flatMap((o) => o.type === "object" ? o.fields ?? [] : [o]) : [];
+function walk(fields, visit, guard = 0) {
+	if (guard > 24) return;
+	for (const f of fields) {
+		visit(f);
+		walk(subFields(f), visit, guard + 1);
+		if (f.slotSettings) walk(f.slotSettings, visit, guard + 1);
+	}
+}
+/** Collect slot child types from the value too (slots without an allow-list hold whatever the sample placed). */
+function valueTypes(v, out, guard = 0) {
+	if (guard > 30 || !v || typeof v !== "object") return;
+	if (Array.isArray(v)) {
+		for (const x of v) valueTypes(x, out, guard + 1);
+		return;
+	}
+	const o = v;
+	if (typeof o._type === "string") out.add(o._type);
+	for (const k of Object.keys(o)) if (k !== "_type" && k !== "_key") valueTypes(o[k], out, guard + 1);
+}
+function depthOf(fields, resolve, valueSlotTypes, seen, level = 0) {
+	if (level > 12) return level;
+	let max = 0;
+	for (const f of fields) if (f.type === "object") max = Math.max(max, 1 + depthOf(f.fields ?? [], resolve, valueSlotTypes, seen, level + 1));
+	else if (f.type === "array" && Array.isArray(f.of)) {
+		const objs = f.of.filter((o) => o.type === "object");
+		if (objs.length) max = Math.max(max, 1 + Math.max(...objs.map((o) => depthOf(o.fields ?? [], resolve, valueSlotTypes, seen, level + 1))));
+	} else if (f.type === "slot") {
+		const allow = f.of && !Array.isArray(f.of) ? f.of.allow : void 0;
+		const types = allow?.length ? allow : valueSlotTypes;
+		let inner = 0;
+		for (const t of types) {
+			if (seen.has(t)) continue;
+			const b = resolve(t);
+			if (!b) continue;
+			seen.add(t);
+			inner = Math.max(inner, depthOf(b.fields, resolve, valueSlotTypes, seen, level + 1));
+			seen.delete(t);
+		}
+		max = Math.max(max, 1 + inner);
+	}
+	return max;
+}
+var cache = /* @__PURE__ */ new WeakMap();
+function statsOf(it, resolve) {
+	const hit = cache.get(it.ex);
+	if (hit) return hit;
+	const schema = it.ex.schema;
+	const types = {};
+	const features = {
+		conditional: false,
+		localized: false,
+		validation: false,
+		devLocked: false,
+		ai: false,
+		groups: (schema.groups?.length ?? 0) >= 2,
+		fieldsets: (schema.fieldsets?.length ?? 0) > 0,
+		variants: (schema.variants?.length ?? 0) > 0,
+		synced: !!it.ex.syncedFrom
+	};
+	let fields = 0;
+	walk(schema.fields, (f) => {
+		fields++;
+		types[f.type] = (types[f.type] ?? 0) + 1;
+		if (f.hidden && f.hidden !== true) features.conditional = true;
+		if (f.localized) features.localized = true;
+		if (f.validation && Object.keys(f.validation).length) features.validation = true;
+		if (f.access?.edit === "schema.manage") features.devLocked = true;
+		if (f.ai) features.ai = true;
+		if (f.fieldset) features.fieldsets = true;
+		if (f.synced) features.synced = true;
+	});
+	const vt = /* @__PURE__ */ new Set();
+	valueTypes(it.ex.value, vt);
+	const slotTypes = [...vt].filter((t) => !!resolve(t));
+	const depth = depthOf(schema.fields, resolve, slotTypes, /* @__PURE__ */ new Set([schema.name]));
+	const out = {
+		types,
+		fields,
+		depth,
+		features,
+		slotTypes
+	};
+	cache.set(it.ex, out);
+	return out;
+}
+//#endregion
+export { FEATURE_COLUMNS, TYPE_COLUMNS, statsOf };
+
+//# sourceMappingURL=analysis.js.map

package/dist/library/analysis.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.js","names":[],"sources":["../../src/library/analysis.ts"],"sourcesContent":["/**\n * Static analysis of a catalog entry's schema — what the coverage matrix and the Model-notes facts show:\n * field-type usage, deepest drill-in, and which schema features (conditions, localisation, groups…) it uses.\n */\nimport type { FieldSchema, SchemaType, TypeSchema } from \"../schema/types\";\nimport type { CatalogItem } from \"./catalog\";\n\n/** Field types in the order the matrix shows them (content → media → structure → technical). */\nexport const TYPE_COLUMNS: SchemaType[] = [\n  \"string\", \"text\", \"richtext\", \"number\", \"boolean\", \"select\", \"multiselect\", \"tags\", \"slug\", \"date\", \"datetime\",\n  \"image\", \"video\", \"file\", \"icon\", \"color\", \"link\", \"button\", \"url\", \"email\", \"reference\", \"rating\", \"geopoint\",\n  \"code\", \"json\", \"object\", \"array\", \"slot\",\n];\n\nexport type FeatureKey = \"conditional\" | \"localized\" | \"validation\" | \"devLocked\" | \"ai\" | \"groups\" | \"fieldsets\" | \"variants\" | \"synced\";\nexport const FEATURE_COLUMNS: { key: FeatureKey; label: string }[] = [\n  { key: \"conditional\", label: \"Conditional\" },\n  { key: \"localized\", label: \"Localized\" },\n  { key: \"validation\", label: \"Validated\" },\n  { key: \"devLocked\", label: \"Dev-locked\" },\n  { key: \"ai\", label: \"AI assist\" },\n  { key: \"groups\", label: \"Tabs\" },\n  { key: \"fieldsets\", label: \"Fieldsets\" },\n  { key: \"variants\", label: \"Variants\" },\n  { key: \"synced\", label: \"Synced\" },\n];\n\nexport interface EntryStats {\n  types: Partial<Record<SchemaType, number>>;\n  fields: number;\n  /** deepest drill-in below the root (object, array item, slot child each add one level) */\n  depth: number;\n  features: Record<FeatureKey, boolean>;\n  /** block types reachable through slots */\n  slotTypes: string[];\n}\n\nconst subFields = (f: FieldSchema): FieldSchema[] =>\n  f.type === \"object\" ? f.fields ?? [] : f.type === \"array\" && Array.isArray(f.of) ? f.of.flatMap((o) => (o.type === \"object\" ? o.fields ?? [] : [o])) : [];\n\nfunction walk(fields: FieldSchema[], visit: (f: FieldSchema) => void, guard = 0) {\n  if (guard > 24) return;\n  for (const f of fields) {\n    visit(f);\n    walk(subFields(f), visit, guard + 1);\n    if (f.slotSettings) walk(f.slotSettings, visit, guard + 1);\n  }\n}\n\n/** Collect slot child types from the value too (slots without an allow-list hold whatever the sample placed). */\nfunction valueTypes(v: unknown, out: Set<string>, guard = 0) {\n  if (guard > 30 || !v || typeof v !== \"object\") return;\n  if (Array.isArray(v)) {\n    for (const x of v) valueTypes(x, out, guard + 1);\n    return;\n  }\n  const o = v as Record<string, unknown>;\n  if (typeof o._type === \"string\") out.add(o._type);\n  for (const k of Object.keys(o)) if (k !== \"_type\" && k !== \"_key\") valueTypes(o[k], out, guard + 1);\n}\n\nfunction depthOf(fields: FieldSchema[], resolve: (t: string) => TypeSchema | undefined, valueSlotTypes: string[], seen: Set<string>, level = 0): number {\n  if (level > 12) return level;\n  let max = 0;\n  for (const f of fields) {\n    if (f.type === \"object\") max = Math.max(max, 1 + depthOf(f.fields ?? [], resolve, valueSlotTypes, seen, level + 1));\n    else if (f.type === \"array\" && Array.isArray(f.of)) {\n      const objs = f.of.filter((o) => o.type === \"object\");\n      if (objs.length) max = Math.max(max, 1 + Math.max(...objs.map((o) => depthOf(o.fields ?? [], resolve, valueSlotTypes, seen, level + 1))));\n    } else if (f.type === \"slot\") {\n      const allow = f.of && !Array.isArray(f.of) ? f.of.allow : undefined;\n      const types = allow?.length ? allow : valueSlotTypes;\n      let inner = 0;\n      for (const t of types) {\n        if (seen.has(t)) continue;\n        const b = resolve(t);\n        if (!b) continue;\n        seen.add(t);\n        inner = Math.max(inner, depthOf(b.fields, resolve, valueSlotTypes, seen, level + 1));\n        seen.delete(t);\n      }\n      max = Math.max(max, 1 + inner);\n    }\n  }\n  return max;\n}\n\nconst cache = new WeakMap<object, EntryStats>();\n\nexport function statsOf(it: CatalogItem, resolve: (t: string) => TypeSchema | undefined): EntryStats {\n  const hit = cache.get(it.ex);\n  if (hit) return hit;\n  const schema = it.ex.schema;\n  const types: Partial<Record<SchemaType, number>> = {};\n  const features: Record<FeatureKey, boolean> = {\n    conditional: false, localized: false, validation: false, devLocked: false, ai: false,\n    groups: (schema.groups?.length ?? 0) >= 2, fieldsets: (schema.fieldsets?.length ?? 0) > 0, variants: (schema.variants?.length ?? 0) > 0, synced: !!it.ex.syncedFrom,\n  };\n  let fields = 0;\n  walk(schema.fields, (f) => {\n    fields++;\n    types[f.type] = (types[f.type] ?? 0) + 1;\n    if (f.hidden && f.hidden !== true) features.conditional = true;\n    if (f.localized) features.localized = true;\n    if (f.validation && Object.keys(f.validation).length) features.validation = true;\n    if (f.access?.edit === \"schema.manage\") features.devLocked = true;\n    if (f.ai) features.ai = true;\n    if (f.fieldset) features.fieldsets = true;\n    if (f.synced) features.synced = true;\n  });\n  const vt = new Set<string>();\n  valueTypes(it.ex.value, vt);\n  const slotTypes = [...vt].filter((t) => !!resolve(t));\n  const depth = depthOf(schema.fields, resolve, slotTypes, new Set([schema.name]));\n  const out: EntryStats = { types, fields, depth, features, slotTypes };\n  cache.set(it.ex, out);\n  return out;\n}\n"],"mappings":";;AAQA,IAAa,eAA6B;CACxC;CAAU;CAAQ;CAAY;CAAU;CAAW;CAAU;CAAe;CAAQ;CAAQ;CAAQ;CACpG;CAAS;CAAS;CAAQ;CAAQ;CAAS;CAAQ;CAAU;CAAO;CAAS;CAAa;CAAU;CACpG;CAAQ;CAAQ;CAAU;CAAS;AACrC;AAGA,IAAa,kBAAwD;CACnE;EAAE,KAAK;EAAe,OAAO;CAAc;CAC3C;EAAE,KAAK;EAAa,OAAO;CAAY;CACvC;EAAE,KAAK;EAAc,OAAO;CAAY;CACxC;EAAE,KAAK;EAAa,OAAO;CAAa;CACxC;EAAE,KAAK;EAAM,OAAO;CAAY;CAChC;EAAE,KAAK;EAAU,OAAO;CAAO;CAC/B;EAAE,KAAK;EAAa,OAAO;CAAY;CACvC;EAAE,KAAK;EAAY,OAAO;CAAW;CACrC;EAAE,KAAK;EAAU,OAAO;CAAS;AACnC;AAYA,IAAM,aAAa,MACjB,EAAE,SAAS,WAAW,EAAE,UAAU,CAAC,IAAI,EAAE,SAAS,WAAW,MAAM,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,SAAS,MAAO,EAAE,SAAS,WAAW,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC,CAAE,IAAI,CAAC;AAE1J,SAAS,KAAK,QAAuB,OAAiC,QAAQ,GAAG;CAC/E,IAAI,QAAQ,IAAI;CAChB,KAAK,MAAM,KAAK,QAAQ;EACtB,MAAM,CAAC;EACP,KAAK,UAAU,CAAC,GAAG,OAAO,QAAQ,CAAC;EACnC,IAAI,EAAE,cAAc,KAAK,EAAE,cAAc,OAAO,QAAQ,CAAC;CAC3D;AACF;;AAGA,SAAS,WAAW,GAAY,KAAkB,QAAQ,GAAG;CAC3D,IAAI,QAAQ,MAAM,CAAC,KAAK,OAAO,MAAM,UAAU;CAC/C,IAAI,MAAM,QAAQ,CAAC,GAAG;EACpB,KAAK,MAAM,KAAK,GAAG,WAAW,GAAG,KAAK,QAAQ,CAAC;EAC/C;CACF;CACA,MAAM,IAAI;CACV,IAAI,OAAO,EAAE,UAAU,UAAU,IAAI,IAAI,EAAE,KAAK;CAChD,KAAK,MAAM,KAAK,OAAO,KAAK,CAAC,GAAG,IAAI,MAAM,WAAW,MAAM,QAAQ,WAAW,EAAE,IAAI,KAAK,QAAQ,CAAC;AACpG;AAEA,SAAS,QAAQ,QAAuB,SAAgD,gBAA0B,MAAmB,QAAQ,GAAW;CACtJ,IAAI,QAAQ,IAAI,OAAO;CACvB,IAAI,MAAM;CACV,KAAK,MAAM,KAAK,QACd,IAAI,EAAE,SAAS,UAAU,MAAM,KAAK,IAAI,KAAK,IAAI,QAAQ,EAAE,UAAU,CAAC,GAAG,SAAS,gBAAgB,MAAM,QAAQ,CAAC,CAAC;MAC7G,IAAI,EAAE,SAAS,WAAW,MAAM,QAAQ,EAAE,EAAE,GAAG;EAClD,MAAM,OAAO,EAAE,GAAG,QAAQ,MAAM,EAAE,SAAS,QAAQ;EACnD,IAAI,KAAK,QAAQ,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,GAAG,KAAK,KAAK,MAAM,QAAQ,EAAE,UAAU,CAAC,GAAG,SAAS,gBAAgB,MAAM,QAAQ,CAAC,CAAC,CAAC,CAAC;CAC1I,OAAO,IAAI,EAAE,SAAS,QAAQ;EAC5B,MAAM,QAAQ,EAAE,MAAM,CAAC,MAAM,QAAQ,EAAE,EAAE,IAAI,EAAE,GAAG,QAAQ,KAAA;EAC1D,MAAM,QAAQ,OAAO,SAAS,QAAQ;EACtC,IAAI,QAAQ;EACZ,KAAK,MAAM,KAAK,OAAO;GACrB,IAAI,KAAK,IAAI,CAAC,GAAG;GACjB,MAAM,IAAI,QAAQ,CAAC;GACnB,IAAI,CAAC,GAAG;GACR,KAAK,IAAI,CAAC;GACV,QAAQ,KAAK,IAAI,OAAO,QAAQ,EAAE,QAAQ,SAAS,gBAAgB,MAAM,QAAQ,CAAC,CAAC;GACnF,KAAK,OAAO,CAAC;EACf;EACA,MAAM,KAAK,IAAI,KAAK,IAAI,KAAK;CAC/B;CAEF,OAAO;AACT;AAEA,IAAM,wBAAQ,IAAI,QAA4B;AAE9C,SAAgB,QAAQ,IAAiB,SAA4D;CACnG,MAAM,MAAM,MAAM,IAAI,GAAG,EAAE;CAC3B,IAAI,KAAK,OAAO;CAChB,MAAM,SAAS,GAAG,GAAG;CACrB,MAAM,QAA6C,CAAC;CACpD,MAAM,WAAwC;EAC5C,aAAa;EAAO,WAAW;EAAO,YAAY;EAAO,WAAW;EAAO,IAAI;EAC/E,SAAS,OAAO,QAAQ,UAAU,MAAM;EAAG,YAAY,OAAO,WAAW,UAAU,KAAK;EAAG,WAAW,OAAO,UAAU,UAAU,KAAK;EAAG,QAAQ,CAAC,CAAC,GAAG,GAAG;CAC3J;CACA,IAAI,SAAS;CACb,KAAK,OAAO,SAAS,MAAM;EACzB;EACA,MAAM,EAAE,SAAS,MAAM,EAAE,SAAS,KAAK;EACvC,IAAI,EAAE,UAAU,EAAE,WAAW,MAAM,SAAS,cAAc;EAC1D,IAAI,EAAE,WAAW,SAAS,YAAY;EACtC,IAAI,EAAE,cAAc,OAAO,KAAK,EAAE,UAAU,CAAC,CAAC,QAAQ,SAAS,aAAa;EAC5E,IAAI,EAAE,QAAQ,SAAS,iBAAiB,SAAS,YAAY;EAC7D,IAAI,EAAE,IAAI,SAAS,KAAK;EACxB,IAAI,EAAE,UAAU,SAAS,YAAY;EACrC,IAAI,EAAE,QAAQ,SAAS,SAAS;CAClC,CAAC;CACD,MAAM,qBAAK,IAAI,IAAY;CAC3B,WAAW,GAAG,GAAG,OAAO,EAAE;CAC1B,MAAM,YAAY,CAAC,GAAG,EAAE,CAAC,CAAC,QAAQ,MAAM,CAAC,CAAC,QAAQ,CAAC,CAAC;CACpD,MAAM,QAAQ,QAAQ,OAAO,QAAQ,SAAS,2BAAW,IAAI,IAAI,CAAC,OAAO,IAAI,CAAC,CAAC;CAC/E,MAAM,MAAkB;EAAE;EAAO;EAAQ;EAAO;EAAU;CAAU;CACpE,MAAM,IAAI,GAAG,IAAI,GAAG;CACpB,OAAO;AACT"}

package/dist/library/catalog.d.ts

@@ -0,0 +1,57 @@
+/**
+ * Kit Library catalog — the library entries (`./entries/*.entries.ts`) plus the
+ * original Block Kit examples ("Core examples"), normalised into one list the page, the coverage matrix and
+ * the search use. Pure data: no React.
+ */
+import { type KitExample } from "./examples";
+import type { EdgeTag, KitCategory, KitEntry, KitModelNotes, KitPreviewLayout } from "./types";
+import type { TypeSchema } from "../schema/types";
+export declare const CORE_CATEGORY: "Core examples";
+export type CatalogCategory = KitCategory | typeof CORE_CATEGORY;
+/** Display order of the categories (the contract's union order). */
+export declare const CATEGORY_ORDER: KitCategory[];
+/** Every edge tag, in a reading order (structure → content → behaviour → output). */
+export declare const EDGE_TAGS: {
+    tag: EdgeTag;
+    label: string;
+    hint: string;
+}[];
+export declare const TAG_LABEL: Record<string, string>;
+export interface CatalogItem {
+    /** URL id: the entry id, or `core-{id}` for the original examples */
+    id: string;
+    ex: KitExample;
+    entry?: KitEntry;
+    core: boolean;
+    category: CatalogCategory;
+    tags: EdgeTag[];
+    notes?: KitModelNotes;
+    brand?: string;
+    previewLayout?: KitPreviewLayout;
+    /** lower-cased haystack: name, description, proves, category, tags, html signals, brand */
+    hay: string;
+}
+/** Library entries (sorted by category order, then file order) followed by the core examples. Ids are unique. */
+export declare function buildCatalog(library?: KitEntry[]): CatalogItem[];
+export declare const CATALOG: CatalogItem[];
+/** Categories present in a list, in display order, with counts. */
+export declare function categoriesOf(items: CatalogItem[]): {
+    category: CatalogCategory;
+    count: number;
+}[];
+/** Every term must appear somewhere in the haystack. */
+export declare function matches(it: CatalogItem, terms: string[], tags: EdgeTag[]): boolean;
+export declare const termsOf: (q: string) => string[];
+/**
+ * Block schemas a slot can resolve: the shared example blocks plus every library entry whose schema is a block
+ * (so an entry may place another entry's block in a slot by its schema name). First definition wins.
+ */
+export declare const LIBRARY_BLOCKS: TypeSchema[];
+export declare const resolveLibraryBlock: (type: string) => TypeSchema | undefined;
+/** Blocks offered by "+ Add block": only real blocks (not entries / pages). */
+export declare const PICKABLE_BLOCKS: TypeSchema[];
+/** Slot resolution for one catalog item: its entry-local `blocks` first (contract), then the shared library. */
+export declare function blocksFor(it: CatalogItem): {
+    resolve: (type: string) => TypeSchema | undefined;
+    library: TypeSchema[];
+};