hyperbook 0.113.1 → 0.113.2

package/dist/assets/directive-bitflow/{index-8jTO-NJA.js → index-HXNGIC7K.js}

@@ -1,6 +1,6 @@
-import { L as E, a4 as R, ac as me, ad as re, a9 as G, a2 as C, 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 { S as ee, v as je, P as O, M as Z, A as y, e as K, y as ye, t as te, E as Te, s as Ce, L as Ne, R as ke } from "./bitLoaders-DIGwTcpd.js";
-const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs(e - t) <= oe * Math.max(1, Math.abs(e), Math.abs(t)), M = (e, t, a) => e.edges.find(
+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";
+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) => {
   const a = [];
@@ -22,9 +22,9 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
     if (n === void 0) return a;
     r.add(n);
     for (const l of q(e, n)) {
-      const d = M(e, n, l);
+      const d = z(e, n, l);
       if (!d) continue;
-      const b = o + N(e, d);
+      const b = o + C(e, d);
       b < (a.get(l) ?? 1 / 0) && a.set(l, b);
     }
   }
@@ -51,38 +51,38 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   }
   return a;
 }, ut = (e, t) => t.length < 2 || new Set(t).size !== t.length ? !1 : t.every(
-  (a, r) => r === 0 || M(e, t[r - 1], a) !== void 0
+  (a, r) => r === 0 || z(e, t[r - 1], a) !== void 0
 ), Oe = (e, t) => {
   for (let a = 1; a < t.length; a++)
-    if (!M(e, t[a - 1], t[a])) return a;
+    if (!z(e, t[a - 1], t[a])) return a;
 }, Le = (e, t) => {
   let a = 0;
   for (let r = 1; r < t.length; r++) {
-    const n = M(e, t[r - 1], t[r]);
+    const n = z(e, t[r - 1], t[r]);
     if (!n) return;
-    a += N(e, n);
+    a += C(e, n);
   }
   return a;
 }, Ie = (e, t) => {
   const a = [];
   for (let r = 1; r < t.length; r++) {
-    const n = M(e, t[r - 1], t[r]);
+    const n = z(e, t[r - 1], t[r]);
     n && a.push(n.id);
   }
   return a;
-}, z = (e, t) => {
+}, H = (e, t) => {
   let a = t;
   for (; e.get(a) !== a; ) a = e.get(a);
   return a;
 }, Pe = (e) => {
   const t = new Map(e.nodes.map((o) => [o.id, o.id])), a = [...e.edges].sort((o, l) => {
-    const d = N(e, o) - N(e, l);
+    const d = C(e, o) - C(e, l);
     return d !== 0 ? d : o.id < l.id ? -1 : 1;
   });
   let r = 0, n = 0;
   for (const o of a) {
-    const l = z(t, o.source), d = z(t, o.target);
-    l !== d && (t.set(l, d), r += N(e, o), n += 1);
+    const l = H(t, o.source), d = H(t, o.target);
+    l !== d && (t.set(l, d), r += C(e, o), n += 1);
   }
   return n === e.nodes.length - 1 ? r : void 0;
 }, We = (e, t) => {
@@ -90,23 +90,23 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   if (a.length !== e.nodes.length - 1) return "wrongSize";
   const r = new Map(e.nodes.map((n) => [n.id, n.id]));
   for (const n of a) {
-    const o = z(r, n.source), l = z(r, n.target);
+    const o = H(r, n.source), l = H(r, n.target);
     if (o === l) return "cycle";
     r.set(o, l);
   }
-  return new Set(e.nodes.map((n) => z(r, n.id))).size === 1 ? "tree" : "disconnected";
-}, Ae = (e, t) => e.edges.filter((a) => t.includes(a.id)).reduce((a, r) => a + N(e, r), 0), De = (e, t) => {
+  return new Set(e.nodes.map((n) => H(r, n.id))).size === 1 ? "tree" : "disconnected";
+}, Ae = (e, t) => e.edges.filter((a) => t.includes(a.id)).reduce((a, r) => a + C(e, r), 0), De = (e, t) => {
   const a = new Set(t);
   return e.edges.reduce((r, n) => {
     const o = a.has(n.source), l = a.has(n.target);
-    return e.directed ? r + (o && !l ? N(e, n) : 0) : r + (o !== l ? N(e, n) : 0);
+    return e.directed ? r + (o && !l ? C(e, n) : 0) : r + (o !== l ? C(e, n) : 0);
   }, 0);
-}, ze = (e, t, a) => {
+}, He = (e, t, a) => {
   if (t === a) return;
   const r = /* @__PURE__ */ new Map(), n = (l) => (r.has(l) || r.set(l, /* @__PURE__ */ new Map()), r.get(l));
   e.nodes.forEach((l) => n(l.id));
   for (const l of e.edges) {
-    const d = N(e, l), b = n(l.source);
+    const d = C(e, l), b = n(l.source);
     b.set(l.target, (b.get(l.target) ?? 0) + d);
     const f = n(l.target);
     e.directed ? f.set(l.source, f.get(l.source) ?? 0) : f.set(l.source, (f.get(l.source) ?? 0) + d);
@@ -132,20 +132,20 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
     o += g;
   }
   return o;
-}, ft = (e, t, a) => se(e, t).has(a), He = E({
+}, ft = (e, t, a) => se(e, t).has(a), Me = $({
   /** Stable across edits, so an answer keeps pointing at the same place. */
-  id: C().min(1),
-  label: C().default(""),
+  id: N().min(1),
+  label: N().default(""),
   /**
    * 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)
-}), Me = E({
-  id: C().min(1),
-  source: C().min(1),
-  target: C().min(1),
+}), 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)
 }), ie = [
@@ -154,18 +154,18 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   "traversal",
   "spanningTree",
   "cut"
-], Re = X(ie), Ee = X(["bfs", "dfs"]), $e = X(["label", "authored"]), le = (e) => e === "path" || e === "shortestPath" || e === "cut", de = (e) => e !== "spanningTree", ce = (e) => e === "path" || e === "shortestPath" || e === "traversal", $ = (e) => e === "spanningTree" ? "edges" : "nodes", Be = E({
-  instruction: C().default(""),
+], Re = X(ie), $e = X(["bfs", "dfs"]), Ee = X(["label", "authored"]), le = (e) => e === "path" || e === "shortestPath" || e === "cut", de = (e) => e !== "spanningTree", ce = (e) => e === "path" || e === "shortestPath" || e === "traversal", E = (e) => e === "spanningTree" ? "edges" : "nodes", Be = $({
+  instruction: N().default(""),
   directed: G().default(!1),
   /** Off, every edge costs one, and the weights are neither shown nor used. */
   weighted: G().default(!1),
-  nodes: R(He).max(30).default([]),
-  edges: R(Me).max(90).default([]),
+  nodes: R(Me).max(30).default([]),
+  edges: R(ze).max(90).default([]),
   goal: Re.default("shortestPath"),
-  sourceId: C().default(""),
-  targetId: C().default(""),
-  traversal: Ee.default("bfs"),
-  neighbourOrder: $e.default("label"),
+  sourceId: N().default(""),
+  targetId: N().default(""),
+  traversal: $e.default("bfs"),
+  neighbourOrder: Ee.default("label"),
   /**
    * Only a traversal can be partly right in a way worth a mark: the order is
    * right up to the point it goes wrong. A route that does not arrive and a
@@ -253,15 +253,15 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
     path: ["directed"],
     message: "A spanning tree needs an undirected graph."
   }));
-}), bt = E({
+}), bt = $({
   /**
    * The places chosen, in order where the order matters: a route, a traversal,
    * or the near side of a cut.
    */
-  nodeIds: R(C()).default([]),
+  nodeIds: R(N()).default([]),
   /** The connections chosen. A spanning tree is the only goal that uses these. */
-  edgeIds: R(C()).default([])
-}), he = (e, t) => $(e) === "edges" ? t?.edgeIds ?? [] : t?.nodeIds ?? [], Ve = (e, t) => $(e) === "edges" ? { nodeIds: [], edgeIds: t } : { nodeIds: t, edgeIds: [] }, Fe = (e, t) => e.nodes.find((a) => a.id === t), pt = (e, t) => e.edges.find((a) => a.id === t), x = (e, t) => Fe(e, t)?.label || t, wt = [
+  edgeIds: R(N()).default([])
+}), he = (e, t) => E(e) === "edges" ? t?.edgeIds ?? [] : t?.nodeIds ?? [], Ve = (e, t) => E(e) === "edges" ? { nodeIds: [], edgeIds: t } : { nodeIds: t, edgeIds: [] }, Fe = (e, t) => e.nodes.find((a) => a.id === t), pt = (e, t) => e.edges.find((a) => a.id === t), x = (e, t) => Fe(e, t)?.label || t, wt = [
   "correct",
   "empty",
   "notFromSource",
@@ -289,7 +289,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   if (Oe(e, t) !== void 0) return v("broken");
   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") : Q(a, r) ? v("correct") : v("notShortest");
+  return r === void 0 ? v("notToTarget") : U(a, r) ? v("correct") : v("notShortest");
 }, Ze = (e, t) => {
   const a = Se(e, e.sourceId);
   let r = 0;
@@ -308,14 +308,14 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   if (a === "disconnected") return v("treeDisconnected");
   if (a === "wrongSize") return v("treeWrongSize");
   const r = Pe(e);
-  return r === void 0 ? v("treeDisconnected") : Q(Ae(e, t), r) ? v("correct") : v("notCheapestTree");
+  return r === void 0 ? v("treeDisconnected") : U(Ae(e, t), r) ? v("correct") : v("notCheapestTree");
 }, Ye = (e, t) => {
   if (t.length === 0) return v("empty");
   const a = new Set(t);
   if (!a.has(e.sourceId) || a.has(e.targetId))
     return v("notSeparating");
-  const r = ze(e, e.sourceId, e.targetId);
-  return r === void 0 ? v("notSeparating") : Q(De(e, t), r) ? v("correct") : v("notCheapestCut");
+  const r = He(e, e.sourceId, e.targetId);
+  return r === void 0 ? v("notSeparating") : U(De(e, t), r) ? v("correct") : v("notCheapestCut");
 }, qe = (e, t) => {
   const a = he(e.goal, t).filter(
     (r) => e.goal === "spanningTree" ? e.edges.some((n) => n.id === r) : e.nodes.some((n) => n.id === r)
@@ -346,7 +346,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
       ...a.correctPrefix === void 0 ? {} : { correctPrefix: a.correctPrefix }
     }
   };
-}, H = {
+}, M = {
   en: {
     name: "Graph path",
     description: "A graph, and a route, traversal order, spanning tree or cut to pick out of it.",
@@ -453,7 +453,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
     reasonNotSeparating: "Die nahe Seite muss {source} enthalten und {target} auf der anderen Seite lassen.",
     reasonNotCheapestCut: "Das trennt sie, aber es gibt einen günstigeren Schnitt."
   }
-}, Qe = '.bitflow-graph{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-graph-diagram{width:100%;aspect-ratio:5 / 3;background:var(--bitflow-color-surface);border:1px solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard);touch-action:none}.bitflow-graph-edge line{stroke:var(--bitflow-color-neutral-400);stroke-width:calc(3 * var(--bitflow-graph-scale, 1))}.bitflow-graph-edge marker path,.bitflow-graph-diagram marker path{fill:var(--bitflow-color-neutral-400)}.bitflow-graph-edge-hit{stroke:transparent;stroke-width:calc(26 * var(--bitflow-graph-scale, 1));cursor:pointer}.bitflow-graph-edge-chosen line{stroke:var(--bitflow-color-primary);stroke-width:calc(7 * var(--bitflow-graph-scale, 1))}.bitflow-graph-weight{fill:var(--bitflow-color-text-muted);font-family:var(--bitflow-font-family);font-size:calc(26px * var(--bitflow-graph-scale, 1))}.bitflow-graph-node circle{fill:var(--bitflow-color-surface);stroke:var(--bitflow-color-neutral-700);stroke-width:calc(3 * var(--bitflow-graph-scale, 1))}.bitflow-graph-node text{fill:var(--bitflow-color-text);font-family:var(--bitflow-font-family);font-size:calc(30px * var(--bitflow-graph-scale, 1));font-weight:var(--bitflow-font-weight-medium);-webkit-user-select:none;user-select:none}.bitflow-graph-node{cursor:pointer}.bitflow-graph-node-movable{cursor:grab}.bitflow-graph-node-source circle{stroke:var(--bitflow-color-info);stroke-width:calc(6 * var(--bitflow-graph-scale, 1))}.bitflow-graph-node-target circle{stroke:var(--bitflow-color-manual);stroke-width:calc(6 * var(--bitflow-graph-scale, 1));stroke-dasharray:10 6}.bitflow-graph-node-chosen circle{fill:var(--bitflow-color-primary-light)}.bitflow-graph-node-right circle{fill:var(--bitflow-color-correct-surface);stroke:var(--bitflow-color-correct)}.bitflow-graph-step{fill:var(--bitflow-color-primary-dark);font-family:var(--bitflow-font-family);font-size:calc(26px * var(--bitflow-graph-scale, 1));font-weight:var(--bitflow-font-weight-bold)}.bitflow-graph-written summary{cursor:pointer;color:var(--bitflow-color-text-muted);font-size:var(--bitflow-font-size-small)}.bitflow-graph-written ul{margin:var(--bitflow-space-xxsmall) 0 0;padding-left:var(--bitflow-space-medium)}.bitflow-graph-chosen{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xxsmall);margin:0;padding:0;list-style:none;counter-reset:bitflow-graph-step}.bitflow-graph-chip{counter-increment:bitflow-graph-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-graph-chip:before{content:counter(bitflow-graph-step) ". ";font-weight:var(--bitflow-font-weight-bold)}', Ue = {
+}, Ue = '.bitflow-graph{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-graph-diagram{width:100%;aspect-ratio:5 / 3;background:var(--bitflow-color-surface);border:1px solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard);touch-action:none}.bitflow-graph-edge line{stroke:var(--bitflow-color-neutral-400);stroke-width:calc(3 * var(--bitflow-graph-scale, 1))}.bitflow-graph-edge marker path,.bitflow-graph-diagram marker path{fill:var(--bitflow-color-neutral-400)}.bitflow-graph-edge-hit{stroke:transparent;stroke-width:calc(26 * var(--bitflow-graph-scale, 1));cursor:pointer}.bitflow-graph-edge-chosen line{stroke:var(--bitflow-color-primary);stroke-width:calc(7 * var(--bitflow-graph-scale, 1))}.bitflow-graph-weight{fill:var(--bitflow-color-text-muted);font-family:var(--bitflow-font-family);font-size:calc(26px * var(--bitflow-graph-scale, 1))}.bitflow-graph-node circle{fill:var(--bitflow-color-surface);stroke:var(--bitflow-color-neutral-700);stroke-width:calc(3 * var(--bitflow-graph-scale, 1))}.bitflow-graph-node text{fill:var(--bitflow-color-text);font-family:var(--bitflow-font-family);font-size:calc(30px * var(--bitflow-graph-scale, 1));font-weight:var(--bitflow-font-weight-medium);-webkit-user-select:none;user-select:none}.bitflow-graph-node{cursor:pointer}.bitflow-graph-node-movable{cursor:grab}.bitflow-graph-node-source circle{stroke:var(--bitflow-color-info);stroke-width:calc(6 * var(--bitflow-graph-scale, 1))}.bitflow-graph-node-target circle{stroke:var(--bitflow-color-manual);stroke-width:calc(6 * var(--bitflow-graph-scale, 1));stroke-dasharray:10 6}.bitflow-graph-node-chosen circle{fill:var(--bitflow-color-primary-light)}.bitflow-graph-node-right circle{fill:var(--bitflow-color-correct-surface);stroke:var(--bitflow-color-correct)}.bitflow-graph-step{fill:var(--bitflow-color-primary-dark);font-family:var(--bitflow-font-family);font-size:calc(26px * var(--bitflow-graph-scale, 1));font-weight:var(--bitflow-font-weight-bold)}.bitflow-graph-written summary{cursor:pointer;color:var(--bitflow-color-text-muted);font-size:var(--bitflow-font-size-small)}.bitflow-graph-written ul{margin:var(--bitflow-space-xxsmall) 0 0;padding-left:var(--bitflow-space-medium)}.bitflow-graph-chosen{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xxsmall);margin:0;padding:0;list-style:none;counter-reset:bitflow-graph-step}.bitflow-graph-chip{counter-increment:bitflow-graph-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-graph-chip:before{content:counter(bitflow-graph-step) ". ";font-weight:var(--bitflow-font-weight-bold)}', Qe = {
   en: {
     instructionLabel: "Instruction",
     instructionHint: "Shown above the diagram. Markdown is allowed.",
@@ -582,9 +582,9 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   onChange: o,
   onMoveNode: l
 }) => {
-  const d = (c, u) => A(H, c, a, u), b = `bitflow-graph-arrow-${W.useId().replace(/[^\w-]/g, "")}`, f = W.useRef(null), g = tt(f), h = _e * g, w = W.useRef(
+  const d = (c, u) => A(M, c, a, u), b = `bitflow-graph-arrow-${W.useId().replace(/[^\w-]/g, "")}`, f = W.useRef(null), g = tt(f), h = _e * g, w = W.useRef(
     void 0
-  ), [i, p] = W.useState(""), m = ce(e.goal), k = $(e.goal), D = !r && o !== void 0, B = new Set(t), be = new Set(
+  ), [i, p] = W.useState(""), m = ce(e.goal), k = E(e.goal), D = !r && o !== void 0, B = new Set(t), be = new Set(
     k === "edges" ? t : m ? Ie(e, t) : []
   ), V = (c, u) => p(d(c, u)), F = (c) => {
     if (!D) return;
@@ -597,7 +597,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
       place: pe(c),
       count: u.length
     });
-  }, pe = (c) => k === "edges" ? ue(e, c, d) : x(e, c), U = (c) => {
+  }, pe = (c) => k === "edges" ? ue(e, c, d) : x(e, c), Q = (c) => {
     const u = f.current?.getBoundingClientRect();
     if (!(!u || u.width === 0 || u.height === 0))
       return {
@@ -605,10 +605,10 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
         y: (c.clientY - u.top) / u.height
       };
   }, _ = (c) => Math.min(1, Math.max(0, c)), we = (c) => {
-    const u = w.current, j = U(c);
+    const u = w.current, j = Q(c);
     !u || !j || !l || l(u.id, _(j.x + u.dx), _(j.y + u.dy));
   };
-  Ce(
+  Ne(
     (c) => we(c),
     () => {
       w.current = void 0;
@@ -700,7 +700,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
                 ].filter(Boolean).join(" "),
                 onPointerDown: (S) => {
                   if (!l) return;
-                  const L = U(S);
+                  const L = Q(S);
                   w.current = {
                     id: c.id,
                     dx: L ? c.x - L.x : 0,
@@ -793,8 +793,8 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   choose: o,
   announce: l
 }) => {
-  const d = (h, w) => A(H, h, a, w), b = ce(e.goal), f = $(e.goal), g = new Set(t);
-  return b ? /* @__PURE__ */ s.jsxs("div", { className: "bitflow-stack-small", children: [
+  const d = (h, w) => A(M, h, a, w), b = ce(e.goal), f = E(e.goal), g = new Set(t);
+  return b ? /* @__PURE__ */ s.jsxs("div", { className: "bitflow-stack-small bitflow-stack", children: [
     /* @__PURE__ */ s.jsxs("div", { className: "bitflow-field", children: [
       /* @__PURE__ */ s.jsx("span", { className: "bitflow-label", children: e.goal === "traversal" ? d("chosenOrder") : d("chosenRoute") }),
       t.length === 0 ? /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: d("nothingChosen") }) : /* @__PURE__ */ s.jsx("ol", { className: "bitflow-graph-chosen", children: t.map((h, w) => (
@@ -887,12 +887,12 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   locale: n,
   onAnswerChange: o
 }) => {
-  const l = (f, g) => A(H, f, n, g), d = {
+  const l = (f, g) => A(M, f, n, g), d = {
     source: x(e, e.sourceId),
     target: x(e, e.targetId)
   }, b = a?.detail?.reason;
   return /* @__PURE__ */ s.jsxs("div", { className: "bitflow-stack", children: [
-    /* @__PURE__ */ s.jsx(Ne, { markdown: e.instruction }),
+    /* @__PURE__ */ s.jsx(Ce, { markdown: e.instruction }),
     /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: r ? l("howToReadonly") : l(ot(e), d) }),
     e.goal === "traversal" && /* @__PURE__ */ s.jsx("p", { className: "bitflow-text-muted", children: l(e.neighbourOrder === "label" ? "tieLabel" : "tieAuthored") }),
     /* @__PURE__ */ s.jsx(
@@ -955,7 +955,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
   onChange: a,
   errors: r
 }) => {
-  const n = (i, p) => A(Ue, i, t, p), o = (i) => a({ ...e, ...i }), l = ee(e.nodes.map((i) => i.id)), d = ee(e.edges.map((i) => i.id)), b = (i, p) => o({
+  const n = (i, p) => A(Qe, i, t, p), o = (i) => a({ ...e, ...i }), l = ee(e.nodes.map((i) => i.id)), d = ee(e.edges.map((i) => i.id)), b = (i, p) => o({
     nodes: e.nodes.map(
       (m) => m.id === i ? { ...m, ...p } : m
     )
@@ -1275,8 +1275,8 @@ ve({
   Task: st,
   Form: ct,
   info: (e) => ({
-    name: A(H, "name", e),
-    description: A(H, "description", e)
+    name: A(M, "name", e),
+    description: A(M, "description", e)
   }),
   defaultData: () => ({
     instruction: "",
@@ -1294,49 +1294,49 @@ ve({
   })
 });
 ke(fe);
-xe("bitflow-styles-task-graph-path", Qe);
+xe("bitflow-styles-task-graph-path", Ue);
 export {
   bt as AnswerSchema,
   Be as DataSchema,
   oe as EPSILON,
-  Me as EdgeSchema,
+  ze as EdgeSchema,
   ct as Form,
   ie as GOALS,
   Re as GoalSchema,
   ge as GraphView,
-  $e as NeighbourOrderSchema,
-  He as NodeSchema,
+  Ee as NeighbourOrderSchema,
+  Me as NodeSchema,
   wt as REASONS,
   fe as TYPE,
   st as Task,
-  Ee as TraversalSchema,
+  $e as TraversalSchema,
   P as VIEW_HEIGHT,
   I as VIEW_WIDTH,
   he as answerOf,
   Oe as breakIn,
-  N as costOf,
+  C as costOf,
   De as cutCost,
   se as distancesFrom,
-  M as edgeBetween,
+  z as edgeBetween,
   pt as edgeById,
   ue as edgeName,
   Xe as evaluate,
-  Ue as formMessages,
+  Qe as formMessages,
   ut as isRoute,
   ce as isSequence,
   qe as judge,
-  H as messages,
-  ze as minimumCutCost,
+  M as messages,
+  He as minimumCutCost,
   x as nameOf,
   de as needsSource,
   le as needsTarget,
   q as neighboursOf,
   Fe as nodeById,
-  $ as picks,
+  E as picks,
   ft as reaches,
   Le as routeCost,
   Ie as routeEdges,
-  Q as sameCost,
+  U as sameCost,
   Pe as spanningTreeCost,
   Se as traversalOrder,
   Ae as treeCost,

package/dist/assets/directive-bitflow/{index-DnVYIuen.js → index-ISbOe239.js}

@@ -1,5 +1,5 @@
-import { L as k, ak as B, a2 as j, a9 as E, ac as q, ad as M, a5 as G, a4 as P, a as $, j as r, b as y, an as J, ao as K, a6 as N, s as Q, aa as U } from "./dom-uYx_3K1r.js";
-import { v as W, A as H, _ as V, M as F, e as X, P as Y, E as ee, L as te, R as ae } from "./bitLoaders-DIGwTcpd.js";
+import { L as k, ak as z, a2 as j, a9 as E, ac as U, ad as M, a5 as _, a4 as P, a as $, j as r, b as y, an as G, ao as J, a6 as N, s as K, aa as Q } from "./dom-uYx_3K1r.js";
+import { e as F, g as H, i as W, F as V, P as X, M as Y, B as ee, U as te, H as ae } from "./bitLoaders-CxvZkGrY.js";
 const S = {
   iff: ["<->", "<=>", "↔", "≡", "iff", "xnor"],
   implies: ["->", "=>", "→", "⊃", "implies"],
@@ -7,7 +7,7 @@ const S = {
   xor: ["⊕", "^", "xor"],
   and: ["&&", "∧", "&", "·", "*", "and"],
   not: ["¬", "!", "~", "not"]
-}, A = /* @__PURE__ */ new Map([
+}, C = /* @__PURE__ */ new Map([
   ["1", !0],
   ["0", !1],
   ["true", !0],
@@ -44,17 +44,17 @@ const S = {
     const c = /^[\p{L}_][\p{L}\p{N}_]*/u.exec(n);
     if (c) {
       const f = c[0], v = f.toLowerCase(), x = Object.keys(S).find((u) => S[u].includes(v));
-      x ? t.push({ kind: "op", op: x }) : A.has(v) ? t.push({ kind: "constant", value: A.get(v) }) : t.push({ kind: "name", name: f }), l += f.length;
+      x ? t.push({ kind: "op", op: x }) : C.has(v) ? t.push({ kind: "constant", value: C.get(v) }) : t.push({ kind: "name", name: f }), l += f.length;
       continue;
     }
-    if (A.has(n[0])) {
-      t.push({ kind: "constant", value: A.get(n[0]) }), l += 1;
+    if (C.has(n[0])) {
+      t.push({ kind: "constant", value: C.get(n[0]) }), l += 1;
       continue;
     }
     return `“${s}” does not mean anything here.`;
   }
   return t;
-}, R = (e) => {
+}, B = (e) => {
   const t = le(e);
   if (typeof t == "string") return { ok: !1, error: t };
   if (t.length === 0) return { ok: !1, error: "Write an expression." };
@@ -94,7 +94,7 @@ const S = {
   xor: "⊕",
   implies: "→",
   iff: "↔"
-}, z = {
+}, R = {
   iff: 1,
   implies: 2,
   or: 3,
@@ -106,7 +106,7 @@ const S = {
 }, g = (e) => {
   const t = (l, o) => {
     const n = g(l);
-    return z[l.kind] < o ? `(${n})` : n;
+    return R[l.kind] < o ? `(${n})` : n;
   };
   switch (e.kind) {
     case "variable":
@@ -114,9 +114,9 @@ const S = {
     case "constant":
       return e.value ? "1" : "0";
     case "not":
-      return `¬${t(e.value, z.not)}`;
+      return `¬${t(e.value, R.not)}`;
     default: {
-      const l = z[e.kind], o = ne[e.kind];
+      const l = R[e.kind], o = ne[e.kind];
       return `${t(e.left, l)} ${o} ${t(
         e.right,
         l + 1
@@ -158,16 +158,16 @@ const S = {
     case "iff":
       return w(e.left, t) === w(e.right, t);
   }
-}, C = J(
-  () => K([
+}, A = G(
+  () => J([
     k({ kind: N("variable"), name: j().min(1) }),
     k({ kind: N("constant"), value: E() }),
-    k({ kind: N("not"), value: C }),
+    k({ kind: N("not"), value: A }),
     ...["and", "or", "xor", "implies", "iff"].map(
       (e) => k({
         kind: N(e),
-        left: C,
-        right: C
+        left: A,
+        right: A
       })
     )
   ])
@@ -179,7 +179,7 @@ const S = {
    * author usually wants, and what keeps the two from disagreeing.
    */
   label: j().default(""),
-  expression: C,
+  expression: A,
   /**
    * Filled in already, as a worked step rather than a question. A table that
    * builds up to something is taught by giving away the early columns.
@@ -200,10 +200,10 @@ const S = {
    * with the first variable changing slowest, which is the same thing said
    * the other way and is what most textbooks print.
    */
-  rowOrder: G(["standard", "reversed"]).default("standard"),
+  rowOrder: _(["standard", "reversed"]).default("standard"),
   /** A point per cell instead of one for the whole table. */
   partialCredit: E().default(!0),
-  evaluation: q.default(M)
+  evaluation: U.default(M)
 }).check((e) => {
   const { variables: t, columns: l, evaluation: o } = e.value;
   new Set(t).size !== t.length && e.issues.push({
@@ -255,7 +255,7 @@ const S = {
    * three-state control has to be able to go back to having no answer, and an
    * absent key would be indistinguishable from a cell never rendered.
    */
-  cells: B(j(), B(j(), E().nullable())).default({})
+  cells: z(j(), z(j(), E().nullable())).default({})
 }), L = (e) => {
   switch (e.kind) {
     case "variable":
@@ -281,7 +281,7 @@ const S = {
       )
     };
   });
-}, Z = (e, t, l) => e?.cells?.[t]?.[l] ?? null, oe = (e, t, l, o) => ({
+}, I = (e, t, l) => e?.cells?.[t]?.[l] ?? null, oe = (e, t, l, o) => ({
   cells: {
     ...e?.cells,
     [t]: { ...e?.cells?.[t], [l]: o }
@@ -296,12 +296,12 @@ const S = {
       ])
     )
   ])
-), I = (e) => O(e).flatMap(
+), Z = (e) => O(e).flatMap(
   (t) => e.columns.filter((l) => !l.given).map((l) => ({ rowId: t.id, columnId: l.id }))
 ), ce = (e, t) => {
   const l = ie(e), o = {};
-  for (const { rowId: n, columnId: s } of I(e)) {
-    const d = Z(t, n, s);
+  for (const { rowId: n, columnId: s } of Z(e)) {
+    const d = I(t, n, s);
     o[n] ??= {}, o[n][s] = d === null ? "blank" : d === l[n][s] ? "correct" : "wrong";
   }
   return o;
@@ -311,7 +311,7 @@ const S = {
 }) => {
   if (e.evaluation.mode === "skip")
     return { state: "unknown", allowRetry: !1 };
-  const l = ce(e, t), o = I(e), n = o.filter(
+  const l = ce(e, t), o = Z(e), n = o.filter(
     ({ rowId: d, columnId: c }) => l[d]?.[c] === "correct"
   ).length, s = n === o.length && o.length > 0;
   return {
@@ -363,7 +363,7 @@ const S = {
     andValue: " und ",
     isValue: "{name} ist {value}"
   }
-}, de = ".bitflow-truth-scroll{overflow-x:auto}.bitflow-truth-table{border-collapse:collapse;width:auto;min-width:100%}.bitflow-truth-table caption{text-align:left;padding-bottom:var(--bitflow-space-xxsmall)}.bitflow-truth-table th,.bitflow-truth-table td{padding:var(--bitflow-space-xxsmall);border:1px solid var(--bitflow-color-border);text-align:left;vertical-align:middle}.bitflow-truth-table thead th{background:var(--bitflow-color-neutral-100);font-weight:var(--bitflow-font-weight-medium);white-space:nowrap}.bitflow-truth-input,.bitflow-truth-table tbody th{background:var(--bitflow-color-neutral-100);font-weight:var(--bitflow-font-weight-standard);font-variant-numeric:tabular-nums;white-space:nowrap}.bitflow-truth-note{display:block;font-size:var(--bitflow-font-size-small);font-weight:var(--bitflow-font-weight-standard);color:var(--bitflow-color-text-muted)}.bitflow-truth-cell{padding:var(--bitflow-space-xxsmall)}.bitflow-truth-select{min-height:2.25rem;min-width:var(--bitflow-truth-cell-width, 6rem)}.bitflow-truth-cell-correct .bitflow-select{border-color:var(--bitflow-color-correct);background:var(--bitflow-color-correct-surface)}.bitflow-truth-cell-wrong .bitflow-select{border-color:var(--bitflow-color-wrong);background:var(--bitflow-color-wrong-surface)}.bitflow-truth-cell-blank .bitflow-select{border-style:dashed}.bitflow-truth-editor-row{display:flex;flex-wrap:wrap;align-items:center;gap:var(--bitflow-space-xsmall)}.bitflow-truth-editor-row>.bitflow-input{flex:1 1 var(--bitflow-truth-editor-min, 7rem);min-width:0}.bitflow-truth-expression{font-family:var(--bitflow-font-family-mono)}.bitflow-truth-actions{flex:none;flex-wrap:nowrap}", he = {
+}, de = ".bitflow-truth-scroll{overflow-x:auto}.bitflow-truth-table{border-collapse:collapse;width:auto;min-width:100%}.bitflow-truth-table caption{text-align:left;padding-bottom:var(--bitflow-space-xxsmall)}.bitflow-truth-table th,.bitflow-truth-table td{padding:var(--bitflow-space-xxsmall);border:1px solid var(--bitflow-color-border);text-align:left;vertical-align:middle}.bitflow-truth-table thead th{background:var(--bitflow-color-neutral-100);font-weight:var(--bitflow-font-weight-medium);white-space:nowrap;vertical-align:top;padding:var(--bitflow-space-xsmall)}.bitflow-truth-input,.bitflow-truth-table tbody th{background:var(--bitflow-color-neutral-100);font-weight:var(--bitflow-font-weight-standard);font-variant-numeric:tabular-nums;white-space:nowrap;padding-inline:var(--bitflow-space-xsmall)}.bitflow-truth-note{display:block;font-size:var(--bitflow-font-size-small);font-weight:var(--bitflow-font-weight-standard);color:var(--bitflow-color-text-muted)}.bitflow-truth-cell{padding:var(--bitflow-space-xxsmall)}.bitflow-truth-select{min-height:2.25rem;min-width:var(--bitflow-truth-cell-width, 6rem)}.bitflow-truth-cell-correct .bitflow-select{border-color:var(--bitflow-color-correct);background:var(--bitflow-color-correct-surface)}.bitflow-truth-cell-wrong .bitflow-select{border-color:var(--bitflow-color-wrong);background:var(--bitflow-color-wrong-surface)}.bitflow-truth-cell-blank .bitflow-select{border-style:dashed}.bitflow-truth-editor-row{display:flex;flex-wrap:wrap;align-items:center;gap:var(--bitflow-space-xsmall)}.bitflow-truth-editor-row>.bitflow-input{flex:1 1 var(--bitflow-truth-editor-min, 7rem);min-width:0}.bitflow-truth-expression{font-family:var(--bitflow-font-family-mono)}.bitflow-truth-actions{flex:none;flex-wrap:nowrap}", he = {
   en: {
     instructionLabel: "Instruction",
     instructionHint: "Shown above the table. Markdown is allowed.",
@@ -463,7 +463,7 @@ B`,
         );
       }),
       e.columns.map((h, a) => {
-        const i = l?.[u.id]?.[h.id], m = h.given ? w(h.expression, u.inputs) : Z(t, u.id, h.id), b = c("cellLabel", {
+        const i = l?.[u.id]?.[h.id], m = h.given ? w(h.expression, u.inputs) : I(t, u.id, h.id), b = c("cellLabel", {
           column: v(h, a),
           inputs: x(u)
         });
@@ -554,7 +554,7 @@ B`,
       const i = { ...a };
       let m = !1;
       for (const b of e.columns) {
-        const p = R(i[b.id] ?? "");
+        const p = B(i[b.id] ?? "");
         (p.ok ? g(p.value) : void 0) !== g(b.expression) && (i[b.id] = g(b.expression), m = !0);
       }
       return m ? i : a;
@@ -566,7 +566,7 @@ B`,
     )
   }), x = (a, i) => {
     c((b) => ({ ...b, [a]: i }));
-    const m = R(i);
+    const m = B(i);
     m.ok && v(a, { expression: m.value });
   }, u = (a, i) => {
     const m = a + i;
@@ -576,7 +576,7 @@ B`,
   }, h = O(e);
   return /* @__PURE__ */ r.jsxs("div", { className: "bitflow-stack", children: [
     /* @__PURE__ */ r.jsx(
-      W,
+      F,
       {
         label: n("instructionLabel"),
         hint: n("instructionHint"),
@@ -586,7 +586,7 @@ B`,
       }
     ),
     /* @__PURE__ */ r.jsx(
-      W,
+      F,
       {
         label: n("variablesLabel"),
         hint: n("variablesHint"),
@@ -605,10 +605,10 @@ B`,
     /* @__PURE__ */ r.jsxs("fieldset", { className: "bitflow-field", children: [
       /* @__PURE__ */ r.jsx("legend", { className: "bitflow-label", children: n("columnsLabel") }),
       /* @__PURE__ */ r.jsx("span", { className: "bitflow-hint", children: n("columnsHint") }),
-      V(o, "columns") && /* @__PURE__ */ r.jsx("span", { className: "bitflow-field-error", role: "alert", children: V(o, "columns") }),
+      W(o, "columns") && /* @__PURE__ */ r.jsx("span", { className: "bitflow-field-error", role: "alert", children: W(o, "columns") }),
       e.columns.length === 0 && /* @__PURE__ */ r.jsx("p", { className: "bitflow-text-muted", children: n("noColumns") }),
       e.columns.map((a, i) => {
-        const m = d[a.id] ?? g(a.expression), b = R(m);
+        const m = d[a.id] ?? g(a.expression), b = B(m);
         return /* @__PURE__ */ r.jsxs("div", { className: "bitflow-stack-small bitflow-stack", children: [
           /* @__PURE__ */ r.jsxs("div", { className: "bitflow-truth-editor-row", children: [
             /* @__PURE__ */ r.jsx(
@@ -682,7 +682,7 @@ B`,
           ] }) : /* @__PURE__ */ r.jsx("span", { className: "bitflow-field-error", role: "alert", children: b.error }),
           H(o, `columns.${i}.expression`) && /* @__PURE__ */ r.jsx("span", { className: "bitflow-field-error", role: "alert", children: H(o, `columns.${i}.expression`) }),
           /* @__PURE__ */ r.jsx(
-            F,
+            V,
             {
               label: n("givenOf", { column: f(a, i) }),
               hint: n("givenHint"),
@@ -749,7 +749,7 @@ B`,
         }
       ),
       /* @__PURE__ */ r.jsx(
-        F,
+        V,
         {
           label: n("partialCreditLabel"),
           hint: n("partialCreditHint"),
@@ -768,10 +768,10 @@ B`,
     ] })
   ] });
 };
-Q("bitflow-styles-task-boolean-logic", de);
-const _ = "task-boolean-logic";
-U({
-  type: _,
+K("bitflow-styles-task-boolean-logic", de);
+const q = "task-boolean-logic";
+Q({
+  type: q,
   kind: "task",
   schema: se,
   evaluate: ue,
@@ -790,18 +790,18 @@ U({
     evaluation: M()
   })
 });
-ae(_);
+ae(q);
 export {
   xe as AnswerSchema,
   se as DataSchema,
   pe as Form,
-  _ as TYPE,
+  q as TYPE,
   be as Task,
   ue as evaluate,
   he as formMessages,
   g as format,
   T as messages,
-  R as parse,
+  B as parse,
   O as rowsOf,
   w as valueOf,
   ge as variablesIn