hyperbook 0.113.1 → 0.113.2

package/dist/assets/directive-bitflow/{index-D7m-hJZ9.js → index-DruC5d43.js}

@@ -1,6 +1,6 @@
-import { L as H, a4 as G, ac as ie, ad as _, a9 as de, a2 as z, P as W, a5 as ce, a as L, j as w, b as D, aa as ue, s as we } from "./dom-uYx_3K1r.js";
-import { v as X, A as F, M as q, e as he, E as me, L as fe, s as be, t as ge, R as pe } from "./bitLoaders-DIGwTcpd.js";
-const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bitflow-space-xsmall)}.bitflow-wordsearch-columns{display:grid;grid-template-columns:repeat(auto-fit,minmax(260px,1fr));gap:var(--bitflow-space-medium);align-items:start}.bitflow-wordsearch-grid{display:flex;flex-direction:column;width:min(100%,calc(var(--bitflow-wordsearch-columns, 10) * 2rem));border:var(--bitflow-border-width) solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard);background:var(--bitflow-color-surface);-webkit-user-select:none;user-select:none;touch-action:none;cursor:crosshair}.bitflow-wordsearch-grid:focus-visible{outline:none;box-shadow:var(--bitflow-shadow-outline)}.bitflow-wordsearch-row{display:flex}.bitflow-wordsearch-cell{display:flex;align-items:center;justify-content:center;flex:1 1 0;min-width:0;aspect-ratio:1;container-type:inline-size;color:var(--bitflow-color-text)}.bitflow-wordsearch-letter{font-family:var(--bitflow-font-family-mono);font-size:55cqw;line-height:1;text-transform:uppercase}.bitflow-wordsearch-cell-found{background:var(--bitflow-color-correct-surface);color:var(--bitflow-color-correct);font-weight:var(--bitflow-font-weight-bold);border-radius:var(--bitflow-radius-full)}.bitflow-wordsearch-cell-drawing{background:var(--bitflow-color-primary-light);border-radius:var(--bitflow-radius-full)}.bitflow-wordsearch-cell-cursor{box-shadow:inset 0 0 0 2px var(--bitflow-color-primary);border-radius:var(--bitflow-radius-full)}.bitflow-wordsearch-words{display:flex;flex-direction:column;gap:var(--bitflow-space-xxsmall)}.bitflow-wordsearch-list{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xxsmall) var(--bitflow-space-small);padding:0;margin:0;list-style:none}.bitflow-wordsearch-word{font-family:var(--bitflow-font-family-mono);text-transform:uppercase;letter-spacing:.05em}.bitflow-wordsearch-word-found{color:var(--bitflow-color-text-muted);text-decoration:line-through}.bitflow-wordsearch-missed{margin-inline-start:var(--bitflow-space-xxsmall);font-family:var(--bitflow-font-family);font-size:var(--bitflow-font-size-small);letter-spacing:normal;text-transform:none;color:var(--bitflow-color-wrong)}.bitflow-wordsearch-preview{margin-top:var(--bitflow-space-xxsmall);cursor:default}", y = {
+import { L as H, a4 as B, ac as ie, ad as _, a9 as de, a2 as A, P as W, a5 as ce, a as L, j as w, b as D, aa as ue, s as we } from "./dom-uYx_3K1r.js";
+import { e as X, g as T, F as q, P as he, B as me, U as fe, y as be, r as ge, H as pe } from "./bitLoaders-CxvZkGrY.js";
+const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bitflow-space-small)}.bitflow-wordsearch-columns{display:grid;grid-template-columns:repeat(auto-fit,minmax(260px,1fr));gap:var(--bitflow-space-medium);align-items:start}.bitflow-wordsearch-grid{display:flex;flex-direction:column;width:min(100%,calc(var(--bitflow-wordsearch-columns, 10) * 2rem));border:var(--bitflow-border-width) solid var(--bitflow-color-border);border-radius:var(--bitflow-radius-standard);background:var(--bitflow-color-surface);-webkit-user-select:none;user-select:none;touch-action:none;cursor:crosshair}.bitflow-wordsearch-grid:focus-visible{outline:none;box-shadow:var(--bitflow-shadow-outline)}.bitflow-wordsearch-row{display:flex}.bitflow-wordsearch-cell{display:flex;align-items:center;justify-content:center;flex:1 1 0;min-width:0;aspect-ratio:1;container-type:inline-size;color:var(--bitflow-color-text)}.bitflow-wordsearch-letter{font-family:var(--bitflow-font-family-mono);font-size:55cqw;line-height:1;text-transform:uppercase}.bitflow-wordsearch-cell-found{background:var(--bitflow-color-correct-surface);color:var(--bitflow-color-correct);font-weight:var(--bitflow-font-weight-bold);border-radius:var(--bitflow-radius-full)}.bitflow-wordsearch-cell-drawing{background:var(--bitflow-color-primary-light);border-radius:var(--bitflow-radius-full)}.bitflow-wordsearch-cell-cursor{box-shadow:inset 0 0 0 2px var(--bitflow-color-primary);border-radius:var(--bitflow-radius-full)}.bitflow-wordsearch-words{display:flex;flex-direction:column;gap:var(--bitflow-space-xxsmall)}.bitflow-wordsearch-list{display:flex;flex-wrap:wrap;gap:var(--bitflow-space-xxsmall) var(--bitflow-space-small);padding:0;margin:0;list-style:none}.bitflow-wordsearch-word{font-family:var(--bitflow-font-family-mono);text-transform:uppercase;letter-spacing:.05em}.bitflow-wordsearch-word-found{color:var(--bitflow-color-text-muted);text-decoration:line-through}.bitflow-wordsearch-missed{margin-inline-start:var(--bitflow-space-xxsmall);font-family:var(--bitflow-font-family);font-size:var(--bitflow-font-size-small);letter-spacing:normal;text-transform:none;color:var(--bitflow-color-wrong)}.bitflow-wordsearch-preview{margin-top:var(--bitflow-space-xxsmall);cursor:default}", y = {
   east: { row: 0, column: 1 },
   west: { row: 0, column: -1 },
   south: { row: 1, column: 0 },
@@ -13,21 +13,21 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
   Object.keys(y)
 ), ve = H({
   /** Stable across edits, so an answer keeps pointing at the same word. */
-  id: z().min(1),
+  id: A().min(1),
   /** The word to find. Compared in uppercase, so case never decides a mark. */
-  text: z().default(""),
+  text: A().default(""),
   /** Where its first letter sits, zero-based from the top-left. */
   row: W().int().min(0).default(0),
   column: W().int().min(0).default(0),
   direction: J.default("east")
-}), k = (e) => [...e.trim().toUpperCase()].filter((t) => t !== " "), T = (e) => {
+}), k = (e) => [...e.trim().toUpperCase()].filter((t) => t !== " "), F = (e) => {
   const t = y[e.direction];
   return k(e.text).map((r, o) => ({
     row: e.row + t.row * o,
     column: e.column + t.column * o
   }));
 }, j = (e, t) => `${e},${t}`, ye = H({
-  instruction: z().default(""),
+  instruction: A().default(""),
   rows: W().int().min(2).max(30).default(10),
   columns: W().int().min(2).max(30).default(10),
   /**
@@ -35,14 +35,14 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
    * the filler letters are part of the puzzle, and a puzzle that is
    * regenerated is a different puzzle.
    */
-  letters: z().default(""),
-  words: G(ve).default([]),
+  letters: A().default(""),
+  words: B(ve).default([]),
   /**
    * Which runs the author allows. Kept as a setting rather than read back
    * off the words, so unticking a direction nothing happens to use still
    * means something the next time the grid is built.
    */
-  directions: G(J).default(() => Object.keys(y)),
+  directions: B(J).default(() => Object.keys(y)),
   /**
    * Whether the words are listed. Off, the learner is told only how many
    * there are — much harder, and the way a word search is set as a spelling
@@ -90,7 +90,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
   }
   const u = (c, l) => s[c * o + l];
   t.forEach((c, l) => {
-    const m = T(c);
+    const m = F(c);
     if (m.some(
       (a) => a.row < 0 || a.column < 0 || a.row >= r || a.column >= o
     )) {
@@ -121,8 +121,8 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
    * word search is answered by pointing at the grid, and what was pointed at
    * is the thing worth recording.
    */
-  found: G(je).default([])
-}), Z = (e, t, r) => {
+  found: B(je).default([])
+}), G = (e, t, r) => {
   if (!(t < 0 || r < 0 || t >= e.rows || r >= e.columns))
     return e.letters[t * e.columns + r];
 }, ee = (e) => {
@@ -134,19 +134,19 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     row: e.row + s.row * u,
     column: e.column + s.column * u
   }));
-}, $ = (e) => e.map((t) => `${t.row},${t.column}`).join(">"), B = (e, t) => {
+}, $ = (e) => e.map((t) => `${t.row},${t.column}`).join(">"), I = (e, t) => {
   const r = ee(t);
   if (!r) return;
   const o = $(r), s = $([...r].reverse());
   return e.words.find((h) => {
     if (k(h.text).length < 2) return !1;
-    const u = $(T(h));
+    const u = $(F(h));
     return u === o || u === s;
   });
 }, te = (e, t) => {
   const r = /* @__PURE__ */ new Map();
   for (const o of t?.found ?? []) {
-    const s = B(e, o);
+    const s = I(e, o);
     s && r.set(s.id, s);
   }
   return [...r.values()];
@@ -172,7 +172,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
       words: ke(e, t)
     }
   };
-}, I = {
+}, P = {
   en: {
     name: "Find the words",
     description: "A letter grid with words hidden in it for the learner to find.",
@@ -293,7 +293,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
       c.set(j(b.row + p.row * M, b.column + p.column * M), R);
     }), l.push({ ...a.word, ...b });
   }
-  const i = Ae(c, { rows: t, columns: r }, l, h);
+  const i = Ee(c, { rows: t, columns: r }, l, h);
   return {
     rows: t,
     columns: r,
@@ -311,14 +311,14 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     const m = y[l];
     for (let g = 0; g < r.rows; g++)
       for (let i = 0; i < r.columns; i++) {
-        const a = Ee(e, t, { row: g, column: i }, m, r);
+        const a = Ce(e, t, { row: g, column: i }, m, r);
         a !== null && h.push({ at: { row: g, column: i, direction: l }, overlap: a });
       }
   }
   if (h.length === 0) return;
   const u = Math.max(...h.map((l) => l.overlap)), c = h.filter((l) => l.overlap === u);
   return c[Math.floor(s() * c.length)].at;
-}, Ee = (e, t, r, o, s) => {
+}, Ce = (e, t, r, o, s) => {
   let h = 0;
   for (let u = 0; u < t.length; u++) {
     const c = r.row + o.row * u, l = r.column + o.column * u;
@@ -331,7 +331,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     }
   }
   return h;
-}, Ae = (e, t, r, o) => {
+}, Ee = (e, t, r, o) => {
   const s = r.map((l) => k(l.text).join("")), h = s.map((l) => [...l].reverse().join("")), u = [.../* @__PURE__ */ new Set([...s, ...h])];
   for (let l = 0; l < t.rows; l++)
     for (let m = 0; m < t.columns; m++) {
@@ -339,7 +339,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
       if (!e.has(g))
         for (let i = 0; i < O.length; i++) {
           const a = O[Math.floor(o() * O.length)];
-          if (e.set(g, a), !Ce(e, t, { row: l, column: m }, u)) break;
+          if (e.set(g, a), !Se(e, t, { row: l, column: m }, u)) break;
         }
     }
   let c = "";
@@ -347,7 +347,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     for (let m = 0; m < t.columns; m++)
       c += e.get(j(l, m)) ?? "A";
   return c;
-}, Ce = (e, t, r, o) => {
+}, Se = (e, t, r, o) => {
   const s = Math.max(...o.map((h) => h.length));
   for (const h of [
     y.east,
@@ -366,7 +366,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
       }
     }
   return !1;
-}, Se = ({
+}, ze = ({
   data: e,
   answer: t,
   outcomes: r,
@@ -374,34 +374,34 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
   readonly: s,
   onChange: h
 }) => {
-  const u = (n, d) => D(I, n, o, d), [c, l] = L.useState({ row: 0, column: 0 }), [m, g] = L.useState(null), [i, a] = L.useState(""), b = L.useRef(null), p = L.useRef(null), [, R] = L.useReducer((n) => n + 1, 0), M = e.words.filter((n) => k(n.text).length > 1), P = t.found, E = /* @__PURE__ */ new Map();
-  for (const n of P) {
-    const d = B(e, n);
+  const u = (n, d) => D(P, n, o, d), [c, l] = L.useState({ row: 0, column: 0 }), [m, g] = L.useState(null), [i, a] = L.useState(""), b = L.useRef(null), p = L.useRef(null), [, R] = L.useReducer((n) => n + 1, 0), M = e.words.filter((n) => k(n.text).length > 1), Z = t.found, C = /* @__PURE__ */ new Map();
+  for (const n of Z) {
+    const d = I(e, n);
     if (d)
-      for (const f of T(d))
-        E.set(j(f.row, f.column), d.id);
+      for (const f of F(d))
+        C.set(j(f.row, f.column), d.id);
   }
-  const A = new Set(E.values()), re = (n) => r?.find((d) => d.wordId === n), C = p.current ? {
+  const E = new Set(C.values()), re = (n) => r?.find((d) => d.wordId === n), S = p.current ? {
     row: p.current.from.row,
     column: p.current.from.column,
     endRow: p.current.to.row,
     endColumn: p.current.to.column
-  } : m ? { row: m.row, column: m.column, endRow: c.row, endColumn: c.column } : null, K = new Set(
-    (C ? ee(C) ?? [{ row: C.row, column: C.column }] : []).map((n) => j(n.row, n.column))
-  ), U = (n) => {
-    const d = B(e, n);
+  } : m ? { row: m.row, column: m.column, endRow: c.row, endColumn: c.column } : null, U = new Set(
+    (S ? ee(S) ?? [{ row: S.row, column: S.column }] : []).map((n) => j(n.row, n.column))
+  ), K = (n) => {
+    const d = I(e, n);
     if (!d) {
       a(u("nothingThere"));
       return;
     }
-    if (A.has(d.id)) {
+    if (E.has(d.id)) {
       a(u("alreadyFound", { word: d.text }));
       return;
     }
-    h({ found: [...P, n] }), a(
+    h({ found: [...Z, n] }), a(
       u("wordFound", {
         word: d.text,
-        found: A.size + 1,
+        found: E.size + 1,
         total: M.length
       })
     );
@@ -435,14 +435,14 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     f && (p.current = { ...d, to: ne(d.from, f) }, R());
   }, () => {
     const n = p.current;
-    p.current = null, R(), n && (l(n.to), U({
+    p.current = null, R(), n && (l(n.to), K({
       row: n.from.row,
       column: n.from.column,
       endRow: n.to.row,
       endColumn: n.to.column
     }));
   });
-  const S = (n, d) => {
+  const z = (n, d) => {
     l((f) => ({
       row: Math.min(e.rows - 1, Math.max(0, f.row + n)),
       column: Math.min(e.columns - 1, Math.max(0, f.column + d))
@@ -450,10 +450,10 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
   }, ae = (n) => {
     if (s) return;
     const d = {
-      ArrowRight: () => S(0, 1),
-      ArrowLeft: () => S(0, -1),
-      ArrowDown: () => S(1, 0),
-      ArrowUp: () => S(-1, 0),
+      ArrowRight: () => z(0, 1),
+      ArrowLeft: () => z(0, -1),
+      ArrowDown: () => z(1, 0),
+      ArrowUp: () => z(-1, 0),
       Home: () => l((f) => ({ ...f, column: 0 })),
       End: () => l((f) => ({ ...f, column: e.columns - 1 })),
       Escape: () => {
@@ -476,11 +476,11 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
       endRow: c.row,
       endColumn: c.column
     };
-    g(null), U(n);
+    g(null), K(n);
   }, le = (n, d) => {
-    const f = E.get(j(n, d)), x = M.find((v) => v.id === f);
+    const f = C.get(j(n, d)), x = M.find((v) => v.id === f);
     return u("cellAt", {
-      letter: Z(e, n, d) ?? "",
+      letter: G(e, n, d) ?? "",
       row: n + 1,
       column: d + 1
     }) + (x ? `. ${u("partOf", { word: x.text })}` : "");
@@ -502,15 +502,15 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
           onKeyDown: ae,
           children: Array.from({ length: e.rows }, (n, d) => /* @__PURE__ */ w.jsx("div", { role: "row", className: "bitflow-wordsearch-row", children: Array.from({ length: e.columns }, (f, x) => {
             const v = j(d, x), N = ["bitflow-wordsearch-cell"];
-            return E.has(v) && N.push("bitflow-wordsearch-cell-found"), K.has(v) && N.push("bitflow-wordsearch-cell-drawing"), c.row === d && c.column === x && N.push("bitflow-wordsearch-cell-cursor"), /* @__PURE__ */ w.jsx(
+            return C.has(v) && N.push("bitflow-wordsearch-cell-found"), U.has(v) && N.push("bitflow-wordsearch-cell-drawing"), c.row === d && c.column === x && N.push("bitflow-wordsearch-cell-cursor"), /* @__PURE__ */ w.jsx(
               "span",
               {
                 id: `cell-${d}-${x}`,
                 role: "gridcell",
                 className: N.join(" "),
                 "aria-label": le(d, x),
-                "aria-selected": K.has(v),
-                children: /* @__PURE__ */ w.jsx("span", { className: "bitflow-wordsearch-letter", children: Z(e, d, x) })
+                "aria-selected": U.has(v),
+                children: /* @__PURE__ */ w.jsx("span", { className: "bitflow-wordsearch-letter", children: G(e, d, x) })
               },
               x
             );
@@ -518,9 +518,9 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
         }
       ),
       /* @__PURE__ */ w.jsxs("div", { className: "bitflow-wordsearch-words", children: [
-        /* @__PURE__ */ w.jsx("h3", { className: "bitflow-label", children: u("wordsHeading", { found: A.size, total: M.length }) }),
+        /* @__PURE__ */ w.jsx("h3", { className: "bitflow-label", children: u("wordsHeading", { found: E.size, total: M.length }) }),
         e.showWords ? /* @__PURE__ */ w.jsx("ul", { className: "bitflow-wordsearch-list", children: M.map((n) => {
-          const d = re(n.id), f = A.has(n.id);
+          const d = re(n.id), f = E.has(n.id);
           return /* @__PURE__ */ w.jsxs(
             "li",
             {
@@ -541,7 +541,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     ] }),
     /* @__PURE__ */ w.jsx("div", { className: "bitflow-visually-hidden", role: "status", "aria-live": "polite", children: i })
   ] });
-}, ze = ({
+}, Ae = ({
   data: e,
   answer: t,
   result: r,
@@ -551,7 +551,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
 }) => /* @__PURE__ */ w.jsxs("div", { className: "bitflow-stack", children: [
   /* @__PURE__ */ w.jsx(fe, { markdown: e.instruction }),
   /* @__PURE__ */ w.jsx(
-    Se,
+    ze,
     {
       data: e,
       answer: { found: t?.found ?? [] },
@@ -575,7 +575,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
       direction: "east"
     };
   });
-}, Te = ({
+}, Fe = ({
   data: e,
   locale: t,
   onChange: r,
@@ -597,7 +597,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
     [e.words, e.rows, e.columns, u]
   ), m = new Set(
     e.words.flatMap(
-      (i) => k(i.text).length > 1 ? T(i).map((a) => j(a.row, a.column)) : []
+      (i) => k(i.text).length > 1 ? F(i).map((a) => j(a.row, a.column)) : []
     )
   ), g = (i) => /* @__PURE__ */ w.jsx(ge, { label: s(i), children: (a) => /* @__PURE__ */ w.jsx(
     "input",
@@ -632,7 +632,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
         hint: s("wordsHint"),
         rows: 6,
         value: De(e.words),
-        error: F(o, "words"),
+        error: T(o, "words"),
         onChange: (i) => c({ words: He(i, e.words) })
       }
     ),
@@ -643,7 +643,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
         g("rows"),
         g("columns")
       ] }),
-      F(o, "letters") && /* @__PURE__ */ w.jsx("span", { className: "bitflow-field-error", role: "alert", children: F(o, "letters") })
+      T(o, "letters") && /* @__PURE__ */ w.jsx("span", { className: "bitflow-field-error", role: "alert", children: T(o, "letters") })
     ] }),
     /* @__PURE__ */ w.jsxs("fieldset", { className: "bitflow-field", children: [
       /* @__PURE__ */ w.jsx("legend", { className: "bitflow-label", children: s("directionsLabel") }),
@@ -674,7 +674,7 @@ const xe = ".bitflow-wordsearch{display:flex;flex-direction:column;gap:var(--bit
             "span",
             {
               className: m.has(j(a, p)) ? "bitflow-wordsearch-cell bitflow-wordsearch-cell-found" : "bitflow-wordsearch-cell",
-              children: /* @__PURE__ */ w.jsx("span", { className: "bitflow-wordsearch-letter", children: Z(e, a, p) })
+              children: /* @__PURE__ */ w.jsx("span", { className: "bitflow-wordsearch-letter", children: G(e, a, p) })
             },
             p
           )) }, a))
@@ -707,11 +707,11 @@ ue({
   kind: "task",
   schema: ye,
   evaluate: We,
-  Task: ze,
-  Form: Te,
+  Task: Ae,
+  Form: Fe,
   info: (e) => ({
-    name: D(I, "name", e),
-    description: D(I, "description", e)
+    name: D(P, "name", e),
+    description: D(P, "description", e)
   }),
   defaultData: () => ({
     instruction: "",
@@ -731,24 +731,24 @@ export {
   y as DIRECTIONS,
   ye as DataSchema,
   J as DirectionSchema,
-  Te as Form,
+  Fe as Form,
   je as SelectionSchema,
   oe as TYPE,
-  ze as Task,
-  Se as WordGrid,
+  Ae as Task,
+  ze as WordGrid,
   ve as WordSchema,
   j as cellKey,
   ee as cellsBetween,
-  T as cellsOf,
+  F as cellsOf,
   We as evaluate,
   Ne as formMessages,
   te as foundWords,
   Q as generate,
-  Z as letterAt,
+  G as letterAt,
   k as lettersOf,
-  I as messages,
+  P as messages,
   ke as outcomes,
   Me as scoreOf,
   Le as seededRandom,
-  B as wordFound
+  I as wordFound
 };