hyperbook 0.113.0 → 0.113.2

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

@@ -1,6 +1,6 @@
-import { L as R, a4 as z, 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-uYx_3K1r.js";
-import { v as ye, P as Q, t as ke, _ as xe, A as H, y as Z, e as Ne, M as je, E as Ke, L as Se, R as Le } from "./bitLoaders-DIGwTcpd.js";
-const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e) => {
+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) => {
   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() !== ""
   );
@@ -9,7 +9,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
   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 !== ""), Pe = (e) => {
+}, X = (e) => e.split(/[,\s]+/).map((t) => t.trim()).filter((t) => t !== ""), Fe = (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()), A = (e)
         if (t.has(n)) return n;
         t.add(n);
       }
-}, Fe = (e, t) => {
+}, Pe = (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];
@@ -94,13 +94,13 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     n.push(Be(s, r, o));
   }
   return n;
-}, Ee = (e, t) => {
+}, ze = (e, t) => {
   const o = [];
   for (const r of e)
     r.trim() !== "" && (o.some((s) => L(s, r, t) === 0) || o.push(r));
   const n = { nodes: [], root: void 0 };
   return q(n, ne(n, o, t));
-}, ze = (e) => {
+}, Ee = (e) => {
   const t = [];
   let o = 0;
   for (; o < e.length; ) {
@@ -121,7 +121,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
 }, ee = (e) => {
   const t = e.trim();
   if (t === "") return { tree: { nodes: [], root: void 0 } };
-  const o = ze(t);
+  const o = Ee(t);
   let n = 0;
   const r = [];
   let s = 0;
@@ -154,7 +154,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     return { error: "parseTrailing", vars: { token: i.kind === "key" ? i.value : i.kind } };
   }
   return { tree: { nodes: r, root: d } };
-}, P = (e) => {
+}, F = (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;
@@ -164,7 +164,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     return `${r.label} (${d}) (${o(r.right)})`;
   };
   return e.root === void 0 ? "" : o(e.root);
-}, Ae = (e, t, o = !0) => {
+}, $e = (e, t, o = !0) => {
   const n = new Map(e.map((u) => [u.id, u])), r = [];
   let s = 0;
   const a = (u, b, p, f) => {
@@ -202,7 +202,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
   for (; o < e.length && o < t.length && e[o] === t[o]; )
     o += 1;
   return o;
-}, ie = (e, t, o) => e < t.length ? "wrongOrder" : t.length < o.length ? "missesPlaces" : "extraSteps", $e = (e, t) => {
+}, ie = (e, t, o) => e < t.length ? "wrongOrder" : t.length < o.length ? "missesPlaces" : "extraSteps", Ae = (e, t) => {
   const o = Me(e.tree.nodes, e.tree.root, e.traversal), n = new Set(e.tree.nodes.map((b) => b.id)), r = (t?.sequence ?? []).filter((b) => n.has(b)), s = ae(r, o), a = s === o.length && r.length === o.length, d = r.length === 0 ? "empty" : a ? "correct" : ie(s, r, o), i = o.length, u = e.partialCredit && i > 0 ? { earned: s, possible: i } : { earned: a ? 1 : 0, possible: 1 };
   return {
     state: a ? "correct" : "wrong",
@@ -210,8 +210,8 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     allowRetry: e.evaluation.enableRetry,
     detail: { reason: d, correctPrefix: s }
   };
-}, Oe = (e, t) => {
-  const o = A(e), { path: n, found: r } = Ie(e.tree.nodes, e.tree.root, e.searchKey, o), s = new Set(e.tree.nodes.map((h) => h.id)), a = (t?.sequence ?? []).filter((h) => s.has(h)), d = t?.notFound ?? !1, i = ae(a, n), u = i === n.length && a.length === n.length, b = d === !r, p = u && b;
+}, He = (e, t) => {
+  const o = $(e), { path: n, found: r } = Ie(e.tree.nodes, e.tree.root, e.searchKey, o), s = new Set(e.tree.nodes.map((h) => h.id)), a = (t?.sequence ?? []).filter((h) => s.has(h)), d = t?.notFound ?? !1, i = ae(a, n), u = i === n.length && a.length === n.length, b = d === !r, p = u && b;
   let f;
   a.length === 0 && !d ? f = "empty" : u ? b ? f = "correct" : f = r ? "saidNotFoundButFound" : "missedNotFound" : f = ie(i, a, n);
   const m = n.length + (r ? 0 : 1), w = r ? 0 : d ? 1 : 0, v = e.partialCredit && m > 0 ? { earned: i + w, possible: m } : { earned: p ? 1 : 0, possible: 1 };
@@ -221,8 +221,8 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     allowRetry: e.evaluation.enableRetry,
     detail: { reason: f, correctPrefix: i }
   };
-}, He = (e, t) => {
-  const o = A(e), n = ne(e.tree, e.insertKeys, o), r = t?.placements ?? [], s = e.insertKeys.map((p, f) => {
+}, Oe = (e, t) => {
+  const o = $(e), n = ne(e.tree, e.insertKeys, o), r = t?.placements ?? [], s = e.insertKeys.map((p, f) => {
     if (f >= r.length) return "pending";
     const m = r[f];
     return m.parent === n[f].parent && m.side === n[f].side ? "correct" : "wrong";
@@ -241,13 +241,13 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     return { state: "unknown", allowRetry: !1 };
   switch (e.mode) {
     case "search":
-      return Oe(e, t);
-    case "insert":
       return He(e, t);
+    case "insert":
+      return Oe(e, t);
     default:
-      return $e(e, t);
+      return Ae(e, t);
   }
-}, $ = {
+}, A = {
   en: {
     name: "Binary tree",
     description: "A binary tree the learner walks in a traversal order, searches, or grows by inserting keys.",
@@ -343,20 +343,20 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
   left: x().optional(),
   right: x().optional()
 }), qe = R({
-  nodes: z(De).max(31).default([]),
+  nodes: E(De).max(31).default([]),
   /** Omitted only when `nodes` is empty — "insert" is the only mode that
    *  starts with nothing to insert into. */
   root: x().optional()
-}), We = ["traversal", "search", "insert"], Ve = D(We), le = ["preorder", "inorder", "postorder", "levelorder"], Ge = D(le), Ue = R({
+}), We = ["traversal", "search", "insert"], Ue = D(We), le = ["preorder", "inorder", "postorder", "levelorder"], Ve = D(le), Ge = R({
   instruction: x().default(""),
-  mode: Ve.default("traversal"),
+  mode: Ue.default("traversal"),
   /** Only read in "traversal" mode. */
-  traversal: Ge.default("inorder"),
+  traversal: Ve.default("inorder"),
   tree: qe.default({ nodes: [], root: void 0 }),
   /** Only read in "search" mode. */
   searchKey: x().default(""),
   /** Only read in "insert" mode, inserted in this order. */
-  insertKeys: z(x()).max(12).default([]),
+  insertKeys: E(x()).max(12).default([]),
   /**
    * A point per place named in the right order, or per key placed where it
    * belongs, rather than the whole task passing or failing as one. Off for
@@ -384,7 +384,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
       }));
     }
   });
-  const u = !d && !i ? Pe(t.nodes) : void 0;
+  const u = !d && !i ? Fe(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()), A = (e)
         message: "The root has to be the one place with no parent."
       }));
     }
-  if (b && !Fe(t.nodes, t.root) && (e.issues.push({
+  if (b && !Pe(t.nodes, t.root) && (e.issues.push({
     code: "custom",
     input: t.nodes,
     path: ["tree", "nodes"],
@@ -443,7 +443,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
       path: ["insertKeys"],
       message: "Add at least one key to insert."
     }), (o === "search" || o === "insert") && b && t.root !== void 0) {
-      const p = A(e.value);
+      const p = $(e.value);
       Re(t.nodes, t.root, p) || e.issues.push({
         code: "custom",
         input: t.nodes,
@@ -452,7 +452,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
       });
     }
     if (o === "insert" && r.length > 0) {
-      const p = A(e.value), f = Ce(r, p);
+      const p = $(e.value), f = Ce(r, p);
       if (f !== void 0)
         e.issues.push({
           code: "custom",
@@ -480,11 +480,11 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
   side: D(["left", "right", "root"])
 }), lt = R({
   /** "traversal"/"search": the places tapped, in order. */
-  sequence: z(x()).default([]),
+  sequence: E(x()).default([]),
   /** "search" only: whether the learner also said the key was not there. */
   notFound: re().optional(),
   /** "insert" only: where each key in turn was tapped. */
-  placements: z(Ye).default([])
+  placements: E(Ye).default([])
 }), Je = (e, t) => e.nodes.find((o) => o.id === t), dt = (e, t) => Je(e, t)?.label || t, Qe = '.bitflow-tree{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-tree-scroll{overflow-x:auto}.bitflow-tree-diagram{display:block;width:100%;min-width:calc(var(--bitflow-tree-columns, 1) * 2.5rem);height:auto;background:var(--bitflow-color-surface);border:1px solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard)}.bitflow-tree-edge{stroke:var(--bitflow-color-neutral-400);stroke-width:calc(3 * var(--bitflow-tree-scale, 1))}.bitflow-tree-edge-empty{stroke-dasharray:8 6}.bitflow-tree-node circle{fill:var(--bitflow-color-surface);stroke:var(--bitflow-color-neutral-700);stroke-width:calc(3 * var(--bitflow-tree-scale, 1))}.bitflow-tree-node text{fill:var(--bitflow-color-text);font-family:var(--bitflow-font-family);font-size:calc(28px * var(--bitflow-tree-scale, 1));font-weight:var(--bitflow-font-weight-medium);-webkit-user-select:none;user-select:none}.bitflow-tree-node-live{cursor:pointer}.bitflow-tree-node-chosen circle{fill:var(--bitflow-color-primary-light);stroke:var(--bitflow-color-primary)}.bitflow-tree-node-right circle{fill:var(--bitflow-color-correct-surface);stroke:var(--bitflow-color-correct)}.bitflow-tree-node-wrong circle{fill:var(--bitflow-color-wrong-surface);stroke:var(--bitflow-color-wrong);stroke-dasharray:10 6}.bitflow-tree-node text.bitflow-tree-step{fill:var(--bitflow-color-primary-dark);font-size:calc(22px * var(--bitflow-tree-scale, 1));font-weight:var(--bitflow-font-weight-bold)}.bitflow-tree-node text.bitflow-tree-verdict{font-size:calc(22px * var(--bitflow-tree-scale, 1));font-weight:var(--bitflow-font-weight-bold)}.bitflow-tree-node-right text.bitflow-tree-verdict{fill:var(--bitflow-color-correct)}.bitflow-tree-node-wrong text.bitflow-tree-verdict{fill:var(--bitflow-color-wrong)}.bitflow-tree-slot{fill:transparent;stroke:var(--bitflow-color-neutral-400);stroke-width:calc(2 * var(--bitflow-tree-scale, 1));stroke-dasharray:6 5}.bitflow-tree-slot-live{cursor:pointer;stroke:var(--bitflow-color-primary)}.bitflow-tree-slot-live:hover{fill:var(--bitflow-color-primary-light)}.bitflow-tree-next{margin:0;font-weight:var(--bitflow-font-weight-medium)}.bitflow-tree-chosen{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xxsmall);margin:0;padding:0;list-style:none;counter-reset:bitflow-tree-step}.bitflow-tree-chip{counter-increment:bitflow-tree-step;padding:var(--bitflow-space-xxsmall) var(--bitflow-space-xsmall);border-radius:var(--bitflow-radius-full);background:var(--bitflow-color-primary-light);color:var(--bitflow-color-primary-dark);font-size:var(--bitflow-font-size-small)}.bitflow-tree-chip:before{content:counter(bitflow-tree-step) ". ";font-weight:var(--bitflow-font-weight-bold)}.bitflow-tree-chip-correct{background:var(--bitflow-color-correct-surface);color:var(--bitflow-color-correct)}.bitflow-tree-chip-wrong{background:var(--bitflow-color-wrong-surface);color:var(--bitflow-color-wrong);text-decoration:line-through}.bitflow-tree-text{font-family:var(--bitflow-font-family-mono)}.bitflow-tree-keys{flex:1 1 12rem;width:auto;min-width:0}', Ze = {
   en: {
     instructionLabel: "Instruction",
@@ -571,15 +571,15 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
   onChange: a,
   diagramOnly: d
 }) => {
-  const i = (l, g) => F($, 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 = Ae(M.nodes, M.root, w), W = Xe * (j.depth + 1), O = (l) => ({
+  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) => ({
     x: l.x * _,
     y: l.y * W
-  }), I = new Map(j.nodes.map((l) => [l.id, O(l)])), V = j.nodes.length + j.slots.length, K = Math.min(te * b, 0.42 * _ / Math.max(V, 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, T = (l) => a?.({
     sequence: v,
     placements: h,
     ...t?.notFound !== void 0 ? { notFound: t.notFound } : {},
     ...l
-  }), G = (l) => {
+  }), V = (l) => {
     if (m) {
       if (v.includes(l)) {
         f(i("alreadyChosen", { key: B(l) }));
@@ -587,12 +587,12 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
       }
       T({ sequence: [...v, l] }), f(i("added", { key: B(l), step: v.length + 1 }));
     }
-  }, U = (l) => l.side === "root" ? i("slotRoot") : i(l.side === "left" ? "slotLeft" : "slotRight", {
+  }, G = (l) => l.side === "root" ? i("slotRoot") : i(l.side === "left" ? "slotLeft" : "slotRight", {
     key: B(l.parentId)
   }), Y = (l) => {
     !m || S === void 0 || (T({
       placements: [...h, { key: S, parent: l.parentId, side: l.side }]
-    }), f(i("placed", { key: S, where: U(l) })));
+    }), 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")));
   }, fe = () => {
@@ -615,7 +615,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
         "aria-label": i("diagramLabel"),
         style: {
           "--bitflow-tree-scale": Math.min(b, K / te),
-          "--bitflow-tree-columns": V
+          "--bitflow-tree-columns": U
         },
         children: [
           me.map((l) => {
@@ -633,7 +633,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
             );
           }),
           w && j.slots.map((l) => {
-            const g = O(l), y = l.parentId ? I.get(l.parentId) : void 0;
+            const g = H(l), y = l.parentId ? I.get(l.parentId) : void 0;
             return /* @__PURE__ */ c.jsxs("g", { children: [
               y && /* @__PURE__ */ c.jsx(
                 "line",
@@ -658,13 +658,13 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
             ] }, `${l.parentId}-${l.side}`);
           }),
           j.nodes.map((l) => {
-            const g = O(l), y = be(l.id), E = w ? pe(l.id) : y > 0 ? J(y) : void 0, C = ["bitflow-tree-node"];
-            return y > 0 && C.push("bitflow-tree-node-chosen"), E === "correct" && C.push("bitflow-tree-node-right"), E === "wrong" && C.push("bitflow-tree-node-wrong"), m && !w && C.push("bitflow-tree-node-live"), /* @__PURE__ */ c.jsxs(
+            const g = H(l), y = be(l.id), z = w ? pe(l.id) : y > 0 ? J(y) : void 0, C = ["bitflow-tree-node"];
+            return y > 0 && C.push("bitflow-tree-node-chosen"), z === "correct" && C.push("bitflow-tree-node-right"), z === "wrong" && C.push("bitflow-tree-node-wrong"), m && !w && C.push("bitflow-tree-node-live"), /* @__PURE__ */ c.jsxs(
               "g",
               {
                 className: C.join(" "),
                 transform: `translate(${g.x} ${g.y})`,
-                onClick: () => !w && G(l.id),
+                onClick: () => !w && V(l.id),
                 children: [
                   /* @__PURE__ */ c.jsx("circle", { r: K }),
                   /* @__PURE__ */ c.jsx("text", { dominantBaseline: "central", textAnchor: "middle", children: l.label }),
@@ -678,14 +678,14 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
                       children: y
                     }
                   ),
-                  E && /* @__PURE__ */ c.jsx(
+                  z && /* @__PURE__ */ c.jsx(
                     "text",
                     {
                       className: "bitflow-tree-verdict",
                       x: -K * 0.9,
                       y: -K * 0.9,
                       textAnchor: "end",
-                      children: E === "correct" ? "✓" : "✗"
+                      children: z === "correct" ? "✓" : "✗"
                     }
                   )
                 ]
@@ -728,7 +728,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
             type: "button",
             className: "bitflow-button bitflow-button-secondary",
             onClick: () => Y(l),
-            children: U(l)
+            children: G(l)
           },
           `${l.parentId}-${l.side}`
         )) : j.nodes.map((l) => /* @__PURE__ */ c.jsx(
@@ -737,7 +737,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
             type: "button",
             className: "bitflow-button bitflow-button-secondary",
             disabled: v.includes(l.id),
-            onClick: () => G(l.id),
+            onClick: () => V(l.id),
             children: i("addNode", { key: l.label })
           },
           l.id
@@ -807,7 +807,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
   locale: r,
   onAnswerChange: s
 }) => {
-  const a = (u, b) => F($, 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) => 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]) });
   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()), A = (e)
   onChange: o,
   errors: n
 }) => {
-  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(", "));
+  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(", "));
   N.useEffect(() => {
     const h = ee(a);
-    "tree" in h && P(h.tree) === P(e.tree) || (d(P(e.tree)), u(void 0));
+    "tree" in h && F(h.tree) === F(e.tree) || (d(F(e.tree)), u(void 0));
   }, [e.tree]);
   const w = (h) => {
     d(h);
@@ -845,8 +845,8 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
     }
     u(void 0), s({ tree: k.tree });
   }, v = () => {
-    const h = X(b), k = Ee(h, h.length > 0 && h.every(se));
-    d(P(k)), u(void 0), s({ tree: k });
+    const h = X(b), k = ze(h, h.length > 0 && h.every(se));
+    d(F(k)), u(void 0), s({ tree: k });
   };
   return /* @__PURE__ */ c.jsxs("div", { className: "bitflow-stack", children: [
     /* @__PURE__ */ c.jsx(
@@ -887,7 +887,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
       {
         label: r("treeLabel"),
         hint: r("treeHint"),
-        error: i ?? xe(n, "tree.nodes") ?? H(n, "tree.root"),
+        error: i ?? xe(n, "tree.nodes") ?? O(n, "tree.root"),
         children: (h) => /* @__PURE__ */ c.jsx(
           "textarea",
           {
@@ -939,7 +939,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
         label: r("searchKeyLabel"),
         hint: r("searchKeyHint"),
         value: e.searchKey,
-        error: H(n, "searchKey"),
+        error: O(n, "searchKey"),
         onChange: (h) => s({ searchKey: h.trim() })
       }
     ),
@@ -949,7 +949,7 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
         label: r("insertKeysLabel"),
         hint: r("insertKeysHint"),
         value: f,
-        error: H(n, "insertKeys"),
+        error: O(n, "insertKeys"),
         onChange: (h) => {
           m(h), s({ insertKeys: X(h) });
         }
@@ -979,13 +979,13 @@ const Te = /^[+-]?(?:\d+\.?\d*|\.\d+)$/, se = (e) => Te.test(e.trim()), A = (e)
 we({
   type: he,
   kind: "task",
-  schema: Ue,
+  schema: Ge,
   evaluate: _e,
   Task: ot,
   Form: st,
   info: (e) => ({
-    name: F($, "name", e),
-    description: F($, "description", e)
+    name: P(A, "name", e),
+    description: P(A, "description", e)
   }),
   defaultData: () => ({
     instruction: "",
@@ -1002,34 +1002,34 @@ Le(he);
 ve("bitflow-styles-task-binary-tree", Qe);
 export {
   lt as AnswerSchema,
-  Ue as DataSchema,
+  Ge as DataSchema,
   st as Form,
   We as MODES,
-  Ve as ModeSchema,
+  Ue as ModeSchema,
   Ye as PlacementSchema,
   it as REASONS,
   le as TRAVERSAL_KINDS,
   he as TYPE,
   ot as Task,
-  Ge as TraversalKindSchema,
+  Ve as TraversalKindSchema,
   De as TreeNodeSchema,
   qe as TreeSchema,
   de as TreeView,
-  Ee as buildBstFromKeys,
+  ze as buildBstFromKeys,
   L as compareKeys,
   _e as evaluate,
   ne as expectedPlacements,
   Ze as formMessages,
   Re as isBst,
-  A as isNumericMode,
-  Ae as layoutTree,
-  $ as messages,
+  $ as isNumericMode,
+  $e as layoutTree,
+  A as messages,
   dt as nameOf,
   Je as nodeById,
   X as parseKeyList,
   ee as parseTreeText,
   Ie as searchPath,
   Me as traversalOrder,
-  P as treeToText,
+  F as treeToText,
   q as treeWithPlacements
 };