@nivaro/react 0.3.36 → 0.3.37

package/dist/shared/lib/layout-lint.js

@@ -1,17 +1,23 @@
-const he = "__ungrouped__";
-function Oe(o, n) {
-  if (!n) return o;
-  const s = new Set(o.placements.map((g) => g.field)), a = new Set(o.groups.map((g) => g.key)), c = n.groups.filter((g) => g.key !== he && !a.has(g.key)), u = n.placements.filter((g) => !s.has(g.field));
+const pe = [
+  "label-sentence-case",
+  "label-too-long",
+  "label-jargon",
+  "help-repeats-label",
+  "label-duplicate"
+], Ee = "__ungrouped__";
+function it(t, n) {
+  if (!n) return t;
+  const s = new Set(t.placements.map((c) => c.field)), a = new Set(t.groups.map((c) => c.key)), u = n.groups.filter((c) => c.key !== Ee && !a.has(c.key)), r = n.placements.filter((c) => !s.has(c.field));
   return {
-    ...o,
-    groups: [...o.groups, ...c],
-    placements: [...o.placements, ...u],
-    inherited: { fields: u.map((g) => g.field), groups: c.map((g) => g.key) }
+    ...t,
+    groups: [...t.groups, ...u],
+    placements: [...t.placements, ...r],
+    inherited: { fields: r.map((c) => c.field), groups: u.map((c) => c.key) }
   };
 }
-const Ue = { fields: [], roles: [], requirements: [] }, ye = /^__.*__$/, Se = "__header__", Me = /^\{\{\s*[A-Za-z_][A-Za-z0-9_]*\s*\}\}/;
-function W(o) {
-  let n = o;
+const lt = { fields: [], roles: [], requirements: [] }, V = /^__.*__$/, Oe = "__header__", je = /^\{\{\s*[A-Za-z_][A-Za-z0-9_]*\s*\}\}/;
+function ee(t) {
+  let n = t;
   for (let s = 0; s < 4 && typeof n == "string"; s++) {
     const a = n.trim();
     if (a === "") return null;
@@ -23,375 +29,496 @@ function W(o) {
   }
   return n;
 }
-function se(o) {
-  const n = W(o);
+function de(t) {
+  const n = ee(t);
   return n && typeof n == "object" && !Array.isArray(n) ? n : {};
 }
-function T(o) {
-  const n = W(o);
+function q(t) {
+  const n = ee(t);
   return Array.isArray(n) ? n : [];
 }
-const re = (o) => o === !0 || o === 1 || o === "1" || o === "true";
-function G(o) {
-  return T(o).map((n) => String(n).toUpperCase());
+const he = (t) => t === !0 || t === 1 || t === "1" || t === "true";
+function K(t) {
+  return q(t).map((n) => String(n).toUpperCase());
 }
-function me(o) {
-  return !ye.test(o.field) && o.widget_id == null;
+function Ae(t) {
+  return !V.test(t.field) && t.widget_id == null;
 }
-function K(o, n) {
-  const s = W(o.input_bindings);
+function X(t, n) {
+  const s = ee(t.input_bindings);
   if (Array.isArray(s)) {
-    const a = s.find((c) => c && typeof c == "object" && c.key === n);
+    const a = s.find((u) => u && typeof u == "object" && u.key === n);
     return a == null ? void 0 : a.binding_value;
   }
   if (s && typeof s == "object") return s[n];
 }
-function B(o) {
-  return o.length <= 1 ? o[0] ?? "" : o.length === 2 ? `${o[0]} and ${o[1]}` : `${o.slice(0, -1).join(", ")} and ${o[o.length - 1]}`;
+function G(t) {
+  return t.length <= 1 ? t[0] ?? "" : t.length === 2 ? `${t[0]} and ${t[1]}` : `${t.slice(0, -1).join(", ")} and ${t[t.length - 1]}`;
 }
-const ie = (o) => o.replace(/[_.]+/g, " ").trim().replace(/\b\w/g, (n) => n.toUpperCase());
-function _e(o) {
-  return T(o).filter(
+const ge = (t) => t.replace(/[_.]+/g, " ").trim().replace(/\b\w/g, (n) => n.toUpperCase());
+function Re(t) {
+  return q(t).filter(
     (n) => !!n && typeof n == "object" && typeof n.field == "string" && !!n.op
   );
 }
-const O = (o) => {
-  if (typeof o == "number") return Number.isFinite(o) ? o : null;
-  if (typeof o == "string" && o.trim() !== "") {
-    const n = Number(o);
+const D = (t) => {
+  if (typeof t == "number") return Number.isFinite(t) ? t : null;
+  if (typeof t == "string" && t.trim() !== "") {
+    const n = Number(t);
     return Number.isNaN(n) ? null : n;
   }
   return null;
 };
-function le(o, n) {
-  const s = O(o), a = O(n);
-  return s !== null && a !== null ? s === a : String(o ?? "") === String(n ?? "");
+function ye(t, n) {
+  const s = D(t), a = D(n);
+  return s !== null && a !== null ? s === a : String(t ?? "") === String(n ?? "");
 }
-function ue(o) {
+function me(t) {
   const n = /* @__PURE__ */ new Map();
-  for (const s of o)
-    typeof s.value == "string" && Me.test(s.value.trim()) || n.set(s.field, [...n.get(s.field) ?? [], s]);
+  for (const s of t)
+    typeof s.value == "string" && je.test(s.value.trim()) || n.set(s.field, [...n.get(s.field) ?? [], s]);
   for (const s of n.values()) {
-    const a = s.some((l) => l.op === "null"), c = s.some(
-      (l) => l.op === "nnull" || l.op === "contains" || ["gt", "gte", "lt", "lte"].includes(l.op) || l.op === "eq" && l.value != null && l.value !== ""
+    const a = s.some((h) => h.op === "null"), u = s.some(
+      (h) => h.op === "nnull" || h.op === "contains" || ["gt", "gte", "lt", "lte"].includes(h.op) || h.op === "eq" && h.value != null && h.value !== ""
     );
-    if (a && c) return !0;
-    const u = s.filter((l) => l.op === "eq");
-    for (let l = 1; l < u.length; l++) if (!le(u[0].value, u[l].value)) return !0;
-    const g = u[0];
-    if (g) {
-      if (s.some((p) => p.op === "neq" && le(p.value, g.value)) || s.some((p) => p.op === "nnull") && (g.value == null || g.value === "")) return !0;
-      const l = O(g.value);
-      if (l !== null)
+    if (a && u) return !0;
+    const r = s.filter((h) => h.op === "eq");
+    for (let h = 1; h < r.length; h++) if (!ye(r[0].value, r[h].value)) return !0;
+    const c = r[0];
+    if (c) {
+      if (s.some((p) => p.op === "neq" && ye(p.value, c.value)) || s.some((p) => p.op === "nnull") && (c.value == null || c.value === "")) return !0;
+      const h = D(c.value);
+      if (h !== null)
         for (const p of s) {
-          const m = O(p.value);
-          if (m !== null && (p.op === "gt" && !(l > m) || p.op === "gte" && !(l >= m) || p.op === "lt" && !(l < m) || p.op === "lte" && !(l <= m)))
+          const k = D(p.value);
+          if (k !== null && (p.op === "gt" && !(h > k) || p.op === "gte" && !(h >= k) || p.op === "lt" && !(h < k) || p.op === "lte" && !(h <= k)))
             return !0;
         }
     }
-    let y = -1 / 0, _ = !1, S = 1 / 0, q = !1;
-    for (const l of s) {
-      const p = O(l.value);
-      p !== null && ((l.op === "gt" || l.op === "gte") && (p > y || p === y && l.op === "gt") && (y = p, _ = l.op === "gt"), (l.op === "lt" || l.op === "lte") && (p < S || p === S && l.op === "lt") && (S = p, q = l.op === "lt"));
+    let g = -1 / 0, w = !1, $ = 1 / 0, v = !1;
+    for (const h of s) {
+      const p = D(h.value);
+      p !== null && ((h.op === "gt" || h.op === "gte") && (p > g || p === g && h.op === "gt") && (g = p, w = h.op === "gt"), (h.op === "lt" || h.op === "lte") && (p < $ || p === $ && h.op === "lt") && ($ = p, v = h.op === "lt"));
     }
-    if (y > S || y === S && (_ || q)) return !0;
+    if (g > $ || g === $ && (w || v)) return !0;
   }
   return !1;
 }
-function qe(o) {
+function Ue(t) {
   const n = [];
-  for (const s of _e(o.record_conditions))
+  for (const s of Re(t.record_conditions))
     s.op === "eq" ? n.push(s.value === "" || s.value == null ? { ...s, op: "null" } : s) : s.op === "neq" ? n.push(s.value === "" ? { field: s.field, op: "nnull" } : s) : s.op === "nnull" && n.push(s);
   return n;
 }
-const Ne = {
+const De = {
   cyan: ["#00ceff", "#00ceff"],
   blue: ["#2563eb", "#60a5fa"],
   green: ["#059669", "#34d399"],
   amber: ["#d97706", "#fbbf24"],
   red: ["#dc2626", "#f87171"],
   purple: ["#9333ea", "#c084fc"]
-}, Ee = "#ffffff", Ie = "#0f172a", ae = 3;
-function V(o) {
-  const n = /^#?([0-9a-f]{3}|[0-9a-f]{6})$/i.exec(o.trim());
+}, Fe = "#ffffff", ze = "#0f172a", be = 3;
+function Q(t) {
+  const n = /^#?([0-9a-f]{3}|[0-9a-f]{6})$/i.exec(t.trim());
   if (!n) return null;
   const s = n[1].length === 3 ? [...n[1]].map((a) => a + a).join("") : n[1];
   return [0, 2, 4].map((a) => Number.parseInt(s.slice(a, a + 2), 16));
 }
-function ce([o, n, s]) {
-  const a = (c) => {
-    const u = c / 255;
-    return u <= 0.03928 ? u / 12.92 : ((u + 0.055) / 1.055) ** 2.4;
+function _e([t, n, s]) {
+  const a = (u) => {
+    const r = u / 255;
+    return r <= 0.03928 ? r / 12.92 : ((r + 0.055) / 1.055) ** 2.4;
   };
-  return 0.2126 * a(o) + 0.7152 * a(n) + 0.0722 * a(s);
+  return 0.2126 * a(t) + 0.7152 * a(n) + 0.0722 * a(s);
 }
-function fe(o, n) {
-  const s = V(o), a = V(n);
+function ke(t, n) {
+  const s = Q(t), a = Q(n);
   if (!s || !a) return null;
-  const [c, u] = [ce(s), ce(a)].sort((g, y) => y - g);
-  return (c + 0.05) / (u + 0.05);
+  const [u, r] = [_e(s), _e(a)].sort((c, g) => g - c);
+  return (u + 0.05) / (r + 0.05);
 }
-function Ce(o) {
-  const n = o.trim().toLowerCase(), s = Ne[n] ?? (V(n) ? [n, n] : null);
+function He(t) {
+  const n = t.trim().toLowerCase(), s = De[n] ?? (Q(n) ? [n, n] : null);
   if (!s) return null;
-  const a = fe(s[0], Ee), c = fe(s[1], Ie);
-  return a == null || c == null ? null : a <= c ? { ratio: a, mode: "light" } : { ratio: c, mode: "dark" };
+  const a = ke(s[0], Fe), u = ke(s[1], ze);
+  return a == null || u == null ? null : a <= u ? { ratio: a, mode: "light" } : { ratio: u, mode: "dark" };
 }
-const Re = /* @__PURE__ */ new Set(["grouped", "", "null", "undefined"]), Te = [3, 4, 6, 12], de = { error: 0, warn: 1, info: 2 };
-function Ae(o) {
-  return Re.has(String(o.layout_type ?? ""));
+const Pe = 40, $e = [10, 200], Ze = [
+  { term: "qty", say: "quantity" },
+  { term: "amt", say: "amount" },
+  { term: "num", say: "number" },
+  { term: "no.", say: "number" },
+  { term: "desc", say: "description" },
+  { term: "addr", say: "address" },
+  { term: "dept", say: "department" },
+  { term: "mgr", say: "manager" },
+  { term: "acct", say: "account" },
+  { term: "cust", say: "customer" },
+  { term: "est.", say: "estimated" },
+  { term: "approx", say: "approximate" },
+  { term: "misc", say: "other" },
+  { term: "pct", say: "percent" },
+  { term: "yr", say: "year" },
+  { term: "ref", say: "reference" },
+  { term: "tel", say: "phone" },
+  { term: "w/o", say: "without" },
+  { term: "w/", say: "with" },
+  { term: "utilize", say: "use" },
+  { term: "utilise", say: "use" }
+], xe = [
+  "i",
+  "monday",
+  "tuesday",
+  "wednesday",
+  "thursday",
+  "friday",
+  "saturday",
+  "sunday",
+  "january",
+  "february",
+  "march",
+  "april",
+  "june",
+  "july",
+  "august",
+  "september",
+  "october",
+  "november",
+  "december"
+], Ge = /([\s\-/()[\],&+]+)/, We = /^[A-Z][a-z'’]+$/, Ye = /^[a-z][a-z'’]*$/, Be = /[.:?!]\s*$/;
+function Je(t, n = new Set(xe)) {
+  const s = t.split(Ge);
+  let a = !0, u = "";
+  return s.map((r, c) => {
+    if (c % 2 === 1 || r === "")
+      return u += r, r;
+    const g = /^([^A-Za-z]*)([A-Za-z][A-Za-z'’]*)(.*)$/.exec(r);
+    if (!g)
+      return u += r, r;
+    const [, w, $, v] = g, h = n.has($.toLowerCase()) || /\d/.test(r), p = a || Be.test(u);
+    return a = !1, u += r, h ? r : p ? Ye.test($) ? `${w}${$[0].toUpperCase()}${$.slice(1)}${v}` : r : We.test($) ? `${w}${$.toLowerCase()}${v}` : r;
+  }).join("");
 }
-function Fe(o, n) {
-  var oe, ne;
-  if (!Ae(o.layout)) return [];
-  const s = { ...o, groups: o.groups.filter((e) => e.key !== he) }, a = [], c = (e) => {
-    const t = e.target, r = t.kind === "field" ? `${t.group_key ?? ""}/${t.field}` : t.kind === "group" ? t.key : "";
-    a.push({ id: `${e.rule}:${r}`, ...e });
-  }, u = new Map(n.fields.map((e) => [e.field, e])), g = new Map(s.groups.map((e) => [e.key, e])), y = (e) => {
-    const t = u.get(e);
-    return (t == null ? void 0 : t.label) || ie(e.includes(".") && e.split(".").pop() || e);
-  }, _ = (e) => e.label || ie(e.key), S = String(s.layout.tab_mode ?? "") === "steps", q = [...s.placements].sort((e, t) => e.sort - t.sort), l = q.filter(me), p = (e) => se(e.overrides), m = (e) => {
-    var r;
+function Ke(t) {
+  return t.replace(/[.*+?^${}()|[\]\\/]/g, "\\$&");
+}
+function Xe(t, n, s = /* @__PURE__ */ new Set()) {
+  const a = [], u = [];
+  let r = t;
+  for (const c of n) {
+    const g = c.term.trim();
+    if (!g || s.has(g.toLowerCase())) continue;
+    const w = new RegExp(`(?<![A-Za-z0-9])${Ke(g)}(?![A-Za-z0-9])`, "gi");
+    for (const $ of t.matchAll(w)) {
+      const v = $.index ?? 0;
+      u.some(([h, p]) => v < p && v + $[0].length > h) || (u.push([v, v + $[0].length]), a.push({ text: $[0], say: c.say, at: v }));
+    }
+    r = r.replace(
+      w,
+      ($) => /^[A-Z]/.test($) ? `${c.say.charAt(0).toUpperCase()}${c.say.slice(1)}` : c.say
+    );
+  }
+  return a.sort((c, g) => c.at - g.at), { found: a.map(({ text: c, say: g }) => ({ text: c, say: g })), fixed: r };
+}
+const Ve = /* @__PURE__ */ new Set([
+  "a",
+  "an",
+  "the",
+  "enter",
+  "select",
+  "choose",
+  "pick",
+  "type",
+  "add",
+  "your",
+  "this",
+  "is",
+  "of",
+  "here",
+  "in",
+  "please"
+]);
+function we(t) {
+  return t.toLowerCase().replace(/[^a-z0-9\s]/g, " ").split(/\s+/).filter((n) => n && !Ve.has(n));
+}
+function Qe(t, n) {
+  const s = we(t);
+  if (s.length === 0) return !1;
+  const a = new Set(we(n));
+  return s.every((u) => a.has(u));
+}
+function et(t) {
+  const n = /* @__PURE__ */ new Set([
+    ...xe,
+    ...((t == null ? void 0 : t.allow_words) ?? []).map((r) => String(r).trim().toLowerCase()).filter(Boolean)
+  ]), s = ((t == null ? void 0 : t.jargon) ?? []).filter(
+    (r) => r && typeof r.term == "string" && typeof r.say == "string" && r.term.trim()
+  ), a = new Set(s.map((r) => r.term.trim().toLowerCase())), u = Number(t == null ? void 0 : t.max_label_length);
+  return {
+    off: new Set(((t == null ? void 0 : t.off) ?? []).map(String)),
+    max: Number.isInteger(u) && u >= $e[0] && u <= $e[1] ? u : Pe,
+    // Longer terms first, so "w/o" wins over "w/".
+    jargon: [...s, ...Ze.filter((r) => !a.has(r.term))].sort(
+      (r, c) => c.term.length - r.term.length
+    ),
+    allow: n
+  };
+}
+const tt = /* @__PURE__ */ new Set(["grouped", "", "null", "undefined"]), ot = [3, 4, 6, 12], ve = { error: 0, warn: 1, info: 2 };
+function nt(t) {
+  return tt.has(String(t.layout_type ?? ""));
+}
+function at(t, n) {
+  var le, ae, ue, ce, fe;
+  if (!nt(t.layout)) return [];
+  const s = { ...t, groups: t.groups.filter((e) => e.key !== Ee) }, a = [], u = (e) => {
+    const o = e.target, l = o.kind === "field" ? `${o.group_key ?? ""}/${o.field}` : o.kind === "group" ? o.key : "";
+    a.push({ id: `${e.rule}:${l}`, ...e });
+  }, r = new Map(n.fields.map((e) => [e.field, e])), c = new Map(s.groups.map((e) => [e.key, e])), g = (e) => {
+    const o = r.get(e);
+    return (o == null ? void 0 : o.label) || ge(e.includes(".") && e.split(".").pop() || e);
+  }, w = (e) => e.label || ge(e.key), $ = String(s.layout.tab_mode ?? "") === "steps", v = [...s.placements].sort((e, o) => e.sort - o.sort), h = v.filter(Ae), p = (e) => de(e.overrides), k = (e) => {
+    var l;
     if (e.is_visible === !1 || e.is_visible === 0) return !1;
-    const t = p(e);
-    return !("hidden" in t ? re(t.hidden) : (r = u.get(e.field)) != null && r.hidden);
-  }, U = (e) => {
-    var r;
+    const o = p(e);
+    return !("hidden" in o ? he(o.hidden) : (l = r.get(e.field)) != null && l.hidden);
+  }, F = (e) => {
+    var l;
     if (e.field.includes(".")) return !1;
-    const t = p(e);
-    return "required" in t ? re(t.required) : !!((r = u.get(e.field)) != null && r.required);
-  }, I = (e) => {
-    const t = [], r = /* @__PURE__ */ new Set();
-    let i = e ? g.get(e) : void 0;
-    for (; i && !r.has(i.key); )
-      r.add(i.key), t.push(i), i = i.parent_key ? g.get(i.parent_key) : void 0;
-    return t;
-  }, A = (e) => {
+    const o = p(e);
+    return "required" in o ? he(o.required) : !!((l = r.get(e.field)) != null && l.required);
+  }, z = (e) => {
+    const o = [], l = /* @__PURE__ */ new Set();
+    let i = e ? c.get(e) : void 0;
+    for (; i && !l.has(i.key); )
+      l.add(i.key), o.push(i), i = i.parent_key ? c.get(i.parent_key) : void 0;
+    return o;
+  }, T = (e) => {
     if (e.type !== "tab") return "section";
-    const t = e.parent_key ? g.get(e.parent_key) : void 0;
-    return (t ? String(t.tab_mode ?? "") === "steps" : S) ? "step" : "tab";
-  }, J = qe(s.layout), F = n.roles.filter((e) => !e.admin), x = /* @__PURE__ */ new Map(), ke = (e) => {
-    const t = _e(e.visible_when);
-    if (t.length > 0) {
-      if (ue(t)) return "its show-when rules can never all hold";
-      if (J.length > 0 && ue([...J, ...t]))
+    const o = e.parent_key ? c.get(e.parent_key) : void 0;
+    return (o ? String(o.tab_mode ?? "") === "steps" : $) ? "step" : "tab";
+  }, M = Ue(s.layout), H = n.roles.filter((e) => !e.admin), O = /* @__PURE__ */ new Map(), Ce = (e) => {
+    const o = Re(e.visible_when);
+    if (o.length > 0) {
+      if (me(o)) return "its show-when rules can never all hold";
+      if (M.length > 0 && me([...M, ...o]))
         return "its show-when rules never hold for the records this form opens";
     }
-    const r = new Set(G(e.hidden_for_roles));
-    return F.length > 0 && F.every((i) => r.has(i.id.toUpperCase())) ? "it is hidden from every role but administrators" : null;
+    const l = new Set(K(e.hidden_for_roles));
+    return H.length > 0 && H.every((i) => l.has(i.id.toUpperCase())) ? "it is hidden from every role but administrators" : null;
   };
   for (const e of s.groups) {
-    const t = I(e.key);
-    for (const r of t) {
-      const i = ke(r);
+    const o = z(e.key);
+    for (const l of o) {
+      const i = Ce(l);
       if (i) {
-        x.set(e.key, r === e ? i : `it sits inside ${_(r)}, and ${i}`);
+        O.set(e.key, l === e ? i : `it sits inside ${w(l)}, and ${i}`);
         break;
       }
     }
   }
   for (const e of s.groups) {
-    const t = x.get(e.key);
-    !t || e.parent_key && x.has(e.parent_key) || c({
+    const o = O.get(e.key);
+    !o || e.parent_key && O.has(e.parent_key) || u({
       rule: "unreachable-step",
       severity: "warn",
       target: { kind: "group", key: e.key },
-      message: `${_(e)} never shows: ${t}.`
+      message: `${w(e)} never shows: ${o}.`
     });
   }
   for (const e of s.groups) {
     if (e.type === "content") continue;
-    const t = s.groups.filter((d) => d.parent_key === e.key);
-    if (q.filter((d) => d.group_key === e.key).length > 0 || t.length > 0) continue;
-    const i = e.type === "container" ? "tabs holder" : A(e);
-    c({
+    const o = s.groups.filter((f) => f.parent_key === e.key);
+    if (v.filter((f) => f.group_key === e.key).length > 0 || o.length > 0) continue;
+    const i = e.type === "container" ? "tabs holder" : T(e);
+    u({
       rule: e.type === "tab" ? "empty-step" : "empty-section",
       severity: "warn",
       target: { kind: "group", key: e.key },
-      message: e.type === "container" ? `${_(e)} is a tabs holder with no tabs.` : `The ${i} ${_(e)} holds nothing, so it shows as an empty ${i}.`,
+      message: e.type === "container" ? `${w(e)} is a tabs holder with no tabs.` : `The ${i} ${w(e)} holds nothing, so it shows as an empty ${i}.`,
       fix: {
-        label: `Remove ${_(e)}`,
+        label: `Remove ${w(e)}`,
         ops: [{ op: "group_remove", key: e.key, placements: "ungroup" }]
       }
     });
   }
-  const C = /* @__PURE__ */ new Map();
-  for (const e of l) C.set(e.field, [...C.get(e.field) ?? [], e]);
-  const Z = (e) => !(e.group_key && x.has(e.group_key)), be = (e) => (C.get(e) ?? []).some((t) => m(t) && Z(t)), H = /* @__PURE__ */ new Map(), X = (e, t, r) => {
-    const i = H.get(e) ?? /* @__PURE__ */ new Map();
-    i.has(t) || i.set(t, r), H.set(e, i);
-  }, Q = (e, t) => e.can_write && (e.writable_fields == null || e.writable_fields.includes(t));
-  for (const [e, t] of C)
-    if (t.some(U))
-      for (const r of F) Q(r, e) && X(e, r.id, "required");
+  const x = /* @__PURE__ */ new Map();
+  for (const e of h) x.set(e.field, [...x.get(e.field) ?? [], e]);
+  const W = (e) => !(e.group_key && O.has(e.group_key)), Te = (e) => (x.get(e) ?? []).some((o) => k(o) && W(o)), Y = /* @__PURE__ */ new Map(), te = (e, o, l) => {
+    const i = Y.get(e) ?? /* @__PURE__ */ new Map();
+    i.has(o) || i.set(o, l), Y.set(e, i);
+  }, oe = (e, o) => e.can_write && (e.writable_fields == null || e.writable_fields.includes(o));
+  for (const [e, o] of x)
+    if (o.some(F))
+      for (const l of H) oe(l, e) && te(e, l.id, "required");
   for (const e of n.requirements) {
-    if (!C.has(e.field)) continue;
-    const t = e.role_ids.length ? e.role_ids.map((r) => r.toUpperCase()) : null;
-    for (const r of F)
-      t && !t.includes(r.id.toUpperCase()) || Q(r, e.field) && X(e.field, r.id, `to ${e.transition}`);
+    if (!x.has(e.field)) continue;
+    const o = e.role_ids.length ? e.role_ids.map((l) => l.toUpperCase()) : null;
+    for (const l of H)
+      o && !o.includes(l.id.toUpperCase()) || oe(l, e.field) && te(e.field, l.id, `to ${e.transition}`);
   }
-  const $e = new Map(n.roles.map((e) => [e.id.toUpperCase(), e.name]));
-  for (const [e, t] of C) {
-    const r = t[0], i = { kind: "field", field: e, group_key: r.group_key }, d = y(e), w = t.some(U);
-    if (w && !t.some(m)) {
-      const f = t.find((k) => k.is_visible === !1 || k.is_visible === 0);
-      c({
+  const Me = new Map(n.roles.map((e) => [e.id.toUpperCase(), e.name]));
+  for (const [e, o] of x) {
+    const l = o[0], i = { kind: "field", field: e, group_key: l.group_key }, f = g(e), m = o.some(F);
+    if (m && !o.some(k)) {
+      const d = o.find((L) => L.is_visible === !1 || L.is_visible === 0);
+      u({
         rule: "required-hidden",
         severity: "error",
         target: i,
-        message: `${d} is required, but this form hides it — nobody can fill it here.`,
-        fix: f ? {
-          label: `Show ${d}`,
+        message: `${f} is required, but this form hides it — nobody can fill it here.`,
+        fix: d ? {
+          label: `Show ${f}`,
           ops: [
             {
               op: "update_placement",
-              at: { field: e, group_key: f.group_key },
+              at: { field: e, group_key: d.group_key },
               patch: { is_visible: !0 }
             }
           ]
         } : void 0
       });
     }
-    const M = H.get(e);
-    if (M && t.some(m)) {
-      const f = /* @__PURE__ */ new Map();
-      for (const h of M.keys()) {
-        const b = h.toUpperCase();
-        let v = null, E = !1;
-        for (const L of t.filter(m)) {
-          const D = I(L.group_key).find((ve) => G(ve.hidden_for_roles).includes(b)), R = L.group_key ? g.get(L.group_key) : void 0, $ = R && G(R.locked_for_roles).includes(b) ? R : void 0;
-          if (D) v ?? (v = { group: D, how: "hidden" });
-          else if ($) v ?? (v = { group: $, how: "locked" });
+    const _ = Y.get(e);
+    if (_ && o.some(k)) {
+      const d = /* @__PURE__ */ new Map();
+      for (const y of _.keys()) {
+        const b = y.toUpperCase();
+        let S = null, C = !1;
+        for (const U of o.filter(k)) {
+          const Z = z(U.group_key).find((qe) => K(qe.hidden_for_roles).includes(b)), I = U.group_key ? c.get(U.group_key) : void 0, A = I && K(I.locked_for_roles).includes(b) ? I : void 0;
+          if (Z) S ?? (S = { group: Z, how: "hidden" });
+          else if (A) S ?? (S = { group: A, how: "locked" });
           else {
-            E = !0;
+            C = !0;
             break;
           }
         }
-        !E && v && f.set(h, v);
+        !C && S && d.set(y, S);
       }
-      const k = /* @__PURE__ */ new Map();
-      for (const [h, b] of f) {
-        const v = `${b.how}|${b.group.key}`, E = k.get(v) ?? { ...b, roles: [] };
-        E.roles.push(h), k.set(v, E);
+      const L = /* @__PURE__ */ new Map();
+      for (const [y, b] of d) {
+        const S = `${b.how}|${b.group.key}`, C = L.get(S) ?? { ...b, roles: [] };
+        C.roles.push(y), L.set(S, C);
       }
-      for (const h of k.values()) {
-        const b = h.roles.map(($) => $e.get($.toUpperCase()) ?? $), E = [...new Set(h.roles.map(($) => M.get($) ?? "required"))].find(($) => $.startsWith("to ")), L = E ? `${B(b)} must fill ${d} ${E}` : `${d} is required and ${B(b)} can edit these records`, z = h.how === "hidden" ? "hidden_for_roles" : "locked_for_roles", D = new Set(h.roles.map(($) => $.toUpperCase())), R = T(h.group[z]).filter(
-          ($) => !D.has(String($).toUpperCase())
+      for (const y of L.values()) {
+        const b = y.roles.map((A) => Me.get(A.toUpperCase()) ?? A), C = [...new Set(y.roles.map((A) => _.get(A) ?? "required"))].find((A) => A.startsWith("to ")), U = C ? `${G(b)} must fill ${f} ${C}` : `${f} is required and ${G(b)} can edit these records`, J = y.how === "hidden" ? "hidden_for_roles" : "locked_for_roles", Z = new Set(y.roles.map((A) => A.toUpperCase())), I = q(y.group[J]).filter(
+          (A) => !Z.has(String(A).toUpperCase())
         );
-        c({
+        u({
           rule: "required-hidden-for-role",
           severity: "error",
-          target: { kind: "field", field: e, group_key: r.group_key },
-          message: `${L}, but ${_(h.group)} is ${h.how} for ${b.length === 1 ? "that role" : "those roles"}.`,
+          target: { kind: "field", field: e, group_key: l.group_key },
+          message: `${U}, but ${w(y.group)} is ${y.how} for ${b.length === 1 ? "that role" : "those roles"}.`,
           fix: {
-            label: `${h.how === "hidden" ? "Show" : "Unlock"} ${_(h.group)} for ${B(b)}`,
+            label: `${y.how === "hidden" ? "Show" : "Unlock"} ${w(y.group)} for ${G(b)}`,
             ops: [
               {
                 op: "group_update",
-                key: h.group.key,
-                patch: { [z]: R.length ? JSON.stringify(R) : null }
+                key: y.group.key,
+                patch: { [J]: I.length ? JSON.stringify(I) : null }
               }
             ]
           }
         });
       }
     }
-    if (t.some(m))
-      for (const f of ((oe = u.get(e)) == null ? void 0 : oe.cascade_parents) ?? []) {
-        if (!f || f === e || be(f)) continue;
-        const k = C.has(f), h = t.find(m) ?? r, b = q.filter((v) => v.group_key === h.group_key).findIndex((v) => v.field === e);
-        c({
+    if (o.some(k))
+      for (const d of ((le = r.get(e)) == null ? void 0 : le.cascade_parents) ?? []) {
+        if (!d || d === e || Te(d)) continue;
+        const L = x.has(d), y = o.find(k) ?? l, b = v.filter((S) => S.group_key === y.group_key).findIndex((S) => S.field === e);
+        u({
           rule: "cascade-missing",
           severity: "warn",
-          target: { kind: "field", field: e, group_key: h.group_key },
-          message: k ? `${d} narrows its choices by ${y(f)}, which is hidden on this form.` : `${d} narrows its choices by ${y(f)}, which is not on this form.`,
-          fix: k ? void 0 : {
-            label: `Add ${y(f)} before ${d}`,
+          target: { kind: "field", field: e, group_key: y.group_key },
+          message: L ? `${f} narrows its choices by ${g(d)}, which is hidden on this form.` : `${f} narrows its choices by ${g(d)}, which is not on this form.`,
+          fix: L ? void 0 : {
+            label: `Add ${g(d)} before ${f}`,
             ops: [
               {
                 op: "place",
-                field: f,
-                group_key: h.group_key,
+                field: d,
+                group_key: y.group_key,
                 index: Math.max(0, b)
               }
             ]
           }
         });
       }
-    if (!w) {
-      if (!t.some(m))
-        c({
+    if (!m) {
+      if (!o.some(k))
+        u({
           rule: "unreachable-field",
           severity: "info",
           target: i,
-          message: `${d} is hidden everywhere it is placed, so nobody sees it on this form.`
+          message: `${f} is hidden everywhere it is placed, so nobody sees it on this form.`
         });
-      else if (!t.some((f) => m(f) && Z(f))) {
-        const f = g.get(((ne = t.find(m)) == null ? void 0 : ne.group_key) ?? "");
-        c({
+      else if (!o.some((d) => k(d) && W(d))) {
+        const d = c.get(((ae = o.find(k)) == null ? void 0 : ae.group_key) ?? "");
+        u({
           rule: "unreachable-field",
           severity: "info",
           target: i,
-          message: `${d} only sits in ${f ? _(f) : "a part of the form"}, which never shows.`
+          message: `${f} only sits in ${d ? w(d) : "a part of the form"}, which never shows.`
         });
       }
     }
-    const N = t.filter(m), Y = (f) => {
-      var k;
-      return ((k = u.get(e)) == null ? void 0 : k.type) === "alias" || f.group_key != null && l.filter((h) => h.group_key === f.group_key).length === 1;
+    const E = o.filter(k), R = (d) => {
+      var L;
+      return ((L = r.get(e)) == null ? void 0 : L.type) === "alias" || d.group_key != null && h.filter((y) => y.group_key === d.group_key).length === 1;
     };
-    if (N.length > 0 && N.every((f) => p(f).label === "") && !N.some(Y)) {
-      const f = N[0], { label: k, ...h } = p(f);
-      c({
-        rule: w ? "a11y-required-no-marker" : "a11y-no-label",
+    if (E.length > 0 && E.every((d) => p(d).label === "") && !E.some(R)) {
+      const d = E[0], { label: L, ...y } = p(d);
+      u({
+        rule: m ? "a11y-required-no-marker" : "a11y-no-label",
         severity: "warn",
-        target: { kind: "field", field: e, group_key: f.group_key },
-        message: w ? `${d} is required, but its label is hidden — so is the required mark.` : `${d} shows no label; people and screen readers cannot tell what it asks for.`,
+        target: { kind: "field", field: e, group_key: d.group_key },
+        message: m ? `${f} is required, but its label is hidden — so is the required mark.` : `${f} shows no label; people and screen readers cannot tell what it asks for.`,
         fix: {
-          label: `Show the label of ${d}`,
+          label: `Show the label of ${f}`,
           ops: [
             {
               op: "update_placement",
-              at: { field: e, group_key: f.group_key },
-              patch: { overrides: Object.keys(h).length ? h : null }
+              at: { field: e, group_key: d.group_key },
+              patch: { overrides: Object.keys(y).length ? y : null }
             }
           ]
         }
       });
     }
   }
-  const ee = (e) => {
-    var r;
-    const t = e.col_span ?? ((r = u.get(e.field)) == null ? void 0 : r.col_span) ?? 12;
-    return Te.includes(Number(t)) ? Number(t) : 12;
-  }, P = /* @__PURE__ */ new Map();
-  for (const e of l)
-    e.group_key === Se || !m(e) || P.set(e.group_key, [...P.get(e.group_key) ?? [], e]);
-  for (const [e, t] of P) {
-    const r = [];
-    for (const i of t) {
-      const d = ee(i), w = r[r.length - 1];
-      w && w.free >= d ? (w.items.push(i), w.free -= d) : r.push({ items: [i], free: 12 - d });
+  const ne = (e) => {
+    var l;
+    const o = e.col_span ?? ((l = r.get(e.field)) == null ? void 0 : l.col_span) ?? 12;
+    return ot.includes(Number(o)) ? Number(o) : 12;
+  }, B = /* @__PURE__ */ new Map();
+  for (const e of h)
+    e.group_key === Oe || !k(e) || B.set(e.group_key, [...B.get(e.group_key) ?? [], e]);
+  for (const [e, o] of B) {
+    const l = [];
+    for (const i of o) {
+      const f = ne(i), m = l[l.length - 1];
+      m && m.free >= f ? (m.items.push(i), m.free -= f) : l.push({ items: [i], free: 12 - f });
     }
-    for (let i = 0; i + 1 < r.length; i++) {
-      const d = r[i];
-      if (d.free <= 0) continue;
-      const w = r.slice(i + 1, i + 3).flatMap((f) => f.items), M = w.slice(1).find((f) => ee(f) <= d.free);
-      if (!M) continue;
-      const N = d.items[d.items.length - 1], Y = t.indexOf(N) + 1;
-      c({
+    for (let i = 0; i + 1 < l.length; i++) {
+      const f = l[i];
+      if (f.free <= 0) continue;
+      const m = l.slice(i + 1, i + 3).flatMap((d) => d.items), _ = m.slice(1).find((d) => ne(d) <= f.free);
+      if (!_) continue;
+      const E = f.items[f.items.length - 1], R = o.indexOf(E) + 1;
+      u({
         rule: "a11y-tab-order",
         severity: "info",
-        target: { kind: "field", field: M.field, group_key: e },
-        message: `${y(M.field)} would fit beside ${y(N.field)}, but comes after ${y(w[0].field)} — the keyboard order runs down, then back up.`,
+        target: { kind: "field", field: _.field, group_key: e },
+        message: `${g(_.field)} would fit beside ${g(E.field)}, but comes after ${g(m[0].field)} — the keyboard order runs down, then back up.`,
         fix: {
-          label: `Move ${y(M.field)} beside ${y(N.field)}`,
+          label: `Move ${g(_.field)} beside ${g(E.field)}`,
           ops: [
             {
               op: "move",
-              from: { field: M.field, group_key: e },
+              from: { field: _.field, group_key: e },
               to_group_key: e,
-              index: Y
+              index: R
             }
           ]
         }
@@ -399,92 +526,211 @@ function Fe(o, n) {
       break;
     }
   }
-  const j = (e, t, r, i) => {
+  const P = (e, o, l, i) => {
     if (typeof e != "string" || !e) return;
-    const d = Ce(e);
-    !d || d.ratio >= ae || a.push({
+    const f = He(e);
+    !f || f.ratio >= be || a.push({
       id: `a11y-contrast:${i}:${e}`,
       rule: "a11y-contrast",
       severity: "warn",
-      target: r,
-      message: `${t} uses ${e}, which reads at ${d.ratio.toFixed(1)}:1 on the ${d.mode} background (${ae}:1 is the least).`
+      target: l,
+      message: `${o} uses ${e}, which reads at ${f.ratio.toFixed(1)}:1 on the ${f.mode} background (${be}:1 is the least).`
     });
   };
-  for (const e of q) {
-    const t = { kind: "field", field: e.field, group_key: e.group_key }, r = ye.test(e.field) ? "The subtitle" : y(e.field);
-    j(K(e, "__color__"), r, t, `${e.group_key}/${e.field}`);
-    for (const i of T(K(e, "__threshold__")))
-      j(i == null ? void 0 : i.color, `A threshold on ${r}`, t, `${e.group_key}/${e.field}`);
-    for (const i of T(se(K(e, "__subtitle_config__")).fields))
-      j(
+  for (const e of v) {
+    const o = { kind: "field", field: e.field, group_key: e.group_key }, l = V.test(e.field) ? "The subtitle" : g(e.field);
+    P(X(e, "__color__"), l, o, `${e.group_key}/${e.field}`);
+    for (const i of q(X(e, "__threshold__")))
+      P(i == null ? void 0 : i.color, `A threshold on ${l}`, o, `${e.group_key}/${e.field}`);
+    for (const i of q(de(X(e, "__subtitle_config__")).fields))
+      P(
         i == null ? void 0 : i.color,
-        `The subtitle part ${y(String((i == null ? void 0 : i.field) ?? ""))}`,
-        t,
+        `The subtitle part ${g(String((i == null ? void 0 : i.field) ?? ""))}`,
+        o,
         `subtitle/${String((i == null ? void 0 : i.field) ?? "")}`
       );
   }
   for (const e of s.groups)
-    for (const t of T(e.summary_fields))
-      j(
-        t == null ? void 0 : t.color,
-        `The summary of ${_(e)}`,
+    for (const o of q(e.summary_fields))
+      P(
+        o == null ? void 0 : o.color,
+        `The summary of ${w(e)}`,
         { kind: "group", key: e.key },
         `summary/${e.key}`
       );
-  const te = /* @__PURE__ */ new Set(), we = (e) => {
-    var t, r;
-    return e.kind === "field" && !!((t = o.inherited) != null && t.fields.includes(e.field)) || e.kind === "group" && !!((r = o.inherited) != null && r.groups.includes(e.key));
+  const N = et(n.style), j = (e) => !N.off.has(e), Ne = (e) => e.trim() !== "" && !e.includes("{{"), se = (e, o, l, i, f) => {
+    const m = e.text.trim();
+    if (Ne(m)) {
+      if (j("label-sentence-case")) {
+        const _ = Je(m, N.allow);
+        _ !== m && a.push({
+          id: `label-sentence-case:${l}`,
+          rule: "label-sentence-case",
+          severity: "info",
+          target: o,
+          message: `${i} “${m}” is not in sentence case — house style is “${_}”.`,
+          fix: { label: `Change ${f} to “${_}”`, ops: e.ops(_) }
+        });
+      }
+      if (j("label-too-long") && m.length > N.max && a.push({
+        id: `label-too-long:${l}`,
+        rule: "label-too-long",
+        severity: "info",
+        target: o,
+        message: `${i} “${m}” is ${m.length} characters; house style keeps labels to ${N.max}. Move the detail into help text.`
+      }), j("label-jargon")) {
+        const _ = Xe(m, N.jargon, N.allow);
+        if (_.found.length > 0) {
+          const E = _.found.map((R) => `“${R.text}” (say “${R.say}”)`);
+          a.push({
+            id: `label-jargon:${l}`,
+            rule: "label-jargon",
+            severity: "info",
+            target: o,
+            message: `${i} “${m}” uses ${G(E)}.`,
+            fix: _.fixed !== m ? { label: `Change ${f} to “${_.fixed}”`, ops: e.ops(_.fixed) } : void 0
+          });
+        }
+      }
+    }
+  }, re = /* @__PURE__ */ new Map();
+  for (const [e, o] of x) {
+    const i = o.filter((b) => k(b) && W(b))[0];
+    if (!i) continue;
+    const f = p(i), m = { kind: "field", field: e, group_key: i.group_key }, _ = { field: e, group_key: i.group_key }, E = typeof f.label == "string" && f.label !== "" ? f.label : null, R = f.label === "" ? null : E != null ? {
+      text: E,
+      ops: (b) => [
+        { op: "update_placement", at: _, patch: { overrides: { ...f, label: b } } }
+      ]
+    } : i.label_override ? {
+      text: i.label_override,
+      ops: (b) => [{ op: "update_placement", at: _, patch: { label_override: b } }]
+    } : (ue = r.get(e)) != null && ue.label ? {
+      text: String((ce = r.get(e)) == null ? void 0 : ce.label),
+      // The field's own label stays; this form shows the fixed one.
+      ops: (b) => [
+        { op: "update_placement", at: _, patch: { overrides: { ...f, label: b } } }
+      ]
+    } : null;
+    R && se(R, m, `${i.group_key ?? ""}/${e}`, "The label", "the label");
+    const d = f.label === "" ? null : ((R == null ? void 0 : R.text) ?? g(e)).trim(), L = typeof f.note == "string" && f.note.trim() !== "" ? f.note : null, y = L ?? (((fe = r.get(e)) == null ? void 0 : fe.note) || null);
+    if (j("help-repeats-label") && d && y && Qe(y, d)) {
+      const { note: b, ...S } = f;
+      a.push({
+        id: `help-repeats-label:${i.group_key ?? ""}/${e}`,
+        rule: "help-repeats-label",
+        severity: "info",
+        target: m,
+        message: `The help text of ${d} (“${y.trim()}”) only repeats the label. Say what to enter, or leave it out.`,
+        fix: L ? {
+          label: `Remove the help text of ${d}`,
+          ops: [
+            {
+              op: "update_placement",
+              at: _,
+              patch: { overrides: Object.keys(S).length ? S : null }
+            }
+          ]
+        } : void 0
+      });
+    }
+    if (d && j("label-duplicate")) {
+      const b = d.toLowerCase(), S = re.get(b);
+      S && S !== e ? a.push({
+        id: `label-duplicate:${i.group_key ?? ""}/${e}`,
+        rule: "label-duplicate",
+        severity: "warn",
+        target: m,
+        message: `${e} and ${S} both show the label “${d}” on this form — people cannot tell them apart.`
+      }) : re.set(b, e);
+    }
+  }
+  for (const e of s.groups) {
+    if (e.type === "content" || e.type === "container" || V.test(e.key) || O.has(e.key)) continue;
+    const o = T(e);
+    se(
+      {
+        text: e.label,
+        ops: (l) => [{ op: "group_update", key: e.key, patch: { label: l } }]
+      },
+      { kind: "group", key: e.key },
+      e.key,
+      `The ${o} title`,
+      `the ${o} title`
+    );
+  }
+  const ie = /* @__PURE__ */ new Set(), Ie = (e) => {
+    var o, l;
+    return e.kind === "field" && !!((o = t.inherited) != null && o.fields.includes(e.field)) || e.kind === "group" && !!((l = t.inherited) != null && l.groups.includes(e.key));
   };
-  return a.filter((e) => te.has(e.id) ? !1 : (te.add(e.id), !0)).map((e) => e.fix && we(e.target) ? { ...e, fix: void 0 } : e).sort((e, t) => de[e.severity] - de[t.severity]);
+  return a.filter((e) => ie.has(e.id) ? !1 : (ie.add(e.id), !0)).map((e) => e.fix && Ie(e.target) ? { ...e, fix: void 0 } : e).sort((e, o) => ve[e.severity] - ve[o.severity]);
 }
-const pe = 30, ge = 7;
-function Le(o) {
+const Se = 30, Le = 7, st = 5;
+function rt(t) {
   const n = new Set(
-    o.placements.filter((u) => me(u) && u.is_visible !== !1 && u.is_visible !== 0).map((u) => u.field)
-  ).size, s = new Set(o.groups.map((u) => u.key)), a = o.groups.filter((u) => u.type === "container").map((u) => u.key), c = o.groups.filter(
-    (u) => u.type === "tab" && (u.parent_key == null || !s.has(u.parent_key) || a.includes(u.parent_key))
+    t.placements.filter((r) => Ae(r) && r.is_visible !== !1 && r.is_visible !== 0).map((r) => r.field)
+  ).size, s = new Set(t.groups.map((r) => r.key)), a = t.groups.filter((r) => r.type === "container").map((r) => r.key), u = t.groups.filter(
+    (r) => r.type === "tab" && (r.parent_key == null || !s.has(r.parent_key) || a.includes(r.parent_key))
   ).length;
-  return { fields: n, steps: c };
+  return { fields: n, steps: u };
 }
-function xe(o, n) {
-  const { fields: s, steps: a } = Le(o), c = [];
-  s > pe && c.push({
+function ut(t, n) {
+  const { fields: s, steps: a } = rt(t), u = [];
+  s > Se && u.push({
     label: `${s} fields on one form`,
-    points: Math.min(20, Math.ceil((s - pe) / 3))
-  }), a > ge && c.push({
+    points: Math.min(20, Math.ceil((s - Se) / 3))
+  }), a > Le && u.push({
     label: `${a} steps or tabs`,
-    points: Math.min(10, (a - ge) * 2)
+    points: Math.min(10, (a - Le) * 2)
   });
-  const u = n.filter((l) => l.rule === "unreachable-field").length;
-  u > 0 && c.push({
-    label: `${u} ${u === 1 ? "field" : "fields"} nobody sees`,
-    points: Math.min(20, u * 2)
+  const r = n.filter((p) => p.rule === "unreachable-field").length;
+  r > 0 && u.push({
+    label: `${r} ${r === 1 ? "field" : "fields"} nobody sees`,
+    points: Math.min(20, r * 2)
+  });
+  const c = n.filter(
+    (p) => p.rule !== "label-duplicate" && pe.includes(p.rule)
+  ).length;
+  c > 0 && u.push({
+    label: `${c} label style ${c === 1 ? "tip" : "tips"}`,
+    points: Math.min(st, c)
   });
-  const g = n.filter((l) => l.rule !== "unreachable-field"), y = (l) => g.filter((p) => p.severity === l).length, _ = [
+  const g = n.filter(
+    (p) => p.rule !== "unreachable-field" && (p.rule === "label-duplicate" || !pe.includes(p.rule))
+  ), w = (p) => g.filter((k) => k.severity === p).length, $ = [
     ["error", 10, "problem", "problems"],
     ["warn", 4, "warning", "warnings"],
     ["info", 1, "suggestion", "suggestions"]
   ];
-  let S = 0;
-  for (const [l, p, m, U] of _) {
-    const I = y(l);
-    if (I === 0) continue;
-    const A = Math.min(50 - S, I * p);
-    A <= 0 || (S += A, c.push({ label: `${I} ${I === 1 ? m : U}`, points: A }));
+  let v = 0;
+  for (const [p, k, F, z] of $) {
+    const T = w(p);
+    if (T === 0) continue;
+    const M = Math.min(50 - v, T * k);
+    M <= 0 || (v += M, u.push({ label: `${T} ${T === 1 ? F : z}`, points: M }));
   }
-  return { score: Math.max(0, 100 - c.reduce((l, p) => l + p.points, 0)), costs: c };
+  return { score: Math.max(0, 100 - u.reduce((p, k) => p + k.points, 0)), costs: u };
 }
 export {
-  ae as CONTRAST_MIN,
-  Ue as EMPTY_LINT_CONTEXT,
-  pe as HEALTH_FIELD_LIMIT,
-  ge as HEALTH_STEP_LIMIT,
-  Ce as colourContrast,
-  ue as conditionsContradict,
-  fe as contrastRatio,
-  Ae as isFormLayout,
-  xe as layoutHealth,
-  Le as layoutShape,
-  Fe as lintLayout,
-  Oe as mergeInherited
+  be as CONTRAST_MIN,
+  Ze as DEFAULT_JARGON,
+  Pe as DEFAULT_MAX_LABEL_LENGTH,
+  lt as EMPTY_LINT_CONTEXT,
+  Se as HEALTH_FIELD_LIMIT,
+  Le as HEALTH_STEP_LIMIT,
+  $e as MAX_LABEL_LENGTH_RANGE,
+  st as STYLE_POINTS_MAX,
+  pe as STYLE_RULES,
+  He as colourContrast,
+  me as conditionsContradict,
+  ke as contrastRatio,
+  Xe as findJargon,
+  Qe as helpRepeatsLabel,
+  nt as isFormLayout,
+  ut as layoutHealth,
+  rt as layoutShape,
+  at as lintLayout,
+  it as mergeInherited,
+  et as resolveStyle,
+  Je as toSentenceCase
 };