hyperbook 0.113.1 → 0.113.3

package/dist/assets/directive-bitflow/{index-CjscG0z6.js → index-CCMI6UK4.js}

@@ -1,6 +1,6 @@
-import { L as W, a4 as H, ac as se, ad as Y, P as re, a9 as D, a2 as N, j as s, b as I, a5 as ne, a as C, aa as ie, s as le } from "./dom-uYx_3K1r.js";
-import { S as oe, v as de, P as ce, A as z, _ as $, e as U, y as J, M as P, t as pe, E as he, L as ue, R as be } from "./bitLoaders-DIGwTcpd.js";
-const we = ["rearrange", "write"], fe = ne(we), me = W({
+import { P as F, a4 as H, ac as se, ad as J, Y as re, a9 as P, a2 as N, j as s, b as I, a5 as ne, a as C, aa as ie, s as le } from "./dom-B6NPWBb1.js";
+import { $ as oe, e as de, M as ce, g as z, i as U, P as $, C as Q, F as T, r as pe, B as he, U as ue, H as be } from "./bitLoaders-7qanePQL.js";
+const we = ["rearrange", "write"], fe = ne(we), me = F({
   /** Stable across edits, so an answer keeps pointing at the same step. */
   id: N().min(1),
   /** "After pass 1", "push(4)" — short, and plain text: it also has to work
@@ -12,7 +12,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
   if (e.length !== t.length) return !1;
   const r = [...e].sort(), l = [...t].sort();
   return r.every((a, i) => a === l[i]);
-}, ve = W({
+}, ve = F({
   instruction: N().default(""),
   /** The starting array, shown read-only above the steps. */
   initial: H(N()).default([]),
@@ -20,19 +20,19 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
   mode: fe.default("rearrange"),
   /** Index numbers above the cells. Off only for an array where position is
    *  not part of the question. */
-  showIndices: D().default(!0),
-  caseSensitive: D().default(!1),
+  showIndices: P().default(!0),
+  caseSensitive: P().default(!1),
   /** A point per correct step rather than one for the whole task. On by
    *  default: a sort that goes wrong on the last pass still had every
    *  earlier one right. */
-  partialCredit: D().default(!0),
+  partialCredit: P().default(!0),
   /**
    * `write` mode only: how many boxes a row has. Omitted means the widest
    * row already authored — `initial` or any step's `expected` — so a row
    * that only ever shrinks needs nothing set here at all.
    */
   slots: re().int().positive().optional(),
-  evaluation: se.default(Y)
+  evaluation: se.default(J)
 }).check((e) => {
   const { initial: t, steps: r, mode: l, evaluation: a } = e.value, i = r.map((d) => d.id);
   new Set(i).size !== i.length && e.issues.push({
@@ -58,32 +58,32 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
     path: ["steps"],
     message: "Add at least one step."
   }));
-}), Te = W({
+}), De = F({
   /** One row per step, in order. A step the learner has not touched yet has
    *  no entry here at all — see `carryForward`. */
   rows: H(H(N())).default([])
-}), Q = (e, t) => e?.rows?.[t], L = (e, t, r) => Q(t, r) || (r <= 0 ? [...e.initial] : L(e, t, r - 1)), X = (e) => e.slots && e.slots > 0 ? e.slots : Math.max(0, e.initial.length, ...e.steps.map((t) => t.expected.length)), O = (e, t, r) => {
-  const l = L(e, t, r);
+}), X = (e, t) => e?.rows?.[t], k = (e, t, r) => X(t, r) || (r <= 0 ? [...e.initial] : k(e, t, r - 1)), _ = (e) => e.slots && e.slots > 0 ? e.slots : Math.max(0, e.initial.length, ...e.steps.map((t) => t.expected.length)), O = (e, t, r) => {
+  const l = k(e, t, r);
   if (e.mode !== "write") return l;
-  const a = X(e);
+  const a = _(e);
   return Array.from({ length: a }, (i, d) => l[d] ?? "");
 }, q = (e, t, r, l) => {
   const a = [];
   for (let i = 0; i < r; i++)
-    a[i] = Q(t, i) ?? L(e, t, i);
+    a[i] = X(t, i) ?? k(e, t, i);
   return a[r] = l, { rows: a };
 }, R = (e, t) => {
   const r = e.trim();
   return t ? r : r.toLowerCase();
-}, G = (e) => {
+}, B = (e) => {
   const t = [...e];
   for (; t.length > 0 && t[t.length - 1].trim() === ""; )
     t.pop();
   return t;
 }, xe = (e, t, r) => {
-  const l = G(e).map(
+  const l = B(e).map(
     (i) => R(i, r)
-  ), a = G(t).map((i) => R(i, r));
+  ), a = B(t).map((i) => R(i, r));
   return l.length === a.length && l.every((i, d) => i === a[d]);
 }, ye = (e, t, r) => {
   const l = Math.max(e.length, t.length);
@@ -91,19 +91,19 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
     { length: l },
     (a, i) => R(e[i] ?? "", r) !== R(t[i] ?? "", r)
   );
-}, Se = (e, t) => e.steps.map((r, l) => {
-  const a = L(e, t, l);
+}, je = (e, t) => e.steps.map((r, l) => {
+  const a = k(e, t, l);
   return {
     state: xe(r.expected, a, e.caseSensitive) ? "correct" : "wrong",
     diffs: ye(r.expected, a, e.caseSensitive)
   };
-}), je = ({
+}), Se = ({
   data: e,
   answer: t
 }) => {
   if (e.evaluation.mode === "skip")
     return { state: "unknown", allowRetry: !1 };
-  const r = Se(e, t), l = r.length, a = r.filter((h) => h.state === "correct").length, i = l > 0 && a === l, d = e.partialCredit && l > 0 ? { earned: a, possible: l } : { earned: i ? 1 : 0, possible: 1 };
+  const r = je(e, t), l = r.length, a = r.filter((h) => h.state === "correct").length, i = l > 0 && a === l, d = e.partialCredit && l > 0 ? { earned: a, possible: l } : { earned: i ? 1 : 0, possible: 1 };
   return {
     state: i ? "correct" : "wrong",
     score: d,
@@ -113,7 +113,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
       diffs: r.map((h) => h.diffs)
     }
   };
-}, T = {
+}, D = {
   en: {
     name: "Algorithm steps",
     description: "An array and the steps of an algorithm over it. The learner writes down or rearranges the array as it stands after each step.",
@@ -148,7 +148,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
     correct: "richtig",
     wrong: "falsch"
   }
-}, Le = ".bitflow-array-steps{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-array-block{display:flex;flex-direction:column;gap:var(--bitflow-space-xxsmall)}.bitflow-array-step-header{display:flex;align-items:center;gap:var(--bitflow-space-xsmall)}.bitflow-array-cells{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xsmall);padding:0;margin:0;list-style:none}.bitflow-array-slot{display:flex;flex-direction:column;align-items:center;gap:var(--bitflow-space-xxsmall)}.bitflow-array-index{font-size:var(--bitflow-font-size-small);font-variant-numeric:tabular-nums;color:var(--bitflow-color-text-muted)}.bitflow-array-cell{display:flex;align-items:center;justify-content:center;min-width:44px;min-height:44px;padding:var(--bitflow-space-xxsmall) var(--bitflow-space-xsmall);font:inherit;font-variant-numeric:tabular-nums;color:var(--bitflow-color-text);text-align:center;background:var(--bitflow-color-surface);border:var(--bitflow-border-width) solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard)}.bitflow-array-cell-fixed{background:var(--bitflow-color-neutral-100)}.bitflow-array-cell-button{cursor:pointer}.bitflow-array-cell-button:disabled{cursor:default}.bitflow-array-cell-input{width:3.5rem}.bitflow-array-cell.bitflow-array-cell-held{background:var(--bitflow-color-neutral-100);border-color:var(--bitflow-color-primary);box-shadow:0 0 0 2px var(--bitflow-color-primary)}.bitflow-array-cell.bitflow-array-cell-correct{background:color-mix(in srgb,var(--bitflow-color-correct) 12%,var(--bitflow-color-surface));border-color:var(--bitflow-color-correct)}.bitflow-array-cell.bitflow-array-cell-wrong{background:color-mix(in srgb,var(--bitflow-color-wrong) 12%,var(--bitflow-color-surface));border-color:var(--bitflow-color-wrong)}", ke = {
+}, ke = ".bitflow-array-steps{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-array-block{display:flex;flex-direction:column;gap:var(--bitflow-space-xxsmall)}.bitflow-array-step-header{display:flex;align-items:center;gap:var(--bitflow-space-xsmall)}.bitflow-array-cells{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xsmall);padding:0;margin:0;list-style:none}.bitflow-array-slot{display:flex;flex-direction:column;align-items:center;gap:var(--bitflow-space-xxsmall)}.bitflow-array-index{font-size:var(--bitflow-font-size-small);font-variant-numeric:tabular-nums;color:var(--bitflow-color-text-muted)}.bitflow-array-cell{display:flex;align-items:center;justify-content:center;min-width:44px;min-height:44px;padding:var(--bitflow-space-xxsmall) var(--bitflow-space-xsmall);font:inherit;font-variant-numeric:tabular-nums;color:var(--bitflow-color-text);text-align:center;background:var(--bitflow-color-surface);border:var(--bitflow-border-width) solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard)}.bitflow-array-cell-fixed{background:var(--bitflow-color-neutral-100)}.bitflow-array-cell-button{cursor:pointer}.bitflow-array-cell-button:disabled{cursor:default}.bitflow-array-cell-input{width:3.5rem}.bitflow-array-cell.bitflow-array-cell-held{background:var(--bitflow-color-neutral-100);border-color:var(--bitflow-color-primary);box-shadow:0 0 0 2px var(--bitflow-color-primary)}.bitflow-array-cell.bitflow-array-cell-correct{background:color-mix(in srgb,var(--bitflow-color-correct) 12%,var(--bitflow-color-surface));border-color:var(--bitflow-color-correct)}.bitflow-array-cell.bitflow-array-cell-wrong{background:color-mix(in srgb,var(--bitflow-color-wrong) 12%,var(--bitflow-color-surface));border-color:var(--bitflow-color-wrong)}", Le = {
   en: {
     instructionLabel: "Instruction",
     instructionHint: "Shown above the array. Markdown is allowed.",
@@ -230,7 +230,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
   data: e,
   locale: t
 }) => /* @__PURE__ */ s.jsxs("div", { className: "bitflow-array-block", children: [
-  /* @__PURE__ */ s.jsx("span", { className: "bitflow-label", children: ((r) => I(T, r, t))("initialLabel") }),
+  /* @__PURE__ */ s.jsx("span", { className: "bitflow-label", children: ((r) => I(D, r, t))("initialLabel") }),
   /* @__PURE__ */ s.jsx(
     M,
     {
@@ -247,7 +247,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
   locale: a,
   onChange: i
 }) => {
-  const d = (o, p) => I(T, o, a, p), [h, y] = C.useState(null), [A, n] = C.useState(""), u = C.useRef(/* @__PURE__ */ new Map()), c = r !== void 0, f = (o, p) => o.label || d("unnamedStep", { number: p + 1 }), E = (o) => o.trim() === "" ? d("emptyCell") : o;
+  const d = (o, p) => I(D, o, a, p), [h, y] = C.useState(null), [A, n] = C.useState(""), u = C.useRef(/* @__PURE__ */ new Map()), c = r !== void 0, f = (o, p) => o.label || d("unnamedStep", { number: p + 1 }), E = (o) => o.trim() === "" ? d("emptyCell") : o;
   C.useEffect(() => {
     if (!h) return;
     const o = (p) => {
@@ -255,11 +255,11 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
     };
     return window.addEventListener("keydown", o), () => window.removeEventListener("keydown", o);
   }, [h, a]);
-  const F = (o, p) => {
+  const W = (o, p) => {
     u.current.get(`${o}:${p}`)?.focus();
   }, ee = (o, p, m, w) => {
     if (l) return;
-    const v = L(e, t, w);
+    const v = k(e, t, w);
     if (!h) {
       y({ stepId: o, index: p }), n(
         d("holding", { value: E(v[p]), step: f(m, w) })
@@ -276,23 +276,23 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
       );
       return;
     }
-    const b = [...v], x = h.index, g = p, S = b[x], j = b[g];
+    const b = [...v], x = h.index, g = p, j = b[x], S = b[g];
     [b[x], b[g]] = [b[g], b[x]], i(q(e, t, w, b)), y(null), n(
-      d("swapped", { a: E(S), b: E(j), step: f(m, w) })
+      d("swapped", { a: E(j), b: E(S), step: f(m, w) })
     );
   }, te = (o, p, m, w) => {
     const v = o.key === "ArrowLeft" || o.key === "ArrowRight", b = o.key === "ArrowUp" || o.key === "ArrowDown";
     if (!v && !b) return;
     if (o.preventDefault(), v) {
-      const j = L(e, t, w), k = m + (o.key === "ArrowLeft" ? -1 : 1);
-      if (k < 0 || k >= j.length) return;
-      F(p, k);
+      const S = k(e, t, w), L = m + (o.key === "ArrowLeft" ? -1 : 1);
+      if (L < 0 || L >= S.length) return;
+      W(p, L);
       return;
     }
     const x = w + (o.key === "ArrowUp" ? -1 : 1), g = e.steps[x];
     if (!g) return;
-    const S = L(e, t, x);
-    F(g.id, Math.min(m, Math.max(S.length - 1, 0)));
+    const j = k(e, t, x);
+    W(g.id, Math.min(m, Math.max(j.length - 1, 0)));
   }, ae = (o, p, m) => {
     if (l) return;
     const w = [...O(e, t, o)];
@@ -317,21 +317,21 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
         e.mode === "rearrange" ? /* @__PURE__ */ s.jsx(
           M,
           {
-            values: L(e, t, p),
+            values: k(e, t, p),
             showIndices: e.showIndices,
             render: (v, b) => {
-              const x = h?.stepId === o.id && h.index === b, g = c && m.diffs[b], S = ["bitflow-array-cell", "bitflow-array-cell-button"];
-              return x && S.push("bitflow-array-cell-held"), c && S.push(
+              const x = h?.stepId === o.id && h.index === b, g = c && m.diffs[b], j = ["bitflow-array-cell", "bitflow-array-cell-button"];
+              return x && j.push("bitflow-array-cell-held"), c && j.push(
                 g ? "bitflow-array-cell-wrong" : "bitflow-array-cell-correct"
               ), /* @__PURE__ */ s.jsxs(
                 "button",
                 {
                   type: "button",
-                  ref: (j) => {
-                    const k = `${o.id}:${b}`;
-                    j ? u.current.set(k, j) : u.current.delete(k);
+                  ref: (S) => {
+                    const L = `${o.id}:${b}`;
+                    S ? u.current.set(L, S) : u.current.delete(L);
                   },
-                  className: S.join(" "),
+                  className: j.join(" "),
                   disabled: l,
                   "aria-pressed": x,
                   "aria-label": d("cellLabel", {
@@ -341,7 +341,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
                     step: w
                   }),
                   onClick: () => ee(o.id, b, o, p),
-                  onKeyDown: (j) => te(j, o.id, b, p),
+                  onKeyDown: (S) => te(S, o.id, b, p),
                   children: [
                     v,
                     c && /* @__PURE__ */ s.jsxs("span", { className: "bitflow-visually-hidden", children: [
@@ -371,13 +371,13 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
                   disabled: l,
                   "aria-label": d("cellInputLabel", {
                     position: b + 1,
-                    total: X(e),
+                    total: _(e),
                     step: w
                   }),
                   autoCapitalize: "off",
                   autoCorrect: "off",
                   spellCheck: !1,
-                  onChange: (S) => ae(p, b, S.target.value)
+                  onChange: (j) => ae(p, b, j.target.value)
                 }
               );
             }
@@ -413,21 +413,21 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
       }
     )
   ] });
-}, K = (e) => e.join(", "), B = (e) => e.split(",").map((t) => t.trim()).filter((t) => t.length > 0), Z = ({
+}, G = (e) => e.join(", "), K = (e) => e.split(",").map((t) => t.trim()).filter((t) => t.length > 0), Y = ({
   values: e,
   onChange: t,
   ...r
 }) => {
-  const [l, a] = C.useState(() => K(e));
+  const [l, a] = C.useState(() => G(e));
   return C.useEffect(() => {
-    B(l).join("\0") !== e.join("\0") && a(K(e));
+    K(l).join("\0") !== e.join("\0") && a(G(e));
   }, [e]), /* @__PURE__ */ s.jsx(
-    J,
+    Q,
     {
       ...r,
       value: l,
       onChange: (i) => {
-        a(i), t(B(i));
+        a(i), t(K(i));
       }
     }
   );
@@ -436,7 +436,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
     const r = `step-${t}`;
     if (!e.includes(r)) return r;
   }
-}, _ = ({
+}, Z = ({
   values: e,
   t
 }) => /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: e.length > 0 ? t("parsedAs", { list: e.join(" · "), count: e.length }) : t("parsedEmpty") }), He = ({
@@ -445,7 +445,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
   onChange: r,
   errors: l
 }) => {
-  const a = (n, u) => I(ke, n, t, u), i = (n) => r({ ...e, ...n }), d = oe(e.steps.map((n) => n.id)), h = (n, u) => i({
+  const a = (n, u) => I(Le, n, t, u), i = (n) => r({ ...e, ...n }), d = oe(e.steps.map((n) => n.id)), h = (n, u) => i({
     steps: e.steps.map(
       (c) => c.id === n ? { ...c, ...u } : c
     )
@@ -484,7 +484,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
     ),
     /* @__PURE__ */ s.jsxs("div", { className: "bitflow-field", children: [
       /* @__PURE__ */ s.jsx(
-        Z,
+        Y,
         {
           label: a("initialLabel"),
           hint: a("initialHint"),
@@ -494,22 +494,22 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
           onChange: (n) => i({ initial: n })
         }
       ),
-      /* @__PURE__ */ s.jsx(_, { values: e.initial, t: a })
+      /* @__PURE__ */ s.jsx(Z, { values: e.initial, t: a })
     ] }),
     /* @__PURE__ */ s.jsxs("fieldset", { className: "bitflow-field", children: [
       /* @__PURE__ */ s.jsx("legend", { className: "bitflow-label", children: a("stepsLabel") }),
       /* @__PURE__ */ s.jsx("span", { className: "bitflow-hint", children: a("stepsHint") }),
-      $(l, "steps") && /* @__PURE__ */ s.jsx("span", { className: "bitflow-field-error", role: "alert", children: $(l, "steps") }),
+      U(l, "steps") && /* @__PURE__ */ s.jsx("span", { className: "bitflow-field-error", role: "alert", children: U(l, "steps") }),
       e.steps.length === 0 && /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: a("noSteps") }),
       e.steps.map((n, u) => /* @__PURE__ */ s.jsx("div", { className: "bitflow-rule", children: /* @__PURE__ */ s.jsxs(
-        U,
+        $,
         {
           ...d.props(n.id),
           summary: n.label || a("unnamedStep", { number: u + 1 }),
           aside: a("position", { position: u + 1 }),
           children: [
             /* @__PURE__ */ s.jsx(
-              J,
+              Q,
               {
                 label: a("stepLabelLabel"),
                 placeholder: a("stepLabelPlaceholder"),
@@ -519,7 +519,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
             ),
             /* @__PURE__ */ s.jsxs("div", { className: "bitflow-field", children: [
               /* @__PURE__ */ s.jsx(
-                Z,
+                Y,
                 {
                   label: a("stepExpectedLabel"),
                   hint: a("stepExpectedHint"),
@@ -528,7 +528,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
                   onChange: (c) => h(n.id, { expected: c })
                 }
               ),
-              /* @__PURE__ */ s.jsx(_, { values: n.expected, t: a })
+              /* @__PURE__ */ s.jsx(Z, { values: n.expected, t: a })
             ] }),
             /* @__PURE__ */ s.jsxs("div", { className: "bitflow-row", children: [
               /* @__PURE__ */ s.jsx(
@@ -574,9 +574,9 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
         }
       ) })
     ] }),
-    /* @__PURE__ */ s.jsxs(U, { summary: a("advanced"), children: [
+    /* @__PURE__ */ s.jsxs($, { summary: a("advanced"), children: [
       /* @__PURE__ */ s.jsx(
-        P,
+        T,
         {
           label: a("showIndicesLabel"),
           hint: a("showIndicesHint"),
@@ -585,7 +585,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
         }
       ),
       /* @__PURE__ */ s.jsx(
-        P,
+        T,
         {
           label: a("caseSensitiveLabel"),
           hint: a("caseSensitiveHint"),
@@ -594,7 +594,7 @@ const we = ["rearrange", "write"], fe = ne(we), me = W({
         }
       ),
       /* @__PURE__ */ s.jsx(
-        P,
+        T,
         {
           label: a("partialCreditLabel"),
           hint: a("partialCreditHint"),
@@ -634,12 +634,12 @@ ie({
   type: V,
   kind: "task",
   schema: ve,
-  evaluate: je,
+  evaluate: Se,
   Task: Ae,
   Form: He,
   info: (e) => ({
-    name: I(T, "name", e),
-    description: I(T, "description", e)
+    name: I(D, "name", e),
+    description: I(D, "description", e)
   }),
   defaultData: () => ({
     instruction: "",
@@ -649,13 +649,13 @@ ie({
     showIndices: !0,
     caseSensitive: !1,
     partialCredit: !0,
-    evaluation: Y()
+    evaluation: J()
   })
 });
 be(V);
-le("bitflow-styles-task-array-steps", Le);
+le("bitflow-styles-task-array-steps", ke);
 export {
-  Te as AnswerSchema,
+  De as AnswerSchema,
   ve as DataSchema,
   He as Form,
   Ce as InitialRow,
@@ -665,18 +665,18 @@ export {
   Ne as StepsGrid,
   V as TYPE,
   Ae as Task,
-  L as carryForward,
+  k as carryForward,
   ye as cellDiffs,
   O as displayRow,
-  je as evaluate,
-  ke as formMessages,
+  Se as evaluate,
+  Le as formMessages,
   ge as isPermutationOf,
-  T as messages,
+  D as messages,
   R as normaliseCell,
-  Q as rowAt,
+  X as rowAt,
   xe as rowCorrect,
-  X as slotCountOf,
-  Se as stepStates,
-  G as trimTrailingBlanks,
+  _ as slotCountOf,
+  je as stepStates,
+  B as trimTrailingBlanks,
   q as withRow
 };

package/dist/assets/directive-bitflow/{index-CK1UMcfT.js → index-CGDt8H6s.js}

@@ -1,11 +1,11 @@
-import { L as j, ak as C, a2 as u, ac as H, ad as A, a9 as h, a4 as S, j as r, a as x, b as k, aa as E, s as R } from "./dom-uYx_3K1r.js";
-import { v as m, A as g, e as z, M as w, E as B, L as I, R as M } from "./bitLoaders-DIGwTcpd.js";
-const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bitflow-blank-wrapper{display:inline}.bitflow-blank{display:inline-block;width:auto;max-width:100%;min-height:0;padding:2px var(--bitflow-space-xxsmall);vertical-align:baseline}.bitflow-input.bitflow-blank-correct{border-color:var(--bitflow-color-correct);background:var(--bitflow-color-correct-surface)}.bitflow-input.bitflow-blank-wrong{border-color:var(--bitflow-color-wrong);background:var(--bitflow-color-wrong-surface)}", y = /\[\[(\w+)\]\]/g, f = (e) => {
+import { P as j, ak as C, a2 as u, ac as T, ad as A, a9 as h, a4 as S, j as r, a as x, b as k, aa as B, s as E } from "./dom-B6NPWBb1.js";
+import { e as m, g, P, F as w, B as z, U as I, H as R } from "./bitLoaders-7qanePQL.js";
+const F = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bitflow-blank-wrapper{display:inline}.bitflow-blank{display:inline-block;width:auto;max-width:100%;min-height:0;padding:2px var(--bitflow-space-xxsmall);vertical-align:baseline}.bitflow-input.bitflow-blank-correct{border-color:var(--bitflow-color-correct);background:var(--bitflow-color-correct-surface)}.bitflow-input.bitflow-blank-wrong{border-color:var(--bitflow-color-wrong);background:var(--bitflow-color-wrong-surface)}", y = /\[\[(\w+)\]\]/g, f = (e) => {
   const t = [];
   for (const n of e.matchAll(y))
     t.includes(n[1]) || t.push(n[1]);
   return t;
-}, $ = j({
+}, U = j({
   instruction: u().default(""),
   /** Plain text with `[[n]]` markers where the gaps go. */
   text: u().default(""),
@@ -14,7 +14,7 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
   caseSensitive: h().default(!1),
   trim: h().default(!0),
   partialCredit: h().default(!0),
-  evaluation: H.default(A)
+  evaluation: T.default(A)
 }).check((e) => {
   if (e.value.evaluation.mode !== "auto") return;
   const t = f(e.value.text);
@@ -37,7 +37,7 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
 }), O = j({
   /** Blank id → what the learner typed. */
   blanks: C(u(), u()).default({})
-}), D = ({
+}), M = ({
   data: e,
   answer: t
 }) => {
@@ -103,13 +103,13 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
   it: { name: "Testo bucato", description: "Un testo con spazi da completare.", correct: "corretto", wrong: "non corretto" },
   pt: { name: "Preencher espaços", description: "Um texto com espaços para completar.", correct: "correto", wrong: "incorreto" },
   tr: { name: "Boşluk doldurma", description: "Doldurulacak boşluklar içeren bir metin.", correct: "doğru", wrong: "yanlış" }
-}, F = (e) => {
+}, $ = (e) => {
   const t = [];
   let n = 0;
   for (const s of e.matchAll(y))
     s.index > n && t.push({ text: e.slice(n, s.index) }), t.push({ blank: s[1] }), n = s.index + s[0].length;
   return n < e.length && t.push({ text: e.slice(n) }), t;
-}, U = ({
+}, D = ({
   data: e,
   answer: t,
   result: n,
@@ -120,7 +120,7 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
   const d = x.useId(), a = n?.detail?.blanks ?? {}, b = (i, c) => o({ blanks: { ...t?.blanks, [i]: c } });
   return /* @__PURE__ */ r.jsxs("div", { className: "bitflow-stack", children: [
     /* @__PURE__ */ r.jsx(I, { markdown: e.instruction }),
-    /* @__PURE__ */ r.jsx("p", { className: "bitflow-blank-text", children: F(e.text).map(
+    /* @__PURE__ */ r.jsx("p", { className: "bitflow-blank-text", children: $(e.text).map(
       (i, c) => "text" in i ? /* @__PURE__ */ r.jsx(x.Fragment, { children: i.text }, c) : /* @__PURE__ */ r.jsxs("span", { className: "bitflow-blank-wrapper", children: [
         /* @__PURE__ */ r.jsx(
           "input",
@@ -137,7 +137,7 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
             autoCapitalize: "off",
             autoCorrect: "off",
             spellCheck: !1,
-            onChange: (T) => b(i.blank, T.target.value)
+            onChange: (N) => b(i.blank, N.target.value)
           }
         ),
         a[i.blank] && a[i.blank] !== "neutral" && /* @__PURE__ */ r.jsx("span", { className: "bitflow-visually-hidden", children: k(p, a[i.blank], l) })
@@ -192,7 +192,7 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
         a
       ))
     ] }),
-    /* @__PURE__ */ r.jsxs(z, { summary: l("advanced"), children: [
+    /* @__PURE__ */ r.jsxs(P, { summary: l("advanced"), children: [
       /* @__PURE__ */ r.jsx(
         w,
         {
@@ -219,7 +219,7 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
         }
       ),
       /* @__PURE__ */ r.jsx(
-        B,
+        z,
         {
           evaluation: e.evaluation,
           locale: t,
@@ -228,13 +228,13 @@ const P = ".bitflow-blank-text{white-space:pre-wrap;line-height:2.2;margin:0}.bi
       )
     ] })
   ] });
-}, N = "task-fill-in-the-blank";
-E({
-  type: N,
+}, H = "task-fill-in-the-blank";
+B({
+  type: H,
   kind: "task",
-  schema: $,
-  evaluate: D,
-  Task: U,
+  schema: U,
+  evaluate: M,
+  Task: D,
   Form: W,
   info: (e) => ({
     name: k(p, "name", e),
@@ -250,16 +250,16 @@ E({
     evaluation: A()
   })
 });
-M(N);
-R("bitflow-styles-task-fill-in-the-blank", P);
+R(H);
+E("bitflow-styles-task-fill-in-the-blank", F);
 export {
   O as AnswerSchema,
   y as BLANK_PATTERN,
-  $ as DataSchema,
+  U as DataSchema,
   W as Form,
-  N as TYPE,
-  U as Task,
+  H as TYPE,
+  D as Task,
   f as blankIdsIn,
-  D as evaluate,
+  M as evaluate,
   p as messages
 };