hyperbook 0.113.1 → 0.113.3

package/dist/assets/directive-bitflow/{index-8jTO-NJA.js → index-D0NtgeiX.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 { 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) => {
   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,40 +132,40 @@ 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),
+  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",
   "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,8 +289,8 @@ 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");
-}, Ze = (e, t) => {
+  return r === void 0 ? v("notToTarget") : U(a, r) ? v("correct") : v("notShortest");
+}, Ye = (e, t) => {
   const a = Se(e, e.sourceId);
   let r = 0;
   for (; r < t.length && r < a.length && t[r] === a[r]; )
@@ -301,32 +301,32 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (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");
   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");
-}, Ye = (e, t) => {
+  return r === void 0 ? v("treeDisconnected") : U(Ae(e, t), r) ? v("correct") : v("notCheapestTree");
+}, Ke = (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)
   );
   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);
   }
@@ -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
     )
@@ -1013,7 +1013,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (e, t) => Math.abs
       }
     ),
     /* @__PURE__ */ s.jsx(
-      Z,
+      Y,
       {
         label: n("directedLabel"),
         hint: n("directedHint"),
@@ -1023,7 +1023,7 @@ const N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (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 N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (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 N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (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 N = (e, t) => e.weighted ? t.weight : 1, oe = 1e-9, Q = (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"),
@@ -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-DtsDy2By.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 { y as h, v as j, M as x, t as q, L as S, R as z } from "./bitLoaders-DIGwTcpd.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",
@@ -89,7 +89,7 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
     misconfigured: "Bu değerlendirme bir yere gönderecek şekilde ayarlanmamış. Hazırlayan kişiye söyle — çalışman sekmeyi kapatana kadar burada duruyor.",
     unframed: "Bu sayfa gönderilebilecek bir sayfanın içinde değil, bu yüzden çalışman hiçbir yere gitmedi. Hazırlayan kişiye söyle — çalışman sekmeyi kapatana kadar burada duruyor."
   }
-}, M = w({
+}, U = w({
   title: l().default(""),
   markdown: l().default(""),
   /**
@@ -134,7 +134,7 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
   } catch {
     return !1;
   }
-}, U = {
+}, H = {
   en: {
     titleLabel: "Title",
     markdownLabel: "Closing message",
@@ -165,7 +165,7 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
     continueLabelLabel: "Beschriftung des Links",
     continueLabelHint: "Leer lassen für „Weiter“."
   }
-}, H = () => typeof window < "u" && window.parent !== window.self, C = ({
+}, M = () => typeof window < "u" && window.parent !== window.self, C = ({
   data: e,
   locale: r,
   readonly: t,
@@ -177,7 +177,7 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
         n("misconfigured");
         return;
       }
-      if (!H()) {
+      if (!M()) {
         n("unframed");
         return;
       }
@@ -216,12 +216,12 @@ const T = ".bitflow-handoff-state{margin:0;min-height:var(--bitflow-space-small)
     ] }),
     f(e.continueUrl) && /* @__PURE__ */ i.jsx("p", { children: /* @__PURE__ */ i.jsx("a", { className: "bitflow-handoff-link", href: e.continueUrl.trim(), children: e.continueLabel || s("continueFallback") }) })
   ] });
-}, E = ({
+}, F = ({
   data: e,
   locale: r,
   onChange: t
 }) => {
-  const a = (n) => u(U, n, r), s = e.postMessage && e.messageOrigin.trim() !== "" && !m(e.messageOrigin) ? a("originInvalid") : void 0, o = e.continueUrl.trim() !== "" && !f(e.continueUrl) ? a("continueUrlInvalid") : void 0;
+  const a = (n) => u(H, n, r), s = e.postMessage && e.messageOrigin.trim() !== "" && !m(e.messageOrigin) ? a("originInvalid") : void 0, o = e.continueUrl.trim() !== "" && !f(e.continueUrl) ? a("continueUrlInvalid") : void 0;
   return /* @__PURE__ */ i.jsxs("div", { className: "bitflow-stack", children: [
     /* @__PURE__ */ i.jsx(
       h,
@@ -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,12 +291,12 @@ 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: M,
+  schema: U,
   Task: C,
-  Form: E,
+  Form: F,
   info: (e) => ({
     name: u(g, "name", e),
     description: u(g, "description", e)
@@ -314,8 +314,8 @@ L({
 });
 z(b);
 export {
-  M as DataSchema,
-  E as Form,
+  U as DataSchema,
+  F as Form,
   A as MESSAGE_TYPE,
   b as TYPE,
   C as Task,