hyperbook 0.113.1 → 0.113.2

package/dist/assets/directive-bitflow/{index-C_ZTSeqv.js → index-DYWo0PUv.js}

@@ -1,6 +1,6 @@
-import { L as j, a2 as R, ac as O, ad as T, a9 as p, P as M, j as o, a5 as A, a as U, b as w, aa as $, s as Z } from "./dom-uYx_3K1r.js";
-import { v as G, P as k, y as Y, A as b, t as _, M as f, e as J, E as K, L as Q, R as X } from "./bitLoaders-DIGwTcpd.js";
-const C = [
+import { L as j, a2 as S, ac as M, ad as T, a9 as p, P as O, j as o, a5 as C, a as U, b as w, aa as $, s as Z } from "./dom-uYx_3K1r.js";
+import { e as G, M as k, C as Y, g as b, r as _, F as f, P as J, B as K, U as Q, H as X } from "./bitLoaders-CxvZkGrY.js";
+const A = [
   "decimal",
   "binary",
   "octal",
@@ -15,7 +15,7 @@ const C = [
   binary: ["0b"],
   octal: ["0o"],
   hex: ["0x"]
-}, D = "0123456789abcdef", fe = [
+}, H = "0123456789abcdef", fe = [
   "empty",
   "badDigit",
   "negative",
@@ -46,7 +46,7 @@ const C = [
       n = n.slice(d.length);
     }
   if (n === "") return { ok: !1, reason: "empty" };
-  const c = D.slice(0, r);
+  const c = H.slice(0, r);
   if ([...n].some((d) => !c.includes(d)))
     return { ok: !1, reason: "badDigit" };
   const u = m(a.bitWidth, t);
@@ -56,7 +56,7 @@ const C = [
       return { ok: !1, reason: "notFullWidth" };
   }
   let i = 0n;
-  for (const d of n) i = i * BigInt(r) + BigInt(D.indexOf(d));
+  for (const d of n) i = i * BigInt(r) + BigInt(H.indexOf(d));
   return !s && a.signed && a.bitWidth > 0 && t !== "decimal" && i >= g(a.bitWidth - 1) && (i -= g(a.bitWidth)), s && (i = -i), z(i, a.bitWidth, a.signed) ? { ok: !0, values: [i] } : { ok: !1, reason: "tooWide" };
 }, x = (e, t, a) => {
   if (t === "text") {
@@ -82,16 +82,16 @@ const C = [
   if (r < 0n) return `-${(-r).toString(n)}`;
   const l = r.toString(n), s = m(a.bitWidth, t);
   return s > 0 ? l.padStart(s, "0") : l;
-}, S = (e, t, a) => t === "text" ? e.map(
+}, R = (e, t, a) => t === "text" ? e.map(
   (n) => n >= 0n && n <= 0x10ffffn ? String.fromCodePoint(Number(n)) : "?"
-).join("") : e.map((n) => ie(n, t, a)).join(" "), ne = (e, t) => e.length === t.length && e.every((a, n) => a === t[n]), re = (e) => e.map((t) => t.toString(10)).join(" "), H = A(C), B = A(["answer", "digits"]), F = j({
-  instruction: R().default(""),
-  sourceRepresentation: H.default("decimal"),
+).join("") : e.map((n) => ie(n, t, a)).join(" "), ne = (e, t) => e.length === t.length && e.every((a, n) => a === t[n]), re = (e) => e.map((t) => t.toString(10)).join(" "), D = C(A), B = C(["answer", "digits"]), F = j({
+  instruction: S().default(""),
+  sourceRepresentation: D.default("decimal"),
   /** The value as the author writes it, in the source representation. */
-  sourceValue: R().default(""),
-  targetRepresentation: H.default("binary"),
+  sourceValue: S().default(""),
+  targetRepresentation: D.default("binary"),
   /** Bits the value is held in. `0` for a plain integer of no fixed width. */
-  bitWidth: M().int().min(0).max(64).default(8),
+  bitWidth: O().int().min(0).max(64).default(8),
   signed: p().default(!1),
   /** Whether `0b`, `0o` and `0x` are accepted in front of the answer. */
   allowPrefix: p().default(!0),
@@ -100,7 +100,7 @@ const C = [
   /** Whether the leading zeros of the width have to be written out. */
   requireFullWidth: p().default(!0),
   scoring: B.default("answer"),
-  evaluation: O.default(T)
+  evaluation: M.default(T)
 }).check((e) => {
   if (e.value.evaluation.mode !== "auto") return;
   const t = e.value;
@@ -137,7 +137,7 @@ const C = [
    * stored copy that can disagree with the box after a reload is worse than
    * reading it twice.
    */
-  raw: R().default("")
+  raw: S().default("")
 }), v = (e) => ({
   bitWidth: e.bitWidth,
   signed: e.signed,
@@ -152,16 +152,16 @@ const C = [
   return t.ok ? t.values : void 0;
 }, se = (e) => {
   const t = V(e);
-  return t === void 0 ? "" : S(t, e.targetRepresentation, v(e));
+  return t === void 0 ? "" : R(t, e.targetRepresentation, v(e));
 }, oe = (e, t) => {
   const a = V(e);
   if (a === void 0) return { correct: !1, reason: "empty" };
-  const n = v(e), r = x(t?.raw ?? "", e.targetRepresentation, n), l = e.scoring === "digits", s = S(a, e.targetRepresentation, n).toLowerCase();
+  const n = v(e), r = x(t?.raw ?? "", e.targetRepresentation, n), l = e.scoring === "digits", s = R(a, e.targetRepresentation, n).toLowerCase();
   if (!r.ok)
     return l ? { correct: !1, reason: r.reason, rightDigits: 0, totalDigits: s.length } : { correct: !1, reason: r.reason };
   const c = ne(r.values, a);
   if (!l) return { correct: c, reason: c ? "correct" : "wrongValue" };
-  const u = S(r.values, e.targetRepresentation, n).toLowerCase();
+  const u = R(r.values, e.targetRepresentation, n).toLowerCase();
   let i = 0;
   for (let d = 0; d < s.length; d++)
     u[d] === s[d] && (i += 1);
@@ -316,7 +316,7 @@ const C = [
   locale: r,
   onAnswerChange: l
 }) => {
-  const s = (h, q) => w(L, h, r, q), c = U.useId(), u = N(e.targetRepresentation, s), i = m(e.bitWidth, e.targetRepresentation), d = x(t?.raw ?? "", e.targetRepresentation, v(e)), W = a?.detail?.reason, E = [
+  const s = (h, E) => w(L, h, r, E), c = U.useId(), u = N(e.targetRepresentation, s), i = m(e.bitWidth, e.targetRepresentation), d = x(t?.raw ?? "", e.targetRepresentation, v(e)), W = a?.detail?.reason, q = [
     e.requireFullWidth && i > 0 ? s("fullWidthHint", { digits: i }) : "",
     e.allowPrefix && e.targetRepresentation !== "text" ? s("prefixHint") : "",
     e.allowSeparators && e.targetRepresentation !== "text" ? s("separatorHint") : ""
@@ -339,7 +339,7 @@ const C = [
     /* @__PURE__ */ o.jsx("p", { className: "bitflow-text-muted", children: n ? s("howToReadonly") : s("howTo", { target: u }) }),
     /* @__PURE__ */ o.jsxs("div", { className: "bitflow-field", children: [
       /* @__PURE__ */ o.jsx("label", { className: "bitflow-label", htmlFor: c, children: s("answerLabel", { target: u }) }),
-      E.map((h) => /* @__PURE__ */ o.jsx("span", { className: "bitflow-hint", children: h }, h)),
+      q.map((h) => /* @__PURE__ */ o.jsx("span", { className: "bitflow-hint", children: h }, h)),
       /* @__PURE__ */ o.jsx(
         "input",
         {
@@ -377,7 +377,7 @@ const C = [
   onChange: a,
   errors: n
 }) => {
-  const r = (i, d) => w(de, i, t, d), l = (i) => a({ ...e, ...i }), s = C.map((i) => ({
+  const r = (i, d) => w(de, i, t, d), l = (i) => a({ ...e, ...i }), s = A.map((i) => ({
     value: i,
     label: r(
       `representation${i[0].toUpperCase()}${i.slice(1)}`
@@ -541,8 +541,8 @@ export {
   ge as Form,
   y as RADIX,
   fe as READ_FAILURES,
-  C as REPRESENTATIONS,
-  H as RepresentationSchema,
+  A as REPRESENTATIONS,
+  D as RepresentationSchema,
   B as ScoringSchema,
   P as TYPE,
   ue as Task,
@@ -560,5 +560,5 @@ export {
   x as read,
   ne as sameValue,
   I as sourceOptions,
-  S as write
+  R as write
 };