@bettercms-ai/kit 3.1.1 → 3.1.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/dist/adapters/prod-types.d.ts +3 -0
- package/dist/adapters/prod-types.js.map +1 -1
- package/dist/adapters/schema.js +3 -0
- package/dist/adapters/schema.js.map +1 -1
- package/dist/adapters/values.d.ts +5 -4
- package/dist/adapters/values.js +13 -11
- package/dist/adapters/values.js.map +1 -1
- package/dist/controls/media.d.ts +1 -1
- package/dist/controls/media.js.map +1 -1
- package/dist/controls/number.js +12 -0
- package/dist/controls/number.js.map +1 -1
- package/dist/controls/rich-text/catalog.js +7 -4
- package/dist/controls/rich-text/catalog.js.map +1 -1
- package/dist/controls/rich-text/editor.js +20 -7
- package/dist/controls/rich-text/editor.js.map +1 -1
- package/dist/controls/rich-text/ops.js +1 -1
- package/dist/controls/rich-text/ops.js.map +1 -1
- package/dist/controls/rich-text/toolbar.js +1 -1
- package/dist/controls/rich-text/toolbar.js.map +1 -1
- package/dist/engine/add-limit.d.ts +18 -0
- package/dist/engine/add-limit.js +36 -0
- package/dist/engine/add-limit.js.map +1 -0
- package/dist/engine/array.d.ts +2 -0
- package/dist/engine/array.js +36 -15
- package/dist/engine/array.js.map +1 -1
- package/dist/engine/item-list.js +13 -9
- package/dist/engine/item-list.js.map +1 -1
- package/dist/engine/slot.d.ts +10 -1
- package/dist/engine/slot.js +38 -7
- package/dist/engine/slot.js.map +1 -1
- package/dist/index.js +3 -3
- package/dist/lib/validate.d.ts +1 -0
- package/dist/lib/validate.js +14 -1
- package/dist/lib/validate.js.map +1 -1
- package/package.json +2 -2
package/dist/lib/validate.js.map
CHANGED
|
@@ -1 +1 @@
|
|
|
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 * Values other records already hold for a ROOT field with `validation.unique` (a collection's other entries). The host\n * passes it; without it a root `unique` field is not checked (lists always are).\n */\nexport type UniquePeers = (field: FieldSchema, path: FieldPath) => unknown[] | undefined;\n\n/**\n * What makes two values \"the same\" for `unique` (V2 uniqueKey, as the server judges a placement in backend prop-fields\n * tableProblem): text trimmed and case-folded, numbers and booleans as written, a reference or link by its id. null =\n * nothing to compare. A list's items compare whole (itemKey), strings case-folded, rows without their `_id` / `_key`.\n */\nexport function uniqueKey(v: unknown): string | null {\n if (typeof v === \"string\") return v.trim() ? v.trim().toLocaleLowerCase(\"und\") : null;\n if ((typeof v === \"number\" && Number.isFinite(v)) || typeof v === \"boolean\") return String(v);\n if (!isObj(v)) return null;\n const id = v._ref ?? v.id ?? v.value ?? v.href ?? v.url;\n return typeof id === \"string\" || typeof id === \"number\" ? uniqueKey(String(id)) : null;\n}\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() : isObj(v) ? String(v.title ?? v.label ?? v._ref ?? v.id ?? \"\") : 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 /** root fields with `unique`: the values the model's other records hold (the root call only) */\n peers?: UniquePeers,\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 else if (peers && !base.length && f.validation?.unique && f.type !== \"array\") {\n const k = uniqueKey(val);\n if (k !== null && (peers(f, p) ?? []).some((o) => uniqueKey(o) === k))\n out.push({ level: \"error\", kind: \"rule\", message: `Another item already uses “${shown(val)}”. ${f.title} must be different on each one.`, key: pathKey(p), path: p });\n }\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` (or the list's `uniqueBy`): 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 || f.validation?.uniqueBy === x.name) 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, uniqueKey)) {\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;;;;;;AAaA,SAAgB,UAAU,GAA2B;CACnD,IAAI,OAAO,MAAM,UAAU,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,CAAC,kBAAkB,KAAK,IAAI;CACjF,IAAK,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,KAAM,OAAO,MAAM,WAAW,OAAO,OAAO,CAAC;CAC5F,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;CACtB,MAAM,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE;CACpD,OAAO,OAAO,OAAO,YAAY,OAAO,OAAO,WAAW,UAAU,OAAO,EAAE,CAAC,IAAI;AACpF;AACA,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,MAAM,CAAC,IAAI,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,OAAO,KAAK,EAAE;CAC3H,OAAO,EAAE,SAAS,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK;AAChD;;AAGA,SAAgB,cACd,QACA,KACA,MACA,eACA,MAAkB,CAAC,GAEnB,IAEA,OACY;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;OACjD,IAAI,SAAS,CAAC,KAAK,UAAU,EAAE,YAAY,UAAU,EAAE,SAAS,SAAS;GAC5E,MAAM,IAAI,UAAU,GAAG;GACvB,IAAI,MAAM,SAAS,MAAM,GAAG,CAAC,KAAK,CAAC,EAAA,CAAG,MAAM,MAAM,UAAU,CAAC,MAAM,CAAC,GAClE,IAAI,KAAK;IAAE,OAAO;IAAS,MAAM;IAAQ,SAAS,8BAA8B,MAAM,GAAG,EAAE,KAAK,EAAE,MAAM;IAAkC,KAAK,QAAQ,CAAC;IAAG,MAAM;GAAE,CAAC;EACxK;EACA,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,UAAU,EAAE,YAAY,aAAa,EAAE,MAAM,KAAK,IAAI,EAAE,IAAI;GACxJ,KAAK,MAAM,KAAK,MAAM;IACpB,MAAM,OAAO,IAAI,KAAK,OAAQ,MAAM,EAAE,IAAI,GAAG,KAAK,KAAA,CAAU;IAC5D,KAAK,MAAM,KAAK,QAAQ,MAAM,SAAS,GAAG;KACxC,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"}
|
|
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;\n/** A colour as a stylesheet takes it: hex (#RGB · #RRGGBB · #RRGGBBAA), a colour function, or a custom property (BL-567). */\nconst COLOUR = /^(?:#(?:[0-9a-f]{3}|[0-9a-f]{6}|[0-9a-f]{8})|(?:rgba?|hsla?|hwb|lab|lch|oklab|oklch|color)\\([^()]*\\)|var\\(--[\\w-]+\\))$/i;\nexport const isColour = (v: string): boolean => COLOUR.test(v.trim());\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 // BL-567: a required button with a link and no words is a blank button on the page.\n if (r.required && f.type === \"button\" && isObj(v) && !String(v.label ?? \"\").trim())\n return { level: \"error\", kind: \"required\", message: `Add a label for ${label.toLowerCase()}` };\n if (f.type === \"color\" && typeof v === \"string\" && !isColour(v)) return { level: \"error\", kind: \"rule\", message: \"Use a hex colour, like #1a73e8\" };\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 * Values other records already hold for a ROOT field with `validation.unique` (a collection's other entries). The host\n * passes it; without it a root `unique` field is not checked (lists always are).\n */\nexport type UniquePeers = (field: FieldSchema, path: FieldPath) => unknown[] | undefined;\n\n/**\n * What makes two values \"the same\" for `unique` (V2 uniqueKey, as the server judges a placement in backend prop-fields\n * tableProblem): text trimmed and case-folded, numbers and booleans as written, a reference or link by its id. null =\n * nothing to compare. A list's items compare whole (itemKey), strings case-folded, rows without their `_id` / `_key`.\n */\nexport function uniqueKey(v: unknown): string | null {\n if (typeof v === \"string\") return v.trim() ? v.trim().toLocaleLowerCase(\"und\") : null;\n if ((typeof v === \"number\" && Number.isFinite(v)) || typeof v === \"boolean\") return String(v);\n if (!isObj(v)) return null;\n const id = v._ref ?? v.id ?? v.value ?? v.href ?? v.url;\n return typeof id === \"string\" || typeof id === \"number\" ? uniqueKey(String(id)) : null;\n}\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() : isObj(v) ? String(v.title ?? v.label ?? v._ref ?? v.id ?? \"\") : 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 /** root fields with `unique`: the values the model's other records hold (the root call only) */\n peers?: UniquePeers,\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 else if (peers && !base.length && f.validation?.unique && f.type !== \"array\") {\n const k = uniqueKey(val);\n if (k !== null && (peers(f, p) ?? []).some((o) => uniqueKey(o) === k))\n out.push({ level: \"error\", kind: \"rule\", message: `Another item already uses “${shown(val)}”. ${f.title} must be different on each one.`, key: pathKey(p), path: p });\n }\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` (or the list's `uniqueBy`): 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 || f.validation?.uniqueBy === x.name) 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, uniqueKey)) {\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;;AAEvD,IAAM,SAAS;AACf,IAAa,YAAY,MAAuB,OAAO,KAAK,EAAE,KAAK,CAAC;AACpE,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,EAAE,YAAY,EAAE,SAAS,YAAY,MAAM,CAAC,KAAK,CAAC,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC,KAAK,GAC/E,OAAO;EAAE,OAAO;EAAS,MAAM;EAAY,SAAS,mBAAmB,MAAM,YAAY;CAAI;CAC/F,IAAI,EAAE,SAAS,WAAW,OAAO,MAAM,YAAY,CAAC,SAAS,CAAC,GAAG,OAAO;EAAE,OAAO;EAAS,MAAM;EAAQ,SAAS;CAAiC;CAElJ,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;;;;;;AAaA,SAAgB,UAAU,GAA2B;CACnD,IAAI,OAAO,MAAM,UAAU,OAAO,EAAE,KAAK,IAAI,EAAE,KAAK,CAAC,CAAC,kBAAkB,KAAK,IAAI;CACjF,IAAK,OAAO,MAAM,YAAY,OAAO,SAAS,CAAC,KAAM,OAAO,MAAM,WAAW,OAAO,OAAO,CAAC;CAC5F,IAAI,CAAC,MAAM,CAAC,GAAG,OAAO;CACtB,MAAM,KAAK,EAAE,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE;CACpD,OAAO,OAAO,OAAO,YAAY,OAAO,OAAO,WAAW,UAAU,OAAO,EAAE,CAAC,IAAI;AACpF;AACA,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,MAAM,CAAC,IAAI,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,OAAO,KAAK,EAAE;CAC3H,OAAO,EAAE,SAAS,KAAK,GAAG,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK;AAChD;;AAGA,SAAgB,cACd,QACA,KACA,MACA,eACA,MAAkB,CAAC,GAEnB,IAEA,OACY;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;OACjD,IAAI,SAAS,CAAC,KAAK,UAAU,EAAE,YAAY,UAAU,EAAE,SAAS,SAAS;GAC5E,MAAM,IAAI,UAAU,GAAG;GACvB,IAAI,MAAM,SAAS,MAAM,GAAG,CAAC,KAAK,CAAC,EAAA,CAAG,MAAM,MAAM,UAAU,CAAC,MAAM,CAAC,GAClE,IAAI,KAAK;IAAE,OAAO;IAAS,MAAM;IAAQ,SAAS,8BAA8B,MAAM,GAAG,EAAE,KAAK,EAAE,MAAM;IAAkC,KAAK,QAAQ,CAAC;IAAG,MAAM;GAAE,CAAC;EACxK;EACA,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,UAAU,EAAE,YAAY,aAAa,EAAE,MAAM,KAAK,IAAI,EAAE,IAAI;GACxJ,KAAK,MAAM,KAAK,MAAM;IACpB,MAAM,OAAO,IAAI,KAAK,OAAQ,MAAM,EAAE,IAAI,GAAG,KAAK,KAAA,CAAU;IAC5D,KAAK,MAAM,KAAK,QAAQ,MAAM,SAAS,GAAG;KACxC,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/package.json
CHANGED
|
@@ -1,6 +1,6 @@
|
|
|
1
1
|
{
|
|
2
2
|
"name": "@bettercms-ai/kit",
|
|
3
|
-
"version": "3.1.
|
|
3
|
+
"version": "3.1.3",
|
|
4
4
|
"description": "The BetterCMS V2 Block Kit: schema language, form engine, controls and design tokens.",
|
|
5
5
|
"license": "MIT",
|
|
6
6
|
"type": "module",
|
|
@@ -85,7 +85,7 @@
|
|
|
85
85
|
},
|
|
86
86
|
"devDependencies": {
|
|
87
87
|
"@base-ui/react": "^1.4.1",
|
|
88
|
-
"@bettercms-ai/types": "
|
|
88
|
+
"@bettercms-ai/types": "workspace:*",
|
|
89
89
|
"@tabler/icons-react": "3.48.0",
|
|
90
90
|
"@tailwindcss/node": "^4.2.2",
|
|
91
91
|
"@tailwindcss/postcss": "^4.2.2",
|