hyperbook 0.113.2 → 0.113.4

package/dist/assets/directive-bitflow/{index-C7RJxxAx.js → index-CbQue0If.js}

@@ -1,15 +1,15 @@
-import { L as R, a4 as E, a9 as re, ac as ge, ad as oe, a2 as x, a as N, j as c, a5 as D, b as P, aa as we, s as ve } from "./dom-uYx_3K1r.js";
-import { e as ye, M as Q, r as ke, i as xe, g as O, C as Z, P as Ne, F as je, B as Ke, U as Se, H as Le } from "./bitLoaders-CxvZkGrY.js";
-const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e) => {
+import { P as R, a4 as E, a9 as re, ac as ge, ad as oe, a2 as x, a as N, j as c, a5 as D, b as F, aa as we, s as ve } from "./dom-B6NPWBb1.js";
+import { e as ye, M as Q, r as ke, i as xe, g as O, C as Z, P as Ne, F as je, B as Ke, U as Se, H as Te } from "./bitLoaders-7qanePQL.js";
+const Le = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Le.test(e.trim()), $ = (e) => {
   const t = e.mode === "search" ? [e.searchKey] : e.mode === "insert" ? e.insertKeys : [], o = [...e.tree.nodes.map((n) => n.label), ...t].filter(
     (n) => n.trim() !== ""
   );
   return o.length > 0 && o.every(se);
-}, L = (e, t, o) => o ? Number(e) - Number(t) : e.localeCompare(t, void 0, { numeric: !0 }), Ce = (e, t) => {
+}, T = (e, t, o) => o ? Number(e) - Number(t) : e.localeCompare(t, void 0, { numeric: !0 }), Ce = (e, t) => {
   for (let o = 0; o < e.length; o++)
     for (let n = o + 1; n < e.length; n++)
-      if (L(e[o], e[n], t) === 0) return e[n];
-}, X = (e) => e.split(/[,\s]+/).map((t) => t.trim()).filter((t) => t !== ""), Fe = (e) => {
+      if (T(e[o], e[n], t) === 0) return e[n];
+}, X = (e) => e.split(/[,\s]+/).map((t) => t.trim()).filter((t) => t !== ""), Pe = (e) => {
   const t = /* @__PURE__ */ new Set();
   for (const o of e)
     for (const n of [o.left, o.right])
@@ -17,7 +17,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
         if (t.has(n)) return n;
         t.add(n);
       }
-}, Pe = (e, t) => {
+}, Fe = (e, t) => {
   if (e.length === 0) return t === void 0;
   if (t === void 0) return !1;
   const o = new Map(e.map((s) => [s.id, s])), n = /* @__PURE__ */ new Set(), r = [t];
@@ -33,7 +33,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
   const n = new Map(e.map((s) => [s.id, s])), r = (s, a, d) => {
     if (s === void 0) return !0;
     const i = n.get(s);
-    return !i || a !== void 0 && L(i.label, a, o) <= 0 || d !== void 0 && L(i.label, d, o) >= 0 ? !1 : r(i.left, a, i.label) && r(i.right, i.label, d);
+    return !i || a !== void 0 && T(i.label, a, o) <= 0 || d !== void 0 && T(i.label, d, o) >= 0 ? !1 : r(i.left, a, i.label) && r(i.right, i.label, d);
   };
   return r(t, void 0, void 0);
 }, Me = (e, t, o) => {
@@ -61,7 +61,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
     s.push(a);
     const d = r.get(a);
     if (!d) break;
-    const i = L(o, d.label, n);
+    const i = T(o, d.label, n);
     if (i === 0) return { path: s, found: !0 };
     a = i < 0 ? d.left : d.right;
   }
@@ -83,7 +83,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
   const n = new Map(e.nodes.map((s) => [s.id, s]));
   let r = e.root;
   for (; ; ) {
-    const s = n.get(r), a = L(t, s.label, o) < 0 ? "left" : "right", d = a === "left" ? s.left : s.right;
+    const s = n.get(r), a = T(t, s.label, o) < 0 ? "left" : "right", d = a === "left" ? s.left : s.right;
     if (d === void 0) return { key: t, parent: r, side: a };
     r = d;
   }
@@ -97,7 +97,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
 }, ze = (e, t) => {
   const o = [];
   for (const r of e)
-    r.trim() !== "" && (o.some((s) => L(s, r, t) === 0) || o.push(r));
+    r.trim() !== "" && (o.some((s) => T(s, r, t) === 0) || o.push(r));
   const n = { nodes: [], root: void 0 };
   return q(n, ne(n, o, t));
 }, Ee = (e) => {
@@ -154,7 +154,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
     return { error: "parseTrailing", vars: { token: i.kind === "key" ? i.value : i.kind } };
   }
   return { tree: { nodes: r, root: d } };
-}, F = (e) => {
+}, P = (e) => {
   const t = new Map(e.nodes.map((n) => [n.id, n])), o = (n) => {
     if (n === void 0) return "";
     const r = t.get(n), s = r.left !== void 0, a = r.right !== void 0;
@@ -384,7 +384,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
       }));
     }
   });
-  const u = !d && !i ? Fe(t.nodes) : void 0;
+  const u = !d && !i ? Pe(t.nodes) : void 0;
   u && e.issues.push({
     code: "custom",
     input: t.nodes,
@@ -416,7 +416,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
         message: "The root has to be the one place with no parent."
       }));
     }
-  if (b && !Pe(t.nodes, t.root) && (e.issues.push({
+  if (b && !Fe(t.nodes, t.root) && (e.issues.push({
     code: "custom",
     input: t.nodes,
     path: ["tree", "nodes"],
@@ -462,7 +462,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
         });
       else {
         const m = r.find(
-          (w) => t.nodes.some((v) => L(v.label, w, p) === 0)
+          (w) => t.nodes.some((v) => T(v.label, w, p) === 0)
         );
         m !== void 0 && e.issues.push({
           code: "custom",
@@ -571,10 +571,10 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
   onChange: a,
   diagramOnly: d
 }) => {
-  const i = (l, g) => P(A, l, o, g), u = N.useRef(null), b = rt(u), [p, f] = N.useState(""), m = !n && a !== void 0, w = e.mode === "insert", v = t?.sequence ?? [], h = t?.placements ?? [], k = r !== void 0 || s !== void 0, M = w ? q(e.tree, h) : e.tree, j = $e(M.nodes, M.root, w), W = Xe * (j.depth + 1), H = (l) => ({
+  const i = (l, g) => F(A, l, o, g), u = N.useRef(null), b = rt(u), [p, f] = N.useState(""), m = !n && a !== void 0, w = e.mode === "insert", v = t?.sequence ?? [], h = t?.placements ?? [], k = r !== void 0 || s !== void 0, M = w ? q(e.tree, h) : e.tree, j = $e(M.nodes, M.root, w), W = Xe * (j.depth + 1), H = (l) => ({
     x: l.x * _,
     y: l.y * W
-  }), I = new Map(j.nodes.map((l) => [l.id, H(l)])), U = j.nodes.length + j.slots.length, K = Math.min(te * b, 0.42 * _ / Math.max(U, 1)), B = (l) => M.nodes.find((g) => g.id === l)?.label || l, S = w ? e.insertKeys[h.length] : void 0, T = (l) => a?.({
+  }), I = new Map(j.nodes.map((l) => [l.id, H(l)])), U = j.nodes.length + j.slots.length, K = Math.min(te * b, 0.42 * _ / Math.max(U, 1)), B = (l) => M.nodes.find((g) => g.id === l)?.label || l, S = w ? e.insertKeys[h.length] : void 0, L = (l) => a?.({
     sequence: v,
     placements: h,
     ...t?.notFound !== void 0 ? { notFound: t.notFound } : {},
@@ -585,16 +585,16 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
         f(i("alreadyChosen", { key: B(l) }));
         return;
       }
-      T({ sequence: [...v, l] }), f(i("added", { key: B(l), step: v.length + 1 }));
+      L({ sequence: [...v, l] }), f(i("added", { key: B(l), step: v.length + 1 }));
     }
   }, G = (l) => l.side === "root" ? i("slotRoot") : i(l.side === "left" ? "slotLeft" : "slotRight", {
     key: B(l.parentId)
   }), Y = (l) => {
-    !m || S === void 0 || (T({
+    !m || S === void 0 || (L({
       placements: [...h, { key: S, parent: l.parentId, side: l.side }]
     }), f(i("placed", { key: S, where: G(l) })));
   }, ue = () => {
-    m && (w ? T({ placements: h.slice(0, -1) }) : t?.notFound ? T({ notFound: !1 }) : T({ sequence: v.slice(0, -1) }), f(i("undone")));
+    m && (w ? L({ placements: h.slice(0, -1) }) : t?.notFound ? L({ notFound: !1 }) : L({ sequence: v.slice(0, -1) }), f(i("undone")));
   }, fe = () => {
     m && (a?.({ sequence: [], placements: [] }), f(i("cleared")));
   }, be = (l) => v.indexOf(l) + 1, J = (l) => r === void 0 ? void 0 : l <= r ? "correct" : "wrong", pe = (l) => {
@@ -749,7 +749,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
             className: "bitflow-button bitflow-button-secondary",
             "aria-pressed": t?.notFound === !0,
             onClick: () => {
-              T({ notFound: !t?.notFound }), f(i(t?.notFound ? "notFoundOff" : "notFoundOn"));
+              L({ notFound: !t?.notFound }), f(i(t?.notFound ? "notFoundOff" : "notFoundOn"));
             },
             children: i("notFound")
           }
@@ -807,7 +807,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
   locale: r,
   onAnswerChange: s
 }) => {
-  const a = (u, b) => P(A, u, r, b), d = o?.detail, i = n ? a("howToReadonly") : e.mode === "search" ? a("howToSearch", { key: e.searchKey }) : e.mode === "insert" ? a("howToInsert") : a("howToTraversal", { order: a(ce[e.traversal]) });
+  const a = (u, b) => F(A, u, r, b), d = o?.detail, i = n ? a("howToReadonly") : e.mode === "search" ? a("howToSearch", { key: e.searchKey }) : e.mode === "insert" ? a("howToInsert") : a("howToTraversal", { order: a(ce[e.traversal]) });
   return /* @__PURE__ */ c.jsxs("div", { className: "bitflow-stack", children: [
     /* @__PURE__ */ c.jsx(Se, { markdown: e.instruction }),
     /* @__PURE__ */ c.jsx("p", { className: "bitflow-hint", children: i }),
@@ -831,10 +831,10 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
   onChange: o,
   errors: n
 }) => {
-  const r = (h, k) => P(Ze, h, t, k), s = (h) => o({ ...e, ...h }), [a, d] = N.useState(() => F(e.tree)), [i, u] = N.useState(void 0), [b, p] = N.useState(""), [f, m] = N.useState(() => e.insertKeys.join(", "));
+  const r = (h, k) => F(Ze, h, t, k), s = (h) => o({ ...e, ...h }), [a, d] = N.useState(() => P(e.tree)), [i, u] = N.useState(void 0), [b, p] = N.useState(""), [f, m] = N.useState(() => e.insertKeys.join(", "));
   N.useEffect(() => {
     const h = ee(a);
-    "tree" in h && F(h.tree) === F(e.tree) || (d(F(e.tree)), u(void 0));
+    "tree" in h && P(h.tree) === P(e.tree) || (d(P(e.tree)), u(void 0));
   }, [e.tree]);
   const w = (h) => {
     d(h);
@@ -846,7 +846,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), $ = (e)
     u(void 0), s({ tree: k.tree });
   }, v = () => {
     const h = X(b), k = ze(h, h.length > 0 && h.every(se));
-    d(F(k)), u(void 0), s({ tree: k });
+    d(P(k)), u(void 0), s({ tree: k });
   };
   return /* @__PURE__ */ c.jsxs("div", { className: "bitflow-stack", children: [
     /* @__PURE__ */ c.jsx(
@@ -984,8 +984,8 @@ we({
   Task: ot,
   Form: st,
   info: (e) => ({
-    name: P(A, "name", e),
-    description: P(A, "description", e)
+    name: F(A, "name", e),
+    description: F(A, "description", e)
   }),
   defaultData: () => ({
     instruction: "",
@@ -998,7 +998,7 @@ we({
     evaluation: oe()
   })
 });
-Le(he);
+Te(he);
 ve("bitflow-styles-task-binary-tree", Qe);
 export {
   lt as AnswerSchema,
@@ -1016,7 +1016,7 @@ export {
   qe as TreeSchema,
   de as TreeView,
   ze as buildBstFromKeys,
-  L as compareKeys,
+  T as compareKeys,
   _e as evaluate,
   ne as expectedPlacements,
   Ze as formMessages,
@@ -1030,6 +1030,6 @@ export {
   ee as parseTreeText,
   Ie as searchPath,
   Me as traversalOrder,
-  F as treeToText,
+  P as treeToText,
   q as treeWithPlacements
 };

package/dist/assets/directive-bitflow/{index-CfKpkSVC.js → index-CjH3h0OO.js}

@@ -1,12 +1,12 @@
-import { L as C, a4 as Y, a as x, j as r, ac as J, ad as Z, a2 as L, am as ee, a5 as te, b as P, aa as ae, s as ie } from "./dom-uYx_3K1r.js";
-import { $ as re, e as ne, g as z, P as q, B as le, U as se, M as oe, h as ce, C as de, H as he } from "./bitLoaders-CxvZkGrY.js";
-const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-matching-columns{position:relative;display:grid;grid-template-columns:repeat(auto-fit,minmax(220px,1fr));gap:var(--bitflow-space-large)}.bitflow-matching-lines{position:absolute;inset:0;width:100%;height:100%;overflow:visible;pointer-events:none}.bitflow-matching-line{stroke:var(--bitflow-color-primary);stroke-width:2;stroke-linecap:round}.bitflow-matching-line-correct{stroke:var(--bitflow-color-correct)}.bitflow-matching-line-wrong{stroke:var(--bitflow-color-wrong)}.bitflow-matching-column{display:flex;flex-direction:column;gap:var(--bitflow-space-xxsmall);padding:0;margin:var(--bitflow-space-xxsmall) 0 0;list-style:none}.bitflow-matching-card{display:flex;gap:var(--bitflow-space-xsmall);align-items:center;width:100%;padding:var(--bitflow-space-xsmall);font:inherit;color:var(--bitflow-color-text);text-align:left;cursor:pointer;background:var(--bitflow-color-surface);border:var(--bitflow-border-width) solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard)}.bitflow-matching-card:disabled{cursor:default}.bitflow-matching-image{max-height:4rem}.bitflow-matching-index{flex:none;width:1.5rem;height:1.5rem;font-size:var(--bitflow-font-size-small);font-variant-numeric:tabular-nums;line-height:1.5rem;color:var(--bitflow-color-on-primary);text-align:center;background:var(--bitflow-color-primary);border-radius:50%}.bitflow-matching-card.bitflow-matching-card-held{background:var(--bitflow-color-neutral-100);border-color:var(--bitflow-color-primary);box-shadow:0 0 0 2px var(--bitflow-color-primary)}.bitflow-matching-card.bitflow-matching-card-matched{background:var(--bitflow-color-neutral-100);border-style:dashed}.bitflow-matching-card.bitflow-matching-card-correct{background:color-mix(in srgb,var(--bitflow-color-correct) 12%,var(--bitflow-color-surface));border-style:solid;border-color:var(--bitflow-color-correct)}.bitflow-matching-card.bitflow-matching-card-wrong{background:color-mix(in srgb,var(--bitflow-color-wrong) 12%,var(--bitflow-color-surface));border-style:solid;border-color:var(--bitflow-color-wrong)}.bitflow-matching-status{position:sticky;bottom:0;z-index:1;margin:0;padding:var(--bitflow-space-xsmall) var(--bitflow-space-small);color:var(--bitflow-color-text);background:var(--bitflow-color-surface);border-top:var(--bitflow-border-width) solid var(--bitflow-color-primary);box-shadow:var(--bitflow-shadow-medium)}", G = (t) => t.leftId === t.rightId, me = ({
+import { P as C, a4 as F, a as x, j as r, ac as J, ad as Z, a2 as P, am as ee, a5 as te, b as L, aa as ae, s as ie } from "./dom-B6NPWBb1.js";
+import { $ as re, e as ne, g as z, P as G, B as le, U as se, M as oe, h as ce, C as de, H as he } from "./bitLoaders-7qanePQL.js";
+const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-matching-columns{position:relative;display:grid;grid-template-columns:repeat(auto-fit,minmax(220px,1fr));gap:var(--bitflow-space-large)}.bitflow-matching-lines{position:absolute;inset:0;width:100%;height:100%;overflow:visible;pointer-events:none}.bitflow-matching-line{stroke:var(--bitflow-color-primary);stroke-width:2;stroke-linecap:round}.bitflow-matching-line-correct{stroke:var(--bitflow-color-correct)}.bitflow-matching-line-wrong{stroke:var(--bitflow-color-wrong)}.bitflow-matching-column{display:flex;flex-direction:column;gap:var(--bitflow-space-xxsmall);padding:0;margin:var(--bitflow-space-xxsmall) 0 0;list-style:none}.bitflow-matching-card{display:flex;gap:var(--bitflow-space-xsmall);align-items:center;width:100%;padding:var(--bitflow-space-xsmall);font:inherit;color:var(--bitflow-color-text);text-align:left;cursor:pointer;background:var(--bitflow-color-surface);border:var(--bitflow-border-width) solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard)}.bitflow-matching-card:disabled{cursor:default}.bitflow-matching-image{max-height:4rem}.bitflow-matching-index{flex:none;width:1.5rem;height:1.5rem;font-size:var(--bitflow-font-size-small);font-variant-numeric:tabular-nums;line-height:1.5rem;color:var(--bitflow-color-on-primary);text-align:center;background:var(--bitflow-color-primary);border-radius:50%}.bitflow-matching-card.bitflow-matching-card-held{background:var(--bitflow-color-neutral-100);border-color:var(--bitflow-color-primary);box-shadow:0 0 0 2px var(--bitflow-color-primary)}.bitflow-matching-card.bitflow-matching-card-matched{background:var(--bitflow-color-neutral-100);border-style:dashed}.bitflow-matching-card.bitflow-matching-card-correct{background:color-mix(in srgb,var(--bitflow-color-correct) 12%,var(--bitflow-color-surface));border-style:solid;border-color:var(--bitflow-color-correct)}.bitflow-matching-card.bitflow-matching-card-wrong{background:color-mix(in srgb,var(--bitflow-color-wrong) 12%,var(--bitflow-color-surface));border-style:solid;border-color:var(--bitflow-color-wrong)}.bitflow-matching-status{position:sticky;bottom:0;z-index:1;margin:0;padding:var(--bitflow-space-xsmall) var(--bitflow-space-small);color:var(--bitflow-color-text);background:var(--bitflow-color-surface);border-top:var(--bitflow-border-width) solid var(--bitflow-color-primary);box-shadow:var(--bitflow-shadow-medium)}", U = (t) => t.leftId === t.rightId, me = ({
   data: t,
   answer: l
 }) => {
   if (t.evaluation.mode === "skip")
     return { state: "unknown", allowRetry: !1 };
-  const h = l?.matches ?? [], s = h.filter(G), n = t.pairs.length;
+  const h = l?.matches ?? [], s = h.filter(U), n = t.pairs.length;
   return {
     state: n > 0 && s.length === n ? "correct" : "wrong",
     score: { earned: s.length, possible: n },
@@ -14,7 +14,7 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
     detail: {
       // Which pairings held, so each can be marked where it sits rather than
       // the learner being given a number to reverse-engineer.
-      matches: h.map((o) => ({ ...o, correct: G(o) }))
+      matches: h.map((o) => ({ ...o, correct: U(o) }))
     }
   };
 }, R = {
@@ -58,23 +58,23 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
     matchRight: "richtig",
     matchWrong: "nicht richtig"
   }
-}, U = C({
+}, Y = C({
   kind: te(["text", "image"]).default("text"),
   /**
    * The words on the card, or — for a picture — what the picture shows. One
    * field either way, so an image can never be shipped undescribed.
    */
-  label: L().default(""),
+  label: P().default(""),
   image: ee.optional()
 }), fe = C({
   /** Stable across edits, so an answer keeps pointing at the same pair. */
-  id: L().min(1),
-  left: U,
-  right: U
+  id: P().min(1),
+  left: Y,
+  right: Y
 }), ge = C({
-  instruction: L().default(""),
+  instruction: P().default(""),
   /** Written as pairs; the learner is given the two columns shuffled. */
-  pairs: Y(fe).default([]),
+  pairs: F(fe).default([]),
   evaluation: J.default(Z)
 }).check((t) => {
   const l = t.value.pairs.map((h) => h.id);
@@ -106,11 +106,11 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
   });
 }), be = C({
   /** The pair the left card came from. */
-  leftId: L().min(1),
+  leftId: P().min(1),
   /** The pair the right card came from — the same one, when it is right. */
-  rightId: L().min(1)
+  rightId: P().min(1)
 }), ze = C({
-  matches: Y(be).default([])
+  matches: F(be).default([])
 }), we = ({
   pairs: t,
   leftOrder: l,
@@ -121,13 +121,13 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
   readonly: k,
   onChange: g
 }) => {
-  const u = (e, a) => P(R, e, o, a), [i, d] = x.useState(null), [w, c] = x.useState(""), b = x.useRef(null), T = x.useRef(/* @__PURE__ */ new Map()), [Q, H] = x.useState([]), p = (e) => t.find((a) => a.id === e), v = (e) => e.label, E = n !== void 0, M = i ? v(p(i).left) : null, $ = (e) => s.find((a) => a.leftId === e), A = (e) => s.find((a) => a.rightId === e), K = (e) => e && n?.find(
+  const u = (e, a) => L(R, e, o, a), [i, d] = x.useState(null), [w, c] = x.useState(""), b = x.useRef(null), T = x.useRef(/* @__PURE__ */ new Map()), [Q, H] = x.useState([]), p = (e) => t.find((a) => a.id === e), v = (e) => e.label, E = n !== void 0, M = i ? v(p(i).left) : null, $ = (e) => s.find((a) => a.leftId === e), A = (e) => s.find((a) => a.rightId === e), K = (e) => e && n?.find(
     (a) => a.leftId === e.leftId && a.rightId === e.rightId
   )?.correct;
   x.useEffect(() => {
     if (i === null) return;
     const e = (a) => {
-      a.key === "Escape" && (d(null), c(P(R, "putDown", o)));
+      a.key === "Escape" && (d(null), c(L(R, "putDown", o)));
     };
     return window.addEventListener("keydown", e), () => window.removeEventListener("keydown", e);
   }, [i, o]);
@@ -308,7 +308,7 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
     unnamedPair: "Leeres Paar",
     pairSummary: "{left} → {right}"
   }
-}, F = (t, l) => {
+}, q = (t, l) => {
   const h = xe(ve(l)), s = [...t];
   for (let n = s.length - 1; n > 0; n--) {
     const o = Math.floor(h() * (n + 1));
@@ -334,11 +334,11 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
   onAnswerChange: k
 }) => {
   const g = t.pairs.map((c) => c.id), u = o?.attemptId ?? "bitflow", i = x.useMemo(
-    () => F(g, `${u}:left`),
+    () => q(g, `${u}:left`),
     // eslint-disable-next-line react-hooks/exhaustive-deps
     [g.join(), u]
   ), d = x.useMemo(
-    () => F(g, `${u}:right`),
+    () => q(g, `${u}:right`),
     // eslint-disable-next-line react-hooks/exhaustive-deps
     [g.join(), u]
   ), w = (l?.matches ?? []).filter(
@@ -371,7 +371,7 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
   onChange: h,
   errors: s
 }) => {
-  const n = (i, d) => P(pe, i, l, d), o = (i) => h({ ...t, ...i }), k = re(t.pairs.map((i) => i.id)), g = (i, d, w) => o({
+  const n = (i, d) => L(pe, i, l, d), o = (i) => h({ ...t, ...i }), k = re(t.pairs.map((i) => i.id)), g = (i, d, w) => o({
     pairs: t.pairs.map(
       (c) => c.id === i ? { ...c, [d]: { ...c[d], ...w } } : c
     )
@@ -436,7 +436,7 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
       z(s, "pairs") && /* @__PURE__ */ r.jsx("span", { className: "bitflow-field-error", role: "alert", children: z(s, "pairs") }),
       t.pairs.length === 0 && /* @__PURE__ */ r.jsx("p", { className: "bitflow-text-muted", children: n("noPairs") }),
       t.pairs.map((i, d) => /* @__PURE__ */ r.jsx("div", { className: "bitflow-rule", children: /* @__PURE__ */ r.jsxs(
-        q,
+        G,
         {
           ...k.props(i.id),
           summary: i.left.label || i.right.label ? n("pairSummary", {
@@ -479,7 +479,7 @@ const ue = ".bitflow-matching{display:flex;flex-direction:column;gap:var(--bitfl
         }
       )
     ] }),
-    /* @__PURE__ */ r.jsx(q, { summary: n("advanced"), children: /* @__PURE__ */ r.jsx(
+    /* @__PURE__ */ r.jsx(G, { summary: n("advanced"), children: /* @__PURE__ */ r.jsx(
       le,
       {
         evaluation: t.evaluation,
@@ -497,8 +497,8 @@ ae({
   Task: ke,
   Form: je,
   info: (t) => ({
-    name: P(R, "name", t),
-    description: P(R, "description", t)
+    name: L(R, "name", t),
+    description: L(R, "description", t)
   }),
   defaultData: () => ({
     instruction: "",
@@ -515,12 +515,12 @@ export {
   je as Form,
   be as MatchSchema,
   fe as PairSchema,
-  U as SideSchema,
+  Y as SideSchema,
   _ as TYPE,
   ke as Task,
   me as evaluate,
   pe as formMessages,
-  G as isRight,
+  U as isRight,
   R as messages,
-  F as seededShuffle
+  q as seededShuffle
 };

package/dist/assets/directive-bitflow/{index-TUXuIR22.js → index-CkO3QfOS.js}

@@ -1,5 +1,5 @@
-import { L as v, a9 as g, a2 as r, j as n, a as k, b as o, s as L, aa as y } from "./dom-uYx_3K1r.js";
-import { C as m, e as j, F as x, U as A, H } from "./bitLoaders-CxvZkGrY.js";
+import { P as v, a9 as g, a2 as r, j as n, a as k, b as o, s as y, aa as L } from "./dom-B6NPWBb1.js";
+import { C as m, e as j, F as x, U as A, H } from "./bitLoaders-7qanePQL.js";
 const F = ".bitflow-download-state{margin:0;min-height:var(--bitflow-space-small);font-size:var(--bitflow-font-size-small);color:var(--bitflow-color-text-muted)}", h = {
   en: {
     name: "Finish and save",
@@ -208,9 +208,9 @@ const F = ".bitflow-download-state{margin:0;min-height:var(--bitflow-space-small
     )
   ] });
 };
-L("bitflow-styles-end-download", F);
+y("bitflow-styles-end-download", F);
 const w = "end-download";
-y({
+L({
   type: w,
   kind: "end",
   schema: N,

package/dist/assets/directive-bitflow/{index-DIb3CXwC.js → index-Cz4i5rfe.js}

@@ -1,5 +1,5 @@
-import { L as H, ak as V, a4 as M, a2 as w, P as q, j as t, ac as G, ad as D, a9 as N, a as z, b as v, aa as K, s as Q } from "./dom-uYx_3K1r.js";
-import { $ as X, e as Z, C as A, g as E, i as R, P as F, r as $, F as y, B as Y, U as _, H as ee } from "./bitLoaders-CxvZkGrY.js";
+import { P as H, ak as V, a4 as M, a2 as w, Y as q, j as t, ac as G, ad as D, a9 as N, a as z, b as v, aa as Y, s as K } from "./dom-B6NPWBb1.js";
+import { $ as Q, e as Z, C as A, g as E, i as R, P as F, r as $, F as y, B as X, U as _, H as ee } from "./bitLoaders-7qanePQL.js";
 const W = H({
   /** The call, as it would be written: `fak(3)`, `sum(list, 2)`. */
   call: w().default(""),
@@ -378,7 +378,7 @@ const W = H({
     if (!e.includes(o)) return o;
   }
 }, ue = ({ data: e, locale: n, onChange: o, errors: r }) => {
-  const a = (l, c) => v(re, l, n, c), s = (l) => o({ ...e, ...l }), i = X(e.checkpoints.map((l) => l.id)), d = (l, c) => s({
+  const a = (l, c) => v(re, l, n, c), s = (l) => o({ ...e, ...l }), i = Q(e.checkpoints.map((l) => l.id)), d = (l, c) => s({
     checkpoints: e.checkpoints.map(
       (m) => m.id === l ? { ...m, ...c } : m
     )
@@ -560,7 +560,7 @@ const W = H({
         }
       ),
       /* @__PURE__ */ t.jsx(
-        Y,
+        X,
         {
           evaluation: e.evaluation,
           locale: n,
@@ -570,7 +570,7 @@ const W = H({
     ] })
   ] });
 }, U = "task-call-stack";
-K({
+Y({
   type: U,
   kind: "task",
   schema: te,
@@ -594,7 +594,7 @@ K({
   })
 });
 ee(U);
-Q("bitflow-styles-task-call-stack", ie);
+K("bitflow-styles-task-call-stack", ie);
 export {
   we as AnswerSchema,
   ae as CheckpointSchema,

package/dist/assets/directive-bitflow/{index-HXNGIC7K.js → index-D0NtgeiX.js}

@@ -1,5 +1,5 @@
-import { L as $, a4 as R, ac as me, ad as re, a9 as G, a2 as N, P as Y, j as s, a5 as X, a as W, b as A, aa as ve, s as xe } from "./dom-uYx_3K1r.js";
-import { $ as ee, e as je, M as O, F as Z, g as y, P as K, C as ye, r as te, B as Te, y as Ne, U as Ce, H as ke } from "./bitLoaders-CxvZkGrY.js";
+import { P as $, a4 as R, ac as me, ad as re, a9 as G, a2 as N, Y as K, j as s, a5 as X, a as W, b as A, aa as ve, s as xe } from "./dom-B6NPWBb1.js";
+import { $ as ee, e as je, M as O, F as Y, g as y, P as Z, C as ye, r as te, B as Te, y as Ne, U as Ce, H as ke } from "./bitLoaders-7qanePQL.js";
 const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs(e - t) <= oe * Math.max(1, Math.abs(e), Math.abs(t)), z = (e, t, a) => e.edges.find(
   (r) => r.source === t && r.target === a || !e.directed && r.source === a && r.target === t
 ), q = (e, t) => {
@@ -140,14 +140,14 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
    * Where it sits, as a fraction of the diagram in each direction. Never
    * pixels: the diagram is drawn at whatever size it is given.
    */
-  x: Y().min(0).max(1).default(0.5),
-  y: Y().min(0).max(1).default(0.5)
+  x: K().min(0).max(1).default(0.5),
+  y: K().min(0).max(1).default(0.5)
 }), ze = $({
   id: N().min(1),
   source: N().min(1),
   target: N().min(1),
   /** Ignored entirely unless the graph is weighted, where it is the cost. */
-  weight: Y().positive().default(1)
+  weight: K().positive().default(1)
 }), ie = [
   "path",
   "shortestPath",
@@ -290,7 +290,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
   if (e.goal === "path") return v("correct");
   const a = Le(e, t), r = se(e, e.sourceId).get(e.targetId);
   return r === void 0 ? v("notToTarget") : U(a, r) ? v("correct") : v("notShortest");
-}, Ze = (e, t) => {
+}, Ye = (e, t) => {
   const a = Se(e, e.sourceId);
   let r = 0;
   for (; r < t.length && r < a.length && t[r] === a[r]; )
@@ -301,7 +301,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
     return v("correct", { correctPrefix: r, outOf: n });
   const o = r === t.length ? "missesPlaces" : "wrongOrder";
   return v(o, { correctPrefix: r, outOf: n });
-}, Ke = (e, t) => {
+}, Ze = (e, t) => {
   if (t.length === 0) return v("empty");
   const a = We(e, t);
   if (a === "cycle") return v("treeCycle");
@@ -309,7 +309,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
   if (a === "wrongSize") return v("treeWrongSize");
   const r = Pe(e);
   return r === void 0 ? v("treeDisconnected") : U(Ae(e, t), r) ? v("correct") : v("notCheapestTree");
-}, Ye = (e, t) => {
+}, Ke = (e, t) => {
   if (t.length === 0) return v("empty");
   const a = new Set(t);
   if (!a.has(e.sourceId) || a.has(e.targetId))
@@ -322,11 +322,11 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
   );
   switch (e.goal) {
     case "traversal":
-      return Ze(e, a);
+      return Ye(e, a);
     case "spanningTree":
-      return Ke(e, a);
+      return Ze(e, a);
     case "cut":
-      return Ye(e, a);
+      return Ke(e, a);
     default:
       return Ge(e, a);
   }
@@ -1013,7 +1013,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
       }
     ),
     /* @__PURE__ */ s.jsx(
-      Z,
+      Y,
       {
         label: n("directedLabel"),
         hint: n("directedHint"),
@@ -1023,7 +1023,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
     ),
     y(r, "directed") && /* @__PURE__ */ s.jsx("span", { className: "bitflow-field-error", role: "alert", children: y(r, "directed") }),
     /* @__PURE__ */ s.jsx(
-      Z,
+      Y,
       {
         label: n("weightedLabel"),
         hint: n("weightedHint"),
@@ -1050,7 +1050,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
       y(r, "nodes") && /* @__PURE__ */ s.jsx("span", { className: "bitflow-field-error", role: "alert", children: y(r, "nodes") }),
       e.nodes.length === 0 && /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: n("noPlaces") }),
       e.nodes.map((i, p) => /* @__PURE__ */ s.jsxs(
-        K,
+        Z,
         {
           ...l.props(i.id),
           summary: i.label || n("unnamedPlace"),
@@ -1120,7 +1120,7 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
       y(r, "edges") && /* @__PURE__ */ s.jsx("span", { className: "bitflow-field-error", role: "alert", children: y(r, "edges") }),
       e.edges.length === 0 && /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: n("noConnections") }),
       e.edges.map((i, p) => /* @__PURE__ */ s.jsxs(
-        K,
+        Z,
         {
           ...d.props(i.id),
           summary: `${x(e, i.source)} → ${x(e, i.target)}`,
@@ -1246,9 +1246,9 @@ const C = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, U = (e, t) => Math.abs
         }
       )
     ] }),
-    /* @__PURE__ */ s.jsxs(K, { summary: n("advanced"), children: [
+    /* @__PURE__ */ s.jsxs(Z, { summary: n("advanced"), children: [
       e.goal === "traversal" && /* @__PURE__ */ s.jsx(
-        Z,
+        Y,
         {
           label: n("partialCreditLabel"),
           hint: n("partialCreditHint"),

package/dist/assets/directive-bitflow/{index-CLHtOGrW.js → index-D1C_1SPY.js}

@@ -1,5 +1,5 @@
-import { L as w, a2 as l, a9 as k, j as i, a as c, b as u, s as y, aa as L } from "./dom-uYx_3K1r.js";
-import { C as h, e as j, F as x, r as q, U as S, H as z } from "./bitLoaders-CxvZkGrY.js";
+import { P as w, a2 as l, a9 as k, j as i, a as c, b as u, s as y, aa as j } from "./dom-B6NPWBb1.js";
+import { C as h, e as L, F as x, r as q, U as S, H as z } from "./bitLoaders-7qanePQL.js";
 const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small);font-size:var(--bitflow-font-size-small);color:var(--bitflow-color-text-muted)}.bitflow-handoff-sent{color:var(--bitflow-color-correct)}.bitflow-handoff-failed,.bitflow-handoff-misconfigured{color:var(--bitflow-color-wrong)}.bitflow-handoff-link{color:var(--bitflow-color-primary-dark);text-underline-offset:.2em}", g = {
   en: {
     name: "Finish and hand back",
@@ -232,7 +232,7 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
       }
     ),
     /* @__PURE__ */ i.jsx(
-      j,
+      L,
       {
         label: a("markdownLabel"),
         hint: a("markdownHint"),
@@ -291,7 +291,7 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
 };
 y("bitflow-styles-end-handoff", T);
 const b = "end-handoff";
-L({
+j({
   type: b,
   kind: "end",
   schema: U,