@konoui/mjimage 0.6.0 → 0.7.0

package/dist/index.js

@@ -1,4 +1,4 @@
-const Tn = "MS Gothic, sans-serif", gt = {
+const Nn = "MS Gothic, sans-serif", gt = {
   WIDTH: 66,
   HEIGHT: 90,
   TEXT_SCALE: 0.8,
@@ -6,7 +6,7 @@ const Tn = "MS Gothic, sans-serif", gt = {
 }, Qe = {
   WIDTH: 125,
   HEIGHT: 27.5
-}, ws = { BASE: 40 }, ut = ",", f = {
+}, ws = { BASE: 40 }, ut = ",", p = {
   M: "m",
   P: "p",
   S: "s",
@@ -57,12 +57,12 @@ const Tn = "MS Gothic, sans-serif", gt = {
   N2: "4z2",
   N3: "4z3",
   N4: "4z4"
-}, De = {
+}, Be = {
   [_.E]: "東",
   [_.S]: "南",
   [_.W]: "西",
   [_.N]: "北"
-}, In = {
+}, Tn = {
   [O.E1]: "東１局",
   [O.E2]: "東２局",
   [O.E3]: "東３局",
@@ -111,7 +111,7 @@ class Po {
   };
   measureTableFontContext = (t) => {
     const e = this.measureFontContext(
-      Tn,
+      Nn,
       ws.BASE * t
     );
     return e.textHeight = e.textWidth, e.numHeight = e.numWidth, e;
@@ -156,7 +156,7 @@ const fe = (s, t) => {
     }
     return s.n - t.n;
   }
-  const e = [f.M, f.P, f.S, f.Z, f.BACK];
+  const e = [p.M, p.P, p.S, p.Z, p.BACK];
   return e.indexOf(s.t) - e.indexOf(t.t);
 }, _s = (s, t) => {
   const e = [
@@ -182,10 +182,10 @@ function k(s) {
   return s.isNum() && s.n == 5;
 }
 function bs(s) {
-  for (const t of Object.values(f))
+  for (const t of Object.values(p))
     if (t == s)
       return [t, !0];
-  return [f.BACK, !1];
+  return [p.BACK, !1];
 }
 class y {
   constructor(t, e, n = []) {
@@ -195,7 +195,7 @@ class y {
    * 一つの牌を表す文字列から牌を返す。
    */
   static from(t) {
-    const e = new W(t).tiles();
+    const e = new K(t).tiles();
     if (e.length != 1) throw new Error(`input is not a single tile ${t}`);
     return e[0];
   }
@@ -203,7 +203,7 @@ class y {
    * 文字列の牌を返す。
    */
   toString() {
-    return this.t === f.BACK ? this.t : `${[...this.ops].sort(_s).join("")}${this.n}${this.t}`;
+    return this.t === p.BACK ? this.t : `${[...this.ops].sort(_s).join("")}${this.n}${this.t}`;
   }
   toJSON() {
     return this.toString();
@@ -225,19 +225,20 @@ class y {
   }
   /**
    * 数牌である場合 true を返す。
+   * false の場合、字牌もしくは裏牌のどちらかとなる。
    */
   isNum() {
-    return this.t == f.M || this.t == f.P || this.t == f.S;
+    return this.t == p.M || this.t == p.P || this.t == p.S;
   }
   /**
    * 同じ牌の場合 true を返す。
    * オペレーターの比較判定は行わない。
    */
   equals(t) {
-    return t.t == f.BACK && this.t == f.BACK ? !0 : this.t == t.t && this.n == t.n;
+    return t.t == p.BACK && this.t == p.BACK ? !0 : this.t == t.t && this.n == t.n;
   }
 }
-class I {
+class T {
   _tiles;
   _type;
   constructor(t, e) {
@@ -254,7 +255,7 @@ class I {
    * 文字列からブロックを生成する。
    */
   static from(t) {
-    const e = new W(t).parse();
+    const e = new K(t).parse();
     if (e.length != 1) throw new Error(`block must be 1: ${t}`);
     return e[0];
   }
@@ -262,7 +263,7 @@ class I {
    * シリアライズされた情報をデシリアライズしブロックを返す。
    */
   static deserialize(t) {
-    const e = I.from(t.tiles), n = e.type;
+    const e = T.from(t.tiles), n = e.type;
     if (!(t.type == w.PAIR || t.type == w.ISOLATED || t.type == w.THREE || t.type == w.RUN) && n != t.type)
       throw new Error(
         `input type is ${t.type} but got is ${n}: ${t.tiles}`
@@ -326,45 +327,45 @@ class I {
 const yt = (s) => {
   let t = "";
   for (const e of s) {
-    if (e.t == f.BACK) return s.join("");
+    if (e.t == p.BACK) return s.join("");
     t += e.toString().slice(0, -1);
   }
   return `${t}${s[0].t}`;
-}, Be = (s) => {
+}, We = (s) => {
   if (s.length == 0) return "";
   let t = s[0].t, e = "";
   for (const i of s) {
-    const r = i.t, o = r == f.BACK ? i.toString() : i.toString().slice(0, -1);
-    r != t && t != f.BACK && (e += t), t = r, e += o;
+    const r = i.t, o = r == p.BACK ? i.toString() : i.toString().slice(0, -1);
+    r != t && t != p.BACK && (e += t), t = r, e += o;
   }
   const n = s.at(-1);
-  return n.t != f.BACK && (e += n.t), e;
+  return n.t != p.BACK && (e += n.t), e;
 };
-class J extends I {
+class q extends T {
   constructor(t) {
     super(t, w.CHI);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.CHI });
+    return T.deserialize({ tiles: t, type: w.CHI });
   }
   toString() {
     return yt(this.tiles);
   }
 }
-class X extends I {
+class U extends T {
   constructor(t) {
     super(t, w.PON);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.PON });
+    return T.deserialize({ tiles: t, type: w.PON });
   }
   toString() {
     return yt(this.tiles);
   }
 }
-class x extends I {
+class C extends T {
   constructor(t) {
-    const e = t.filter((i) => i.t != f.BACK), n = e[0];
+    const e = t.filter((i) => i.t != p.BACK), n = e[0];
     if (e.length < t.length) {
       if (k(n)) {
         const i = new y(n.t, 5);
@@ -387,45 +388,45 @@ class x extends I {
    */
   get tilesWithBack() {
     const t = this.tiles[0].clone({ remove: m.RED }), e = k(t) ? t.clone({ add: m.RED }) : t;
-    return [new y(f.BACK, 0), e, t, new y(f.BACK, 0)];
+    return [new y(p.BACK, 0), e, t, new y(p.BACK, 0)];
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.AN_KAN });
+    return T.deserialize({ tiles: t, type: w.AN_KAN });
   }
   toString() {
-    return Be(this.tilesWithBack);
+    return We(this.tilesWithBack);
   }
 }
-class q extends I {
+class Z extends T {
   constructor(t) {
     super(t, w.DAI_KAN);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.DAI_KAN });
+    return T.deserialize({ tiles: t, type: w.DAI_KAN });
   }
   toString() {
     return yt(this.tiles);
   }
 }
-class L extends I {
+class W extends T {
   constructor(t) {
     super(t, w.SHO_KAN);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.SHO_KAN });
+    return T.deserialize({ tiles: t, type: w.SHO_KAN });
   }
   /**
    * ポンしたブロックから小明槓を生成する。
    */
   static fromPon(t, e) {
     const n = t.tiles.findIndex((r) => r.has(m.HORIZONTAL)), i = [...t.tiles];
-    return i.splice(n, 0, e.clone({ add: m.HORIZONTAL })), new L(i);
+    return i.splice(n, 0, e.clone({ add: m.HORIZONTAL })), new W(i);
   }
   toString() {
     return yt(this.tiles);
   }
 }
-class D extends I {
+class R extends T {
   constructor(t, e) {
     super([t, e], w.PAIR);
   }
@@ -433,37 +434,37 @@ class D extends I {
     return yt(this.tiles);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.PAIR });
+    return T.deserialize({ tiles: t, type: w.PAIR });
   }
 }
-class G extends I {
+class L extends T {
   constructor(t) {
     super(t, w.THREE);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.THREE });
+    return T.deserialize({ tiles: t, type: w.THREE });
   }
   toString() {
     return yt(this.tiles);
   }
 }
-class dt extends I {
+class dt extends T {
   constructor(t) {
     super(t, w.RUN);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.RUN });
+    return T.deserialize({ tiles: t, type: w.RUN });
   }
   toString() {
     return yt(this.tiles);
   }
 }
-class vn extends I {
+class vn extends T {
   constructor(t) {
     super([t], w.ISOLATED);
   }
   static from(t) {
-    return I.deserialize({
+    return T.deserialize({
       tiles: t,
       type: w.ISOLATED
     });
@@ -472,43 +473,43 @@ class vn extends I {
     return this.tiles[0].toString();
   }
 }
-class Ut extends I {
+class Ut extends T {
   constructor(t) {
     super(t, w.HAND);
   }
   static from(t) {
-    return I.deserialize({ tiles: t, type: w.HAND });
+    return T.deserialize({ tiles: t, type: w.HAND });
   }
   toString() {
-    return Be(this.tiles);
+    return We(this.tiles);
   }
 }
-class Sn extends I {
+class Sn extends T {
   constructor(t, e) {
     super(t, e);
   }
   toString() {
-    return this.is(w.IMAGE_DISCARD) ? this.tiles.join("") : Be(this.tiles);
+    return this.is(w.IMAGE_DISCARD) ? this.tiles.join("") : We(this.tiles);
   }
 }
 const ne = (s, t) => {
   switch (t) {
     case w.CHI:
-      return new J([s[0], s[1], s[2]]);
+      return new q([s[0], s[1], s[2]]);
     case w.PON:
-      return new X([s[0], s[1], s[2]]);
+      return new U([s[0], s[1], s[2]]);
     case w.AN_KAN:
-      return new x(s);
+      return new C(s);
     case w.DAI_KAN:
-      return new q(s);
+      return new Z(s);
     case w.SHO_KAN:
-      return new L(s);
+      return new W(s);
     case w.THREE:
-      return new G(s);
+      return new L(s);
     case w.RUN:
       return new dt(s);
     case w.PAIR:
-      return new D(s[0], s[1]);
+      return new R(s[0], s[1]);
     case w.ISOLATED:
       return new vn(s[0]);
     case w.HAND:
@@ -517,7 +518,7 @@ const ne = (s, t) => {
       return new Sn(s, t);
   }
 };
-class W {
+class K {
   constructor(t) {
     this.input = t, this.input = t.replace(/\s/g, "");
   }
@@ -552,14 +553,14 @@ class W {
       }
       const [r, o] = en(i, n);
       if (o) {
-        if (r == f.BACK) {
+        if (r == p.BACK) {
           e.push(new y(r, 0)), t.readChar();
           continue;
         }
-        e.push(...Ts(n, r)), n = [], t.readChar();
+        e.push(...Ns(n, r)), n = [], t.readChar();
         continue;
       } else {
-        const [a, c] = Is(t);
+        const [a, c] = Ts(t);
         if (c) {
           n.push(a), t.readChar();
           continue;
@@ -596,7 +597,7 @@ class W {
     if (t.length == 0) return;
     if (t.length > this.maxInputLength)
       throw new Error(`exceeded maximum input length(${t.length})`);
-    const e = t.charAt(t.length - 1), [n, i] = en(e, [new y(f.BACK, 1)]);
+    const e = t.charAt(t.length - 1), [n, i] = en(e, [new y(p.BACK, 1)]);
     if (!i)
       throw new Error(
         `last character: ${e} is not type value: ${t}`
@@ -609,11 +610,11 @@ function tn(s) {
     return s[0].has(m.DORA) ? w.IMAGE_DORA : s[0].has(m.TSUMO) ? w.TSUMO : w.HAND;
   const t = s.every((r) => r.equals(s[0])), e = s.filter((r) => r.has(m.HORIZONTAL)).length, n = s.filter(
     (r) => r.has(m.TSUMO) || r.has(m.DORA)
-  ).length, i = s.filter((r) => r.t == f.BACK).length;
+  ).length, i = s.filter((r) => r.t == p.BACK).length;
   if (n > 0) return w.UNKNOWN;
   if (e == 0 && i == 0) return w.HAND;
   if (s.length === 3 && i === 0)
-    return t ? w.PON : e == 1 && Ns(s) ? w.CHI : w.IMAGE_DISCARD;
+    return t ? w.PON : e == 1 && Is(s) ? w.CHI : w.IMAGE_DISCARD;
   if (s.length == 4 && i == 2) return w.AN_KAN;
   if (s.length == 4 && t) {
     if (e == 1) return w.DAI_KAN;
@@ -621,7 +622,7 @@ function tn(s) {
   }
   return e == 1 || n == 0 ? w.IMAGE_DISCARD : w.UNKNOWN;
 }
-function Ns(s) {
+function Is(s) {
   const t = [...s].sort(fe);
   if (t.some((n) => t[0].t != n.t)) return !1;
   const e = t.map((n) => n.n);
@@ -629,7 +630,7 @@ function Ns(s) {
     if (e[n] != e[n + 1] - 1) return !1;
   return !0;
 }
-function Ts(s, t) {
+function Ns(s, t) {
   return s.map((e) => {
     const n = new y(t, e.n, e.ops);
     return n.isNum() && n.n == 0 ? n.clone({ n: 5, add: m.RED }) : n;
@@ -643,17 +644,17 @@ function en(s, t) {
       const o = t[r];
       s === "d" && (t[r].n = o.n + 4);
     }
-    return [f.Z, !0];
+    return [p.Z, !0];
   }
-  return [f.BACK, !1];
+  return [p.BACK, !1];
 }
 function On(s) {
   const t = Number(s), e = 0 <= t && t <= 9;
   return [t, e];
 }
-function Is(s) {
+function Ts(s) {
   const t = Object.values(m);
-  if (!t.includes(s.char)) return [new y(f.BACK, 0), !1];
+  if (!t.includes(s.char)) return [new y(p.BACK, 0), !1];
   const e = [];
   for (let n = 0; n < 4; n++) {
     const i = s.peekCharN(n);
@@ -662,7 +663,7 @@ function Is(s) {
       const [r, o] = On(i);
       if (!o) break;
       for (const c of e) s.readChar();
-      const a = new y(f.BACK, r, e);
+      const a = new y(p.BACK, r, e);
       if (a.has(m.RED) && a.n != 5)
         throw new Error(`found ${m.RED} but number is not 5: ${r}`);
       if (a.has(m.DORA) && a.has(m.TSUMO))
@@ -670,9 +671,9 @@ function Is(s) {
       return [a, !0];
     }
   }
-  return [new y(f.BACK, 0), !1];
+  return [new y(p.BACK, 0), !1];
 }
-function P(s, t = !1) {
+function B(s, t = !1) {
   const e = {
     [_.E]: s,
     [_.S]: s,
@@ -685,14 +686,14 @@ function P(s, t = !1) {
 }
 const te = (s) => {
   let t = s.substring(0, 2), e = Number(s.substring(2, 3));
-  return e == 4 ? (e = 1, t = It(t)) : e++, `${t}${e}`;
-}, Do = (s) => te(te(te(s))), It = (s) => {
+  return e == 4 ? (e = 1, t = Tt(t)) : e++, `${t}${e}`;
+}, Bo = (s) => te(te(te(s))), Tt = (s) => {
   let t = Number(s.toString()[0]);
-  return t = t % 4 + 1, `${t}${f.Z}`;
-}, We = (s) => {
+  return t = t % 4 + 1, `${t}${p.Z}`;
+}, De = (s) => {
   let t = Number(s.toString()[0]);
   const e = [1, 4, 3, 2], n = e.indexOf(t);
-  return `${e[(n + 1) % e.length]}${f.Z}`;
+  return `${e[(n + 1) % e.length]}${p.Z}`;
 }, nn = (s, t, e) => {
   const n = Math.abs(Number(s[0]) - Number(t[0]));
   return b(n == 1 || n == 2 || n == 3), e == w.PON ? n == 3 ? 0 : n == 2 ? 1 : 2 : n == 3 ? 0 : n == 1 ? 3 : 2;
@@ -700,7 +701,7 @@ const te = (s) => {
 function sn(s) {
   return typeof s > "u";
 }
-function Ne(s, t = 0) {
+function Ie(s, t = 0) {
   return {
     a: 1,
     c: 0,
@@ -747,9 +748,9 @@ function Cs(s, t, e) {
     f: 0
   };
   return sn(t) || sn(e) ? r : Ke([
-    Ne(t, e),
+    Ie(t, e),
     r,
-    Ne(-t, -e)
+    Ie(-t, -e)
   ]);
 }
 function Rs(s, t = void 0, e = void 0) {
@@ -779,16 +780,16 @@ const pe = function(s) {
   const t = Ps.exec(s);
   return !(t === null || typeof t > "u");
 };
-function Ds(s) {
+function Bs(s) {
   return typeof s < "u";
 }
-const Bs = {
+const Ws = {
   allowBooleanAttributes: !1,
   //A tag can have attributes without any value
   unpairedTags: []
 };
-function Ws(s, t) {
-  t = Object.assign({}, Bs, t);
+function Ds(s, t) {
+  t = Object.assign({}, Ws, t);
   const e = [];
   let n = !1, i = !1;
   s[0] === "\uFEFF" && (s = s.substr(1));
@@ -809,11 +810,11 @@ function Ws(s, t) {
           c += s[r];
         if (c = c.trim(), c[c.length - 1] === "/" && (c = c.substring(0, c.length - 1), r--), !Gs(c)) {
           let h;
-          return c.trim().length === 0 ? h = "Invalid space after '<'." : h = "Tag '" + c + "' is an invalid name.", S("InvalidTag", h, M(s, r));
+          return c.trim().length === 0 ? h = "Invalid space after '<'." : h = "Tag '" + c + "' is an invalid name.", S("InvalidTag", h, $(s, r));
         }
         const l = zs(s, r);
         if (l === !1)
-          return S("InvalidAttr", "Attributes for '" + c + "' have open quote.", M(s, r));
+          return S("InvalidAttr", "Attributes for '" + c + "' have open quote.", $(s, r));
         let u = l.value;
         if (r = l.index, u[u.length - 1] === "/") {
           const h = r - u.length;
@@ -822,32 +823,32 @@ function Ws(s, t) {
           if (d === !0)
             n = !0;
           else
-            return S(d.err.code, d.err.msg, M(s, h + d.err.line));
+            return S(d.err.code, d.err.msg, $(s, h + d.err.line));
         } else if (a)
           if (l.tagClosed) {
             if (u.trim().length > 0)
-              return S("InvalidTag", "Closing tag '" + c + "' can't have attributes or invalid starting.", M(s, o));
+              return S("InvalidTag", "Closing tag '" + c + "' can't have attributes or invalid starting.", $(s, o));
             if (e.length === 0)
-              return S("InvalidTag", "Closing tag '" + c + "' has not been opened.", M(s, o));
+              return S("InvalidTag", "Closing tag '" + c + "' has not been opened.", $(s, o));
             {
               const h = e.pop();
               if (c !== h.tagName) {
-                let d = M(s, h.tagStartPos);
+                let d = $(s, h.tagStartPos);
                 return S(
                   "InvalidTag",
                   "Expected closing tag '" + h.tagName + "' (opened in line " + d.line + ", col " + d.col + ") instead of closing tag '" + c + "'.",
-                  M(s, o)
+                  $(s, o)
                 );
               }
               e.length == 0 && (i = !0);
             }
-          } else return S("InvalidTag", "Closing tag '" + c + "' doesn't have proper closing.", M(s, r));
+          } else return S("InvalidTag", "Closing tag '" + c + "' doesn't have proper closing.", $(s, r));
         else {
           const h = cn(u, t);
           if (h !== !0)
-            return S(h.err.code, h.err.msg, M(s, r - u.length + h.err.line));
+            return S(h.err.code, h.err.msg, $(s, r - u.length + h.err.line));
           if (i === !0)
-            return S("InvalidXml", "Multiple possible root nodes found.", M(s, r));
+            return S("InvalidXml", "Multiple possible root nodes found.", $(s, r));
           t.unpairedTags.indexOf(c) !== -1 || e.push({ tagName: c, tagStartPos: o }), n = !0;
         }
         for (r++; r < s.length; r++)
@@ -862,20 +863,20 @@ function Ws(s, t) {
           else if (s[r] === "&") {
             const h = Fs(s, r);
             if (h == -1)
-              return S("InvalidChar", "char '&' is not expected.", M(s, r));
+              return S("InvalidChar", "char '&' is not expected.", $(s, r));
             r = h;
           } else if (i === !0 && !rn(s[r]))
-            return S("InvalidXml", "Extra text at the end", M(s, r));
+            return S("InvalidXml", "Extra text at the end", $(s, r));
         s[r] === "<" && r--;
       }
     } else {
       if (rn(s[r]))
         continue;
-      return S("InvalidChar", "char '" + s[r] + "' is not expected.", M(s, r));
+      return S("InvalidChar", "char '" + s[r] + "' is not expected.", $(s, r));
     }
   if (n) {
     if (e.length == 1)
-      return S("InvalidTag", "Unclosed tag '" + e[0].tagName + "'.", M(s, e[0].tagStartPos));
+      return S("InvalidTag", "Unclosed tag '" + e[0].tagName + "'.", $(s, e[0].tagStartPos));
     if (e.length > 0)
       return S("InvalidXml", "Invalid '" + JSON.stringify(e.map((r) => r.tagName), null, 4).replace(/\r?\n/g, "") + "' found.", { line: 1, col: 1 });
   } else return S("InvalidXml", "Start tag expected.", 1);
@@ -891,7 +892,7 @@ function on(s, t) {
     if (s[t] == "?" || s[t] == " ") {
       const n = s.substr(e, t - e);
       if (t > 5 && n === "xml")
-        return S("InvalidXml", "XML declaration allowed only at the start of the document.", M(s, t));
+        return S("InvalidXml", "XML declaration allowed only at the start of the document.", $(s, t));
       if (s[t] == "?" && s[t + 1] == ">") {
         t++;
         break;
@@ -946,18 +947,18 @@ function cn(s, t) {
   const e = Cn(s, Us), n = {};
   for (let i = 0; i < e.length; i++) {
     if (e[i][1].length === 0)
-      return S("InvalidAttr", "Attribute '" + e[i][2] + "' has no space in starting.", Dt(e[i]));
+      return S("InvalidAttr", "Attribute '" + e[i][2] + "' has no space in starting.", Bt(e[i]));
     if (e[i][3] !== void 0 && e[i][4] === void 0)
-      return S("InvalidAttr", "Attribute '" + e[i][2] + "' is without value.", Dt(e[i]));
+      return S("InvalidAttr", "Attribute '" + e[i][2] + "' is without value.", Bt(e[i]));
     if (e[i][3] === void 0 && !t.allowBooleanAttributes)
-      return S("InvalidAttr", "boolean attribute '" + e[i][2] + "' is not allowed.", Dt(e[i]));
+      return S("InvalidAttr", "boolean attribute '" + e[i][2] + "' is not allowed.", Bt(e[i]));
     const r = e[i][2];
-    if (!Zs(r))
-      return S("InvalidAttr", "Attribute '" + r + "' is an invalid name.", Dt(e[i]));
+    if (!Ys(r))
+      return S("InvalidAttr", "Attribute '" + r + "' is an invalid name.", Bt(e[i]));
     if (!n.hasOwnProperty(r))
       n[r] = 1;
     else
-      return S("InvalidAttr", "Attribute '" + r + "' is repeated.", Dt(e[i]));
+      return S("InvalidAttr", "Attribute '" + r + "' is repeated.", Bt(e[i]));
   }
   return !0;
 }
@@ -995,13 +996,13 @@ function S(s, t, e) {
     }
   };
 }
-function Zs(s) {
+function Ys(s) {
   return pe(s);
 }
 function Gs(s) {
   return pe(s);
 }
-function M(s, t) {
+function $(s, t) {
   const e = s.substring(0, t).split(/\r?\n/);
   return {
     line: e.length,
@@ -1009,10 +1010,10 @@ function M(s, t) {
     col: e[e.length - 1].length + 1
   };
 }
-function Dt(s) {
+function Bt(s) {
   return s.startIndex + s[1].length;
 }
-const Ys = {
+const Zs = {
   preserveOrder: !1,
   attributeNamePrefix: "@_",
   attributesGroupName: !1,
@@ -1057,7 +1058,7 @@ const Ys = {
   // skipEmptyListItem: false
   captureMetaData: !1
 }, Vs = function(s) {
-  return Object.assign({}, Ys, s);
+  return Object.assign({}, Zs, s);
 };
 let se;
 typeof Symbol != "function" ? se = "@@xmlMetadata" : se = Symbol("XML Node Metadata");
@@ -1118,11 +1119,11 @@ class Js {
     return { entities: n, i: e };
   }
   readEntityExp(t, e) {
-    e = $(t, e);
+    e = H(t, e);
     let n = "";
     for (; e < t.length && !/\s/.test(t[e]) && t[e] !== '"' && t[e] !== "'"; )
       n += t[e], e++;
-    if (Bt(n), e = $(t, e), !this.suppressValidationErr) {
+    if (Wt(n), e = H(t, e), !this.suppressValidationErr) {
       if (t.substring(e, e + 6).toUpperCase() === "SYSTEM")
         throw new Error("External entities are not supported");
       if (t[e] === "%")
@@ -1132,18 +1133,18 @@ class Js {
     return [e, i] = this.readIdentifierVal(t, e, "entity"), e--, [n, i, e];
   }
   readNotationExp(t, e) {
-    e = $(t, e);
+    e = H(t, e);
     let n = "";
     for (; e < t.length && !/\s/.test(t[e]); )
       n += t[e], e++;
-    !this.suppressValidationErr && Bt(n), e = $(t, e);
+    !this.suppressValidationErr && Wt(n), e = H(t, e);
     const i = t.substring(e, e + 6).toUpperCase();
     if (!this.suppressValidationErr && i !== "SYSTEM" && i !== "PUBLIC")
       throw new Error(`Expected SYSTEM or PUBLIC, found "${i}"`);
-    e += i.length, e = $(t, e);
+    e += i.length, e = H(t, e);
     let r = null, o = null;
     if (i === "PUBLIC")
-      [e, r] = this.readIdentifierVal(t, e, "publicIdentifier"), e = $(t, e), (t[e] === '"' || t[e] === "'") && ([e, o] = this.readIdentifierVal(t, e, "systemIdentifier"));
+      [e, r] = this.readIdentifierVal(t, e, "publicIdentifier"), e = H(t, e), (t[e] === '"' || t[e] === "'") && ([e, o] = this.readIdentifierVal(t, e, "systemIdentifier"));
     else if (i === "SYSTEM" && ([e, o] = this.readIdentifierVal(t, e, "systemIdentifier"), !this.suppressValidationErr && !o))
       throw new Error("Missing mandatory system identifier for SYSTEM notation");
     return { notationName: n, publicIdentifier: r, systemIdentifier: o, index: --e };
@@ -1160,13 +1161,13 @@ class Js {
     return e++, [e, i];
   }
   readElementExp(t, e) {
-    e = $(t, e);
+    e = H(t, e);
     let n = "";
     for (; e < t.length && !/\s/.test(t[e]); )
       n += t[e], e++;
     if (!this.suppressValidationErr && !pe(n))
       throw new Error(`Invalid element name: "${n}"`);
-    e = $(t, e);
+    e = H(t, e);
     let i = "";
     if (t[e] === "E" && rt(t, "MPTY", e)) e += 4;
     else if (t[e] === "A" && rt(t, "NY", e)) e += 2;
@@ -1184,20 +1185,20 @@ class Js {
     };
   }
   readAttlistExp(t, e) {
-    e = $(t, e);
+    e = H(t, e);
     let n = "";
     for (; e < t.length && !/\s/.test(t[e]); )
       n += t[e], e++;
-    Bt(n), e = $(t, e);
+    Wt(n), e = H(t, e);
     let i = "";
     for (; e < t.length && !/\s/.test(t[e]); )
       i += t[e], e++;
-    if (!Bt(i))
+    if (!Wt(i))
       throw new Error(`Invalid attribute name: "${i}"`);
-    e = $(t, e);
+    e = H(t, e);
     let r = "";
     if (t.substring(e, e + 8).toUpperCase() === "NOTATION") {
-      if (r = "NOTATION", e += 8, e = $(t, e), t[e] !== "(")
+      if (r = "NOTATION", e += 8, e = H(t, e), t[e] !== "(")
         throw new Error(`Expected '(', found "${t[e]}"`);
       e++;
       let a = [];
@@ -1205,9 +1206,9 @@ class Js {
         let c = "";
         for (; e < t.length && t[e] !== "|" && t[e] !== ")"; )
           c += t[e], e++;
-        if (c = c.trim(), !Bt(c))
+        if (c = c.trim(), !Wt(c))
           throw new Error(`Invalid notation name: "${c}"`);
-        a.push(c), t[e] === "|" && (e++, e = $(t, e));
+        a.push(c), t[e] === "|" && (e++, e = H(t, e));
       }
       if (t[e] !== ")")
         throw new Error("Unterminated list of notations");
@@ -1219,7 +1220,7 @@ class Js {
       if (!this.suppressValidationErr && !a.includes(r.toUpperCase()))
         throw new Error(`Invalid attribute type: "${r}"`);
     }
-    e = $(t, e);
+    e = H(t, e);
     let o = "";
     return t.substring(e, e + 8).toUpperCase() === "#REQUIRED" ? (o = "#REQUIRED", e += 8) : t.substring(e, e + 7).toUpperCase() === "#IMPLIED" ? (o = "#IMPLIED", e += 7) : [e, o] = this.readIdentifierVal(t, e, "ATTLIST"), {
       elementName: n,
@@ -1230,7 +1231,7 @@ class Js {
     };
   }
 }
-const $ = (s, t) => {
+const H = (s, t) => {
   for (; t < s.length && /\s/.test(s[t]); )
     t++;
   return t;
@@ -1240,7 +1241,7 @@ function rt(s, t, e) {
     if (t[n] !== s[e + n + 1]) return !1;
   return !0;
 }
-function Bt(s) {
+function Wt(s) {
   if (pe(s))
     return s;
   throw new Error(`Invalid entity name ${s}`);
@@ -1357,7 +1358,7 @@ function ai(s, t, e, n, i, r, o) {
   if (s !== void 0 && (this.options.trimValues && !n && (s = s.trim()), s.length > 0)) {
     o || (s = this.replaceEntitiesValue(s));
     const a = this.options.tagValueProcessor(t, s, e, i, r);
-    return a == null ? s : typeof a != typeof s || a !== s ? a : this.options.trimValues ? Ie(s, this.options.parseTagValue, this.options.numberParseOptions) : s.trim() === s ? Ie(s, this.options.parseTagValue, this.options.numberParseOptions) : s;
+    return a == null ? s : typeof a != typeof s || a !== s ? a : this.options.trimValues ? Te(s, this.options.parseTagValue, this.options.numberParseOptions) : s.trim() === s ? Te(s, this.options.parseTagValue, this.options.numberParseOptions) : s;
   }
 }
 function ci(s) {
@@ -1382,7 +1383,7 @@ function hi(s, t, e) {
         if (this.options.transformAttributeName && (l = this.options.transformAttributeName(l)), l === "__proto__" && (l = "#__proto__"), c !== void 0) {
           this.options.trimValues && (c = c.trim()), c = this.replaceEntitiesValue(c);
           const u = this.options.attributeValueProcessor(a, c, t);
-          u == null ? r[l] = c : typeof u != typeof c || u !== c ? r[l] = u : r[l] = Ie(
+          u == null ? r[l] = c : typeof u != typeof c || u !== c ? r[l] = u : r[l] = Te(
             c,
             this.options.parseAttributeValue,
             this.options.numberParseOptions
@@ -1420,7 +1421,7 @@ const ui = function(s) {
         let h = 0;
         u && this.options.unpairedTags.indexOf(u) !== -1 ? (h = i.lastIndexOf(".", i.lastIndexOf(".") - 1), this.tagsNodeStack.pop()) : h = i.lastIndexOf("."), i = i.substring(0, h), e = this.tagsNodeStack.pop(), n = "", o = c;
       } else if (s[o + 1] === "?") {
-        let c = Te(s, o, !1, "?>");
+        let c = Ne(s, o, !1, "?>");
         if (!c) throw new Error("Pi Tag is not closed.");
         if (n = this.saveTextToParentTag(n, e, i), !(this.options.ignoreDeclaration && c.tagName === "?xml" || this.options.ignorePiTags)) {
           const l = new lt(c.tagName);
@@ -1443,12 +1444,12 @@ const ui = function(s) {
         let u = this.parseTextData(l, e.tagname, i, !0, !1, !0, !0);
         u == null && (u = ""), this.options.cdataPropName ? e.add(this.options.cdataPropName, [{ [this.options.textNodeName]: l }]) : e.add(this.options.textNodeName, u), o = c + 2;
       } else {
-        let c = Te(s, o, this.options.removeNSPrefix), l = c.tagName;
+        let c = Ne(s, o, this.options.removeNSPrefix), l = c.tagName;
         const u = c.rawTagName;
         let h = c.tagExp, d = c.attrExpPresent, g = c.closeIndex;
         this.options.transformTagName && (l = this.options.transformTagName(l)), e && n && e.tagname !== "!xml" && (n = this.saveTextToParentTag(n, e, i, !1));
-        const p = e;
-        p && this.options.unpairedTags.indexOf(p.tagname) !== -1 && (e = this.tagsNodeStack.pop(), i = i.substring(0, i.lastIndexOf("."))), l !== t.tagname && (i += i ? "." + l : l);
+        const f = e;
+        f && this.options.unpairedTags.indexOf(f.tagname) !== -1 && (e = this.tagsNodeStack.pop(), i = i.substring(0, i.lastIndexOf("."))), l !== t.tagname && (i += i ? "." + l : l);
         const E = o;
         if (this.isItStopNode(this.options.stopNodes, i, l)) {
           let A = "";
@@ -1461,8 +1462,8 @@ const ui = function(s) {
             if (!v) throw new Error(`Unexpected end of ${u}`);
             o = v.i, A = v.tagContent;
           }
-          const N = new lt(l);
-          l !== h && d && (N[":@"] = this.buildAttributesMap(h, i, l)), A && (A = this.parseTextData(A, l, i, !0, d, !0, !0)), i = i.substr(0, i.lastIndexOf(".")), N.add(this.options.textNodeName, A), this.addChild(e, N, i, E);
+          const I = new lt(l);
+          l !== h && d && (I[":@"] = this.buildAttributesMap(h, i, l)), A && (A = this.parseTextData(A, l, i, !0, d, !0, !0)), i = i.substr(0, i.lastIndexOf(".")), I.add(this.options.textNodeName, A), this.addChild(e, I, i, E);
         } else {
           if (h.length > 0 && h.lastIndexOf("/") === h.length - 1) {
             l[l.length - 1] === "/" ? (l = l.substr(0, l.length - 1), i = i.substr(0, i.length - 1), h = l) : h = h.substr(0, h.length - 1), this.options.transformTagName && (l = this.options.transformTagName(l));
@@ -1551,7 +1552,7 @@ function ft(s, t, e, n) {
     throw new Error(n);
   return i + t.length - 1;
 }
-function Te(s, t, e, n = ">") {
+function Ne(s, t, e, n = ">") {
   const i = mi(s, t + 1, n);
   if (!i) return;
   let r = i.data;
@@ -1591,16 +1592,16 @@ function yi(s, t, e) {
       else if (s.substr(e + 1, 2) === "![")
         e = ft(s, "]]>", e, "StopNode is not closed.") - 2;
       else {
-        const r = Te(s, e, ">");
+        const r = Ne(s, e, ">");
         r && ((r && r.tagName) === t && r.tagExp[r.tagExp.length - 1] !== "/" && i++, e = r.closeIndex);
       }
 }
-function Ie(s, t, e) {
+function Te(s, t, e) {
   if (t && typeof s == "string") {
     const n = s.trim();
     return n === "true" ? !0 : n === "false" ? !1 : ti(s, e);
   } else
-    return Ds(s) ? s : "";
+    return Bs(s) ? s : "";
 }
 const we = lt.getMetaDataSymbol();
 function wi(s, t) {
@@ -1662,7 +1663,7 @@ class bi {
       throw new Error("XML data is accepted in String or Bytes[] form.");
     if (e) {
       e === !0 && (e = {});
-      const r = Ws(t, e);
+      const r = Ds(t, e);
       if (r !== !0)
         throw Error(`${r.err.msg}:${r.err.line}:${r.err.col}`);
     }
@@ -1699,21 +1700,21 @@ class bi {
     return lt.getMetaDataSymbol();
   }
 }
-const Ni = `
+const Ii = `
 `;
-function Ti(s, t) {
+function Ni(s, t) {
   let e = "";
-  return t.format && t.indentBy.length > 0 && (e = Ni), xn(s, t, "", e);
+  return t.format && t.indentBy.length > 0 && (e = Ii), xn(s, t, "", e);
 }
 function xn(s, t, e, n) {
   let i = "", r = !1;
   for (let o = 0; o < s.length; o++) {
-    const a = s[o], c = Ii(a);
+    const a = s[o], c = Ti(a);
     if (c === void 0) continue;
     let l = "";
     if (e.length === 0 ? l = c : l = `${e}.${c}`, c === t.textNodeName) {
-      let p = a[c];
-      vi(l, t) || (p = t.tagValueProcessor(c, p), p = $n(p, t)), r && (i += n), i += p, r = !1;
+      let f = a[c];
+      vi(l, t) || (f = t.tagValueProcessor(c, f), f = $n(f, t)), r && (i += n), i += f, r = !1;
       continue;
     } else if (c === t.cdataPropName) {
       r && (i += n), i += `<![CDATA[${a[c][0][t.textNodeName]}]]>`, r = !1;
@@ -1722,9 +1723,9 @@ function xn(s, t, e, n) {
       i += n + `<!--${a[c][0][t.textNodeName]}-->`, r = !0;
       continue;
     } else if (c[0] === "?") {
-      const p = ln(a[":@"], t), E = c === "?xml" ? "" : n;
+      const f = ln(a[":@"], t), E = c === "?xml" ? "" : n;
       let A = a[c][0][t.textNodeName];
-      A = A.length !== 0 ? " " + A : "", i += E + `<${c}${A}${p}?>`, r = !0;
+      A = A.length !== 0 ? " " + A : "", i += E + `<${c}${A}${f}?>`, r = !0;
       continue;
     }
     let u = n;
@@ -1734,7 +1735,7 @@ function xn(s, t, e, n) {
   }
   return i;
 }
-function Ii(s) {
+function Ti(s) {
   const t = Object.keys(s);
   for (let e = 0; e < t.length; e++) {
     const n = t[e];
@@ -1811,7 +1812,7 @@ function st(s) {
   }, this.tagEndChar = ">", this.newLine = "");
 }
 st.prototype.build = function(s) {
-  return this.options.preserveOrder ? Ti(s, this.options) : (Array.isArray(s) && this.options.arrayNodeName && this.options.arrayNodeName.length > 1 && (s = {
+  return this.options.preserveOrder ? Ni(s, this.options) : (Array.isArray(s) && this.options.arrayNodeName && this.options.arrayNodeName.length > 1 && (s = {
     [this.options.arrayNodeName]: s
   }), this.j2x(s, 0, []).val);
 };
@@ -1938,8 +1939,8 @@ class wt {
   left(...t) {
     return `<${[
       this.type,
-      Bn(this.attrs),
-      Di(this.styles),
+      Wn(this.attrs),
+      Bi(this.styles),
       ...t
     ].filter((e) => e != "").join(" ")}>`;
   }
@@ -2015,7 +2016,7 @@ class vt extends wt {
     return this._text;
   }
 }
-let Dn = class extends wt {
+let Bn = class extends wt {
   raw;
   constructor(t) {
     super("symbol"), this.raw = t;
@@ -2027,7 +2028,7 @@ let Dn = class extends wt {
     return this.raw;
   }
 };
-class T extends wt {
+class N extends wt {
   children = [];
   rotateMatrix;
   translateMatrix;
@@ -2041,7 +2042,7 @@ class T extends wt {
     return this.rotateMatrix = Rs(t, e, n), this;
   }
   translate(t, e) {
-    return this.translateMatrix = Ne(t, e), this;
+    return this.translateMatrix = Ie(t, e), this;
   }
   center() {
     return this.children.map((t) => t.toString()).join("");
@@ -2055,7 +2056,7 @@ class T extends wt {
   each(t, e) {
     for (let n = 0; n < this.children.length; n++) {
       const i = this.children[n];
-      i instanceof T && e && i.each(t, !0), t(n, this.children);
+      i instanceof N && e && i.each(t, !0), t(n, this.children);
     }
   }
 }
@@ -2080,7 +2081,7 @@ class Mi extends wt {
     return `<${[
       this.type,
       ...Ri,
-      Bn(this.attrs),
+      Wn(this.attrs),
       Hi(this.viewBox)
     ].filter((e) => e != "").join(" ")}>`;
   }
@@ -2088,7 +2089,7 @@ class Mi extends wt {
     return this.viewBox = { x: t, y: e, width: n, height: i }, this;
   }
   importSymbol(t) {
-    for (const e of Bi(t))
+    for (const e of Wi(t))
       this.add(e);
     return this;
   }
@@ -2107,14 +2108,14 @@ class Mi extends wt {
   each(t, e) {
     for (let n = 0; n < this.children.length; n++) {
       const i = this.children[n];
-      i instanceof T && e && i.each(t, !0), t(n, this.children);
+      i instanceof N && e && i.each(t, !0), t(n, this.children);
     }
   }
 }
 function xi() {
   return new Mi();
 }
-const Wo = xi, Ko = T, Lo = Hn, zo = Le, Uo = Pn, jo = vt;
+const Do = xi, Ko = N, Lo = Hn, zo = Le, Uo = Pn, jo = vt;
 function $i(s) {
   return s.replace(/[A-Z]/g, (t) => "-" + t.toLowerCase());
 }
@@ -2124,34 +2125,34 @@ function Hi(s) {
 function Pi(s) {
   return s == null ? "" : `transform="${Ms(s)}"`;
 }
-function Bn(s) {
+function Wn(s) {
   return Object.entries(s).filter(([t, e]) => e !== void 0).map(([t, e]) => `${$i(t)}="${e}"`).join(" ");
 }
-function Di(s) {
+function Bi(s) {
   const t = Object.entries(s).map(([e, n]) => `${e}: ${n};`).join(" ");
   return t != "" ? `style="${t}"` : "";
 }
-function* Bi(s) {
+function* Wi(s) {
   const t = new bi({ ignoreAttributes: !1 }), e = new st({
     ignoreAttributes: !1
   }), n = t.parse(s);
   for (const i of n.svg.symbol) {
-    const r = e.build(i), o = new Dn(r);
+    const r = e.build(i), o = new Bn(r);
     for (const [a, c] of Object.entries(i))
       a.startsWith("@_") && (o.attrs[a.substring(2)] = c);
     yield o;
   }
 }
-const j = (s, t) => {
-  const e = B(s.tiles[0], t), n = e.baseHeight, i = e.baseWidth;
+const Y = (s, t) => {
+  const e = D(s.tiles[0], t), n = e.baseHeight, i = e.baseWidth;
   if (s.is(w.SHO_KAN))
     return { width: i * 2 + n, height: Math.max(i * 2, n) };
   const r = s.tiles.reduce((a, c) => {
-    const l = B(c, t).height;
+    const l = D(c, t).height;
     return l > a ? l : a;
   }, 0);
-  return { width: s.tiles.reduce((a, c) => a + B(c, t).width, 0), height: r };
-}, B = (s, t) => {
+  return { width: s.tiles.reduce((a, c) => a + D(c, t).width, 0), height: r };
+}, D = (s, t) => {
   const e = parseFloat((gt.HEIGHT * t).toPrecision(5)), n = parseFloat((gt.WIDTH * t).toPrecision(5)), i = s.has(m.HORIZONTAL) ? { width: e, height: n, baseWidth: n, baseHeight: e } : { width: n, height: e, w: n, baseWidth: n, baseHeight: e };
   return (s.has(m.TSUMO) || s.has(m.DORA)) && (i.width += n * gt.TEXT_SCALE), i;
 };
@@ -2167,7 +2168,7 @@ class Ot {
   }
   // 横向き牌を縦向き牌と水平に揃えるためのY座標オフセットを計算
   getHorizontalTileYOffset(t) {
-    const e = B(t, this.scale);
+    const e = D(t, this.scale);
     return (e.baseHeight - e.baseWidth) / 2;
   }
   // image wrapper
@@ -2176,20 +2177,20 @@ class Ot {
     return this.svgSprite && (e = new Le().use(Ot.buildID(t))), t instanceof y && t.has(m.COLOR_GRAYSCALE) && e.css({ filter: "contrast(65%)" }), e;
   }
   createImage(t, e, n) {
-    const i = B(t, this.scale);
+    const i = D(t, this.scale);
     return this.image(t).dx(e).dy(n).size(i.baseWidth, i.baseHeight);
   }
   createTextImage(t, e, n, i) {
-    const r = this.createImage(t, e, n), o = B(t, this.scale), a = o.baseHeight * 0.2, c = o.baseWidth, l = o.baseHeight, u = new vt().plain(i);
+    const r = this.createImage(t, e, n), o = D(t, this.scale), a = o.baseHeight * 0.2, c = o.baseWidth, l = o.baseHeight, u = new vt().plain(i);
     u.size(o.baseWidth, o.baseHeight).font({
-      family: Tn,
+      family: Nn,
       size: a
     }).dx(c).dy(l);
-    const h = new T();
+    const h = new N();
     return h.add(r).add(u).translate(e, n), h;
   }
   createRotate90Image(t, e, n, i = !1) {
-    const r = this.createImage(t, 0, 0), o = B(t, this.scale), a = o.baseWidth / 2, c = o.baseHeight / 2, l = e + this.getHorizontalTileYOffset(t), u = i ? n - this.getHorizontalTileYOffset(t) : n, h = new T();
+    const r = this.createImage(t, 0, 0), o = D(t, this.scale), a = o.baseWidth / 2, c = o.baseHeight / 2, l = e + this.getHorizontalTileYOffset(t), u = i ? n - this.getHorizontalTileYOffset(t) : n, h = new N();
     return h.add(r).translate(l, u).rotate(90, a, c), h;
   }
   createStick(t) {
@@ -2198,7 +2199,7 @@ class Ot {
   static buildID(t) {
     if (t == 100 || t == 1e3)
       return t == 100 ? "stick100" : "stick1000";
-    const e = t.t == f.BACK || t.has(m.RED) ? 0 : t.n;
+    const e = t.t == p.BACK || t.has(m.RED) ? 0 : t.n;
     return `${t.t}${e}`;
   }
   buildURL(t) {
@@ -2206,13 +2207,13 @@ class Ot {
     return this.imageHostUrl != "" ? `${this.imageHostUrl}${e}` : e;
   }
 }
-class Wn extends Ot {
+class Dn extends Ot {
   blockMargin = gt.WIDTH * gt.BLOCK_MARGIN_SCALE * this.scale;
   createBlockHandDiscard(t) {
-    const e = t instanceof x ? t.tilesWithBack : t.tiles, n = new T();
+    const e = t instanceof C ? t.tilesWithBack : t.tiles, n = new N();
     let i = 0;
     for (const r of e) {
-      const o = B(r, this.scale), a = r.has(m.HORIZONTAL) ? this.createRotate90Image.bind(this) : this.createImage.bind(this), c = r.has(m.HORIZONTAL) ? this.getHorizontalTileYOffset(r) : 0, l = a(r, i, c);
+      const o = D(r, this.scale), a = r.has(m.HORIZONTAL) ? this.createRotate90Image.bind(this) : this.createImage.bind(this), c = r.has(m.HORIZONTAL) ? this.getHorizontalTileYOffset(r) : 0, l = a(r, i, c);
       n.add(l), i += o.width;
     }
     return n;
@@ -2220,22 +2221,22 @@ class Wn extends Ot {
   createBlockPonChiKan(t) {
     const e = t.tiles.findIndex((r) => r.has(m.HORIZONTAL));
     let n = 0;
-    const i = new T();
+    const i = new N();
     if (t.type == w.SHO_KAN) {
       let r = e;
       for (let o = 0; o < t.tiles.length; o++)
         t.tiles[o].has(m.HORIZONTAL) && (r = o);
       for (let o = 0; o < t.tiles.length; o++) {
-        const a = B(t.tiles[o], this.scale);
+        const a = D(t.tiles[o], this.scale);
         if (o == r) continue;
         if (o == e) {
-          const u = t.tiles[e], h = t.tiles[r], d = B(u, this.scale), g = this.createRotate90Image(u, 0, 0, !0), p = this.createRotate90Image(
+          const u = t.tiles[e], h = t.tiles[r], d = D(u, this.scale), g = this.createRotate90Image(u, 0, 0, !0), f = this.createRotate90Image(
             h,
             0,
             d.height,
             !0
           );
-          i.add(new T().translate(n, 0).add(g).add(p)), n += d.width;
+          i.add(new N().translate(n, 0).add(g).add(f)), n += d.width;
           continue;
         }
         const c = a.width * 2 - a.height, l = this.createImage(t.tiles[o], n, c);
@@ -2249,64 +2250,64 @@ class Wn extends Ot {
         n,
         this.getHorizontalTileYOffset(r)
       );
-      n += B(r, this.scale).width, i.add(o);
+      n += D(r, this.scale).width, i.add(o);
       for (let a = 0; a < t.tiles.length; a++) {
         if (a == e) continue;
-        const c = t.tiles[a], l = B(c, this.scale), u = this.createImage(c, n, 0);
+        const c = t.tiles[a], l = D(c, this.scale), u = this.createImage(c, n, 0);
         n += l.width, i.add(u);
       }
       return i;
     }
     for (let r = 0; r < t.tiles.length; r++) {
-      const o = r == e ? this.createRotate90Image.bind(this) : this.createImage.bind(this), a = t.tiles[r], c = r == e ? this.getHorizontalTileYOffset(a) : 0, l = B(a, this.scale), u = o(a, n, c);
+      const o = r == e ? this.createRotate90Image.bind(this) : this.createImage.bind(this), a = t.tiles[r], c = r == e ? this.getHorizontalTileYOffset(a) : 0, l = D(a, this.scale), u = o(a, n, c);
       n += l.width, i.add(u);
     }
     return i;
   }
 }
-const Wi = (s, t) => {
+const Di = (s, t) => {
   const e = s.scale;
   return {
     [w.CHI]: function(i) {
-      const r = j(i, e), o = s.createBlockPonChiKan(i);
+      const r = Y(i, e), o = s.createBlockPonChiKan(i);
       return { ...r, e: o };
     },
     [w.PON]: function(i) {
-      const r = j(i, e), o = s.createBlockPonChiKan(i);
+      const r = Y(i, e), o = s.createBlockPonChiKan(i);
       return { ...r, e: o };
     },
     [w.DAI_KAN]: function(i) {
-      const r = j(i, e), o = s.createBlockPonChiKan(i);
+      const r = Y(i, e), o = s.createBlockPonChiKan(i);
       return { ...r, e: o };
     },
     [w.SHO_KAN]: function(i) {
-      const r = j(i, e), o = s.createBlockPonChiKan(i);
+      const r = Y(i, e), o = s.createBlockPonChiKan(i);
       return { ...r, e: o };
     },
     [w.AN_KAN]: function(i) {
       b(
-        i instanceof x,
+        i instanceof C,
         `block type is not ankan: ${i.type}`
       );
-      const r = j(i, e), o = s.createBlockHandDiscard(i);
+      const r = Y(i, e), o = s.createBlockHandDiscard(i);
       return { ...r, e: o };
     },
     [w.IMAGE_DORA]: function(i) {
       i = t?.doraText == !1 ? new Ut([i.tiles[0].clone({ remove: m.DORA })]) : i;
-      const r = j(i, e), o = new T(), a = t?.doraText === !1 ? s.createImage(i.tiles[0], 0, 0) : s.createTextImage(i.tiles[0], 0, 0, "(ドラ)");
+      const r = Y(i, e), o = new N(), a = t?.doraText === !1 ? s.createImage(i.tiles[0], 0, 0) : s.createTextImage(i.tiles[0], 0, 0, "(ドラ)");
       return o.add(a), { ...r, e: o };
     },
     [w.TSUMO]: function(i) {
       i = t?.tsumoText == !1 ? new Ut([i.tiles[0].clone({ remove: m.TSUMO })]) : i;
-      const r = j(i, e), o = new T(), a = t?.tsumoText === !1 ? s.createImage(i.tiles[0], 0, 0) : s.createTextImage(i.tiles[0], 0, 0, "(ツモ)");
+      const r = Y(i, e), o = new N(), a = t?.tsumoText === !1 ? s.createImage(i.tiles[0], 0, 0) : s.createTextImage(i.tiles[0], 0, 0, "(ツモ)");
       return o.add(a), { ...r, e: o };
     },
     [w.HAND]: function(i) {
-      const r = j(i, e), o = s.createBlockHandDiscard(i);
+      const r = Y(i, e), o = s.createBlockHandDiscard(i);
       return { ...r, e: o };
     },
     [w.IMAGE_DISCARD]: function(i) {
-      const r = j(i, e), o = s.createBlockHandDiscard(i);
+      const r = Y(i, e), o = s.createBlockHandDiscard(i);
       return { ...r, e: o };
     },
     [w.THREE]: function(i) {
@@ -2324,22 +2325,22 @@ const Wi = (s, t) => {
     [w.UNKNOWN]: function(i) {
       if (i.tiles.some((a) => a.has(m.TSUMO) || a.has(m.DORA)))
         throw new Error("found an unknown block with operator tiles");
-      const r = j(i, e), o = s.createBlockHandDiscard(i);
+      const r = Y(i, e), o = s.createBlockHandDiscard(i);
       return { ...r, e: o };
     }
   };
 }, Kt = (s, t, e) => {
-  const n = Wi(s, e);
+  const n = Di(s, e);
   let i = 0, r = 0;
   const o = [];
   for (const h of t) {
     const d = n[h.type], g = d(h);
     r += g.width, i = g.height > i ? g.height : i, o.push(g);
   }
-  const a = i, c = r + (t.length - 1) * s.blockMargin, l = new T();
+  const a = i, c = r + (t.length - 1) * s.blockMargin, l = new N();
   let u = 0;
   for (const h of o) {
-    const d = a - h.height, g = new T().translate(u, d);
+    const d = a - h.height, g = new N().translate(u, d);
     g.add(h.e), l.add(g), u += h.width + s.blockMargin;
   }
   return { e: l, width: c, height: a };
@@ -2348,12 +2349,12 @@ const Wi = (s, t) => {
   doraText: !0,
   tsumoText: !0
 }) => {
-  const i = new Wn(e), r = Kt(i, t, n);
+  const i = new Dn(e), r = Kt(i, t, n);
   n.responsive || s.size(r.width, r.height), s.viewbox(0, 0, r.width, r.height), s.add(r.e);
 }, Kn = () => {
   const s = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], t = [];
-  for (const e of Object.values(f)) {
-    if (e == f.BACK) {
+  for (const e of Object.values(p)) {
+    if (e == p.BACK) {
       t.push(Ot.buildID(new y(e, 0)));
       continue;
     }
@@ -2371,11 +2372,11 @@ const Wi = (s, t) => {
       t.includes(a) && e.push(a);
     }
   }, !0), e;
-}, Zo = (s) => {
+}, Yo = (s) => {
   const t = Kn(), e = Ki(s);
   s.each((n, i) => {
     const r = i[n];
-    r instanceof Dn && (t.includes(r.id()) && e.includes(r.id()) || r.remove());
+    r instanceof Bn && (t.includes(r.id()) && e.includes(r.id()) || r.remove());
   }, !0);
 }, Li = (s) => {
   const e = [];
@@ -2384,23 +2385,23 @@ const Wi = (s, t) => {
     e.push(i);
   }
   return e;
-}, z = (s, t, e, n, i = 0, r = 0) => {
-  const o = new T().add(s);
+}, j = (s, t, e, n, i = 0, r = 0) => {
+  const o = new N().add(s);
   if (n == 90) {
     const a = i, c = r - e;
-    return o.rotate(n, 0, e).translate(a, c), new T().add(o);
+    return o.rotate(n, 0, e).translate(a, c), new N().add(o);
   }
   if (n == 180) {
     const a = i + t, c = r - e;
-    return o.rotate(n, 0, e).translate(a, c), new T().add(o);
+    return o.rotate(n, 0, e).translate(a, c), new N().add(o);
   }
   if (n == 270) {
     const a = i + e, c = r + (t - e);
-    return o.rotate(n, 0, e).translate(a, c), new T().add(o);
+    return o.rotate(n, 0, e).translate(a, c), new N().add(o);
   }
-  return new T().add(o);
+  return new N().add(o);
 }, Gt = (s, t) => {
-  const e = new T(), n = Li(s);
+  const e = new N(), n = Li(s);
   for (let i = 0; i < n.length; i++) {
     let r = n[i], o = i * t.tileHeight;
     const a = t.createBlockHandDiscard(new Sn(r, w.IMAGE_DISCARD)).translate(0, o);
@@ -2416,11 +2417,11 @@ const Wi = (s, t) => {
   let u = i * 3, h = r;
   const d = (c + s.tileWidth + i - u) / 2, g = new vt().plain(e.round).font(n).x(d).y(0);
   h += 25 * s.scale;
-  const p = s.tileHeight, E = new T().size(c, p).translate(0, h), A = { family: n.family, size: n.size * 0.7 }, N = s.createStick(1e3).size(c, l).x(0).y(0), v = new vt().plain(a.toString()).font(A).dx(c).dy(l), R = s.createStick(100).size(c, l).x(0).y(l + l), Et = new vt().plain(o.toString()).font(A).dx(c).dy(l * 3);
-  E.add(N), E.add(v), E.add(R), E.add(Et);
+  const f = s.tileHeight, E = new N().size(c, f).translate(0, h), A = { family: n.family, size: n.size * 0.7 }, I = s.createStick(1e3).size(c, l).x(0).y(0), v = new vt().plain(a.toString()).font(A).dx(c).dy(l), x = s.createStick(100).size(c, l).x(0).y(l + l), Et = new vt().plain(o.toString()).font(A).dx(c).dy(l * 3);
+  E.add(I), E.add(v), E.add(x), E.add(Et);
   const _t = s.createImage(e.doras[0], 0, 0).x(c + i).y(0);
   E.add(_t);
-  const At = new T();
+  const At = new N();
   return At.add(g), At.add(g), At.add(E), {
     e: At,
     width: c + s.tileWidth + i,
@@ -2432,22 +2433,22 @@ const Wi = (s, t) => {
   ), c = Math.max(
     e + s.tileHeight * 2 + s.blockMargin * 2,
     a + s.tileWidth * 2 + s.blockMargin
-  ), l = c, u = z(n.e, n.width, n.height, 0).translate(
+  ), l = c, u = j(n.e, n.width, n.height, 0).translate(
     (c - n.width) / 2,
     l - n.height
-  ), h = z(i.e, i.width, i.height, 270).translate(
+  ), h = j(i.e, i.width, i.height, 270).translate(
     c - i.height,
     (c - i.width) / 2
-  ), d = z(r.e, r.width, r.height, 180).translate(
+  ), d = j(r.e, r.width, r.height, 180).translate(
     (c - r.width) / 2,
     0
-  ), g = z(o.e, o.width, o.height, 90).translate(
+  ), g = j(o.e, o.width, o.height, 90).translate(
     0,
     (c - o.width) / 2
-  ), p = new T().size(c, l);
-  return p.add(u), p.add(h), p.add(d), p.add(g), { e: new T().add(p), width: c, height: l };
+  ), f = new N().size(c, l);
+  return f.add(u), f.add(h), f.add(d), f.add(g), { e: new N().add(f), width: c, height: l };
 }, ji = (s) => {
-  const t = Object.values(De), e = t.indexOf(s);
+  const t = Object.values(Be), e = t.indexOf(s);
   return [...t.slice(e), ...t.slice(0, e)];
 }, Fi = (s, t, e) => {
   const n = s.tileWidth * 5 + s.tileHeight * 1, i = t.font, r = t.textWidth, o = t.textHeight, a = t.numWidth, c = zi(s, t, e);
@@ -2458,64 +2459,64 @@ const Wi = (s, t) => {
   const l = (ps, qe, gs) => {
     const ms = `${ps} ${qe}`, ys = new vt().plain(ms).font(i).attr(gs);
     return {
-      e: new T().add(ys),
+      e: new N().add(ys),
       width: r + a * qe.toString().length,
       height: o
     };
   }, [u, h, d, g] = ji(
     e.frontPlace
-  ), p = e.scores, A = l(u, p.front, {
+  ), f = e.scores, A = l(u, f.front, {
     x: n / 2,
     y: n,
     "dominant-baseline": "text-after-edge",
     "text-anchor": "middle"
   }).e;
-  let N = l(h, p.right, {
+  let I = l(h, f.right, {
     "dominant-baseline": "text-after-edge",
     "text-anchor": "middle"
   });
-  const v = z(N.e, N.width, N.height, 270).translate(
+  const v = j(I.e, I.width, I.height, 270).translate(
     n,
-    n / 2 - N.width
+    n / 2 - I.width
   );
-  let R = l(d, p.opposite, {
+  let x = l(d, f.opposite, {
     "text-anchor": "middle",
     "dominant-baseline": "text-after-edge"
   });
-  const Et = z(R.e, R.width, R.height, 180).translate(
-    n / 2 - R.width,
-    -R.height
+  const Et = j(x.e, x.width, x.height, 180).translate(
+    n / 2 - x.width,
+    -x.height
   );
-  let _t = l(g, p.left, {
+  let _t = l(g, f.left, {
     "dominant-baseline": "ideographic",
     "text-anchor": "middle"
   });
-  const At = z(_t.e, _t.width, _t.height, 90).translate(
+  const At = j(_t.e, _t.width, _t.height, 90).translate(
     -_t.height,
     n / 2
-  ), it = new T(), fs = new Pn().size(n, n).x(0).y(0).fill("none").stroke("#000000");
+  ), it = new N(), fs = new Pn().size(n, n).x(0).y(0).fill("none").stroke("#000000");
   return it.add(fs), it.add(c.e), it.add(A), it.add(v), it.add(Et), it.add(At), { e: it, width: n, height: n };
-}, Zi = (s, t) => {
+}, Yi = (s, t) => {
   const e = Gt(t.front, s), n = Gt(t.right, s), i = Gt(t.opposite, s), r = Gt(t.left, s), o = [e.height, n.height, i.height, r.height].reduce(
-    (v, R) => Math.max(v, R)
-  ), a = s.tileWidth * 5 + s.tileHeight * 1, c = o, l = a + o * 2 + s.blockMargin, u = l, h = new T().size(l, u), d = l / 2 - a / 2, g = u / 2 - a / 2, p = z(e.e, a, c, 0).translate(
+    (v, x) => Math.max(v, x)
+  ), a = s.tileWidth * 5 + s.tileHeight * 1, c = o, l = a + o * 2 + s.blockMargin, u = l, h = new N().size(l, u), d = l / 2 - a / 2, g = u / 2 - a / 2, f = j(e.e, a, c, 0).translate(
     d,
     u - c
-  ), E = z(n.e, a, c, 270).translate(
+  ), E = j(n.e, a, c, 270).translate(
     l - c,
     g
-  ), A = z(
+  ), A = j(
     i.e,
     a,
     c,
     180
-  ).translate(d, 0), N = z(r.e, a, c, 90).translate(
+  ).translate(d, 0), I = j(r.e, a, c, 90).translate(
     0,
     g
   );
-  return h.add(p), h.add(E), h.add(A), h.add(N), { e: new T().add(h), width: l, height: u };
+  return h.add(f), h.add(E), h.add(A), h.add(I), { e: new N().add(h), width: l, height: u };
 }, Gi = (s, t, e, n, i) => {
-  const r = new T(), o = Zi(s, n), a = Ui(s, e, o.height), c = Fi(s, t, i);
+  const r = new N(), o = Yi(s, n), a = Ui(s, e, o.height), c = Fi(s, t, i);
   return o.e.translate(
     (a.width - o.width) / 2,
     (a.height - o.height) / 2
@@ -2524,7 +2525,7 @@ const Wi = (s, t) => {
     (a.height - c.height) / 2
   ), r.add(a.e), r.add(o.e), r.add(c.e), { e: r, width: a.width, height: a.height };
 }, Go = (s, t, e = {}, n, i = { responsive: !1 }) => {
-  const r = new Wn(e), o = n, { discards: a, hands: c, scoreBoard: l } = or(t), u = Gi(r, o, c, a, l);
+  const r = new Dn(e), o = n, { discards: a, hands: c, scoreBoard: l } = or(t), u = Gi(r, o, c, a, l);
   i.responsive || s.size(u.width, u.height), s.viewbox(0, 0, u.width, u.height), s.add(u.e);
 };
 var Ee;
@@ -2537,10 +2538,10 @@ function Ln(s) {
     abortPipeEarly: s?.abortPipeEarly ?? Ee?.abortPipeEarly
   };
 }
-var Yi;
+var Zi;
 // @__NO_SIDE_EFFECTS__
 function Vi(s) {
-  return Yi?.get(s);
+  return Zi?.get(s);
 }
 var Ji;
 // @__NO_SIDE_EFFECTS__
@@ -2664,11 +2665,11 @@ function ie(s) {
   };
 }
 // @__NO_SIDE_EFFECTS__
-function K(s, t) {
+function z(s, t) {
   return {
     kind: "schema",
     type: "optional",
-    reference: K,
+    reference: z,
     expects: `(${s.expects} | undefined)`,
     async: !1,
     wrapped: s,
@@ -2832,45 +2833,45 @@ function nr(s, t, e) {
     issues: n.issues
   };
 }
-const Yt = /* @__PURE__ */ K(
+const Zt = /* @__PURE__ */ z(
   /* @__PURE__ */ Ct({
-    discard: /* @__PURE__ */ K(/* @__PURE__ */ re(), ""),
-    hand: /* @__PURE__ */ K(/* @__PURE__ */ re(), ""),
-    score: /* @__PURE__ */ K(/* @__PURE__ */ ie(), 25e3)
+    discard: /* @__PURE__ */ z(/* @__PURE__ */ re(), ""),
+    hand: /* @__PURE__ */ z(/* @__PURE__ */ re(), ""),
+    score: /* @__PURE__ */ z(/* @__PURE__ */ ie(), 25e3)
   }),
   { discard: "", hand: "", score: 25e3 }
 ), sr = /* @__PURE__ */ Ct({
-  [_.E]: Yt,
-  [_.S]: Yt,
-  [_.W]: Yt,
-  [_.N]: Yt
+  [_.E]: Zt,
+  [_.S]: Zt,
+  [_.W]: Zt,
+  [_.N]: Zt
 }), ot = {
   round: O.E1,
   sticks: { reach: 0, dead: 0 },
   doras: _.S,
   front: _.E
-}, ir = /* @__PURE__ */ K(
+}, ir = /* @__PURE__ */ z(
   /* @__PURE__ */ Ct({
-    round: /* @__PURE__ */ K(
-      /* @__PURE__ */ Oe(Object.keys(In)),
+    round: /* @__PURE__ */ z(
+      /* @__PURE__ */ Oe(Object.keys(Tn)),
       ot.round
     ),
-    sticks: /* @__PURE__ */ K(
+    sticks: /* @__PURE__ */ z(
       /* @__PURE__ */ Ct({
-        reach: /* @__PURE__ */ K(
+        reach: /* @__PURE__ */ z(
           /* @__PURE__ */ hn(/* @__PURE__ */ ie(), /* @__PURE__ */ Se(0, ""), /* @__PURE__ */ ve(9, "")),
           ot.sticks.reach
         ),
-        dead: /* @__PURE__ */ K(
+        dead: /* @__PURE__ */ z(
           /* @__PURE__ */ hn(/* @__PURE__ */ ie(), /* @__PURE__ */ Se(0, ""), /* @__PURE__ */ ve(9, "")),
           ot.sticks.dead
         )
       }),
       ot.sticks
     ),
-    doras: /* @__PURE__ */ K(/* @__PURE__ */ re(), ot.doras),
-    front: /* @__PURE__ */ K(
-      /* @__PURE__ */ Oe(Object.keys(De)),
+    doras: /* @__PURE__ */ z(/* @__PURE__ */ re(), ot.doras),
+    front: /* @__PURE__ */ z(
+      /* @__PURE__ */ Oe(Object.keys(Be)),
       ot.front
     )
   }),
@@ -2911,14 +2912,14 @@ const Yt = /* @__PURE__ */ K(
     }
   }
   return r;
-}, Z = (s, t) => s.replace(t, "").replace(":", "").trim(), lr = (s) => {
+}, V = (s, t) => s.replace(t, "").replace(":", "").trim(), lr = (s) => {
   const t = "hand", e = "discard", n = "score", i = {};
   let r = 0;
   for (; r < s.length; r++) {
     const o = s[r];
-    if (o.startsWith(t)) i.hand = Z(o, t);
-    else if (o.startsWith(e)) i.discard = Z(o, e);
-    else if (o.startsWith(n)) i.score = Number(Z(o, n));
+    if (o.startsWith(t)) i.hand = V(o, t);
+    else if (o.startsWith(e)) i.discard = V(o, e);
+    else if (o.startsWith(n)) i.score = Number(V(o, n));
     else break;
   }
   return [i, r];
@@ -2928,34 +2929,34 @@ const Yt = /* @__PURE__ */ K(
   for (; c < s.length; c++) {
     const l = s[c];
     if (l.startsWith(t))
-      a.doras = Z(l, t);
+      a.doras = V(l, t);
     else if (l.startsWith(e))
-      a.round = Z(l, e);
+      a.round = V(l, e);
     else if (l.startsWith(n))
-      a.front = Z(l, n);
+      a.front = V(l, n);
     else if (l.startsWith(i)) {
       a.sticks = {};
       const u = s[c + 1] ?? "", h = s[c + 2] ?? "";
-      u.startsWith(r) && (a.sticks.reach = Number(Z(u, r))), u.startsWith(o) && (a.sticks.dead = Number(Z(u, o))), h.startsWith(r) && (a.sticks.reach = Number(Z(h, r))), h.startsWith(o) && (a.sticks.dead = Number(Z(h, o))), a.sticks.dead != null && c++, a.sticks.reach != null && c++;
+      u.startsWith(r) && (a.sticks.reach = Number(V(u, r))), u.startsWith(o) && (a.sticks.dead = Number(V(u, o))), h.startsWith(r) && (a.sticks.reach = Number(V(h, r))), h.startsWith(o) && (a.sticks.dead = Number(V(h, o))), a.sticks.dead != null && c++, a.sticks.reach != null && c++;
     } else break;
   }
   return [a, c];
 }, ur = (s) => {
   const t = s.board.front, e = dr(t), n = (a) => s[a].discard.replace(/\r?\n/g, ""), i = {
-    front: new W(n(e.front)).tiles(),
-    right: new W(n(e.right)).tiles(),
-    opposite: new W(n(e.opposite)).tiles(),
-    left: new W(n(e.left)).tiles()
+    front: new K(n(e.front)).tiles(),
+    right: new K(n(e.right)).tiles(),
+    opposite: new K(n(e.opposite)).tiles(),
+    left: new K(n(e.left)).tiles()
   }, r = {
-    front: new W(s[e.front].hand).parse(),
-    right: new W(s[e.right].hand).parse(),
-    opposite: new W(s[e.opposite].hand).parse(),
-    left: new W(s[e.left].hand).parse()
+    front: new K(s[e.front].hand).parse(),
+    right: new K(s[e.right].hand).parse(),
+    opposite: new K(s[e.opposite].hand).parse(),
+    left: new K(s[e.left].hand).parse()
   }, o = {
-    round: In[s.board.round],
-    frontPlace: De[t],
+    round: Tn[s.board.round],
+    frontPlace: Be[t],
     sticks: s.board.sticks,
-    doras: new W(s.board.doras).tiles(),
+    doras: new K(s.board.doras).tiles(),
     scores: {
       front: s[e.front].score,
       right: s[e.right].score,
@@ -2966,15 +2967,15 @@ const Yt = /* @__PURE__ */ K(
   return { discards: i, hands: r, scoreBoard: o };
 }, dr = (s) => ({
   front: s,
-  right: It(s),
-  opposite: It(It(s)),
-  left: We(s)
+  right: Tt(s),
+  opposite: Tt(Tt(s)),
+  left: De(s)
 });
-function* U(s) {
-  const t = s?.filterBy && s.filterBy.length > 0 ? s?.filterBy : Object.values(f);
+function* F(s) {
+  const t = s?.filterBy && s.filterBy.length > 0 ? s?.filterBy : Object.values(p);
   for (const e of t) {
-    if (s?.skipBack && e == f.BACK) continue;
-    const n = e == f.Z ? 7 : e == f.BACK ? 1 : 9;
+    if (s?.skipBack && e == p.BACK) continue;
+    const n = e == p.Z ? 7 : e == p.BACK ? 1 : 9;
     for (let i = 1; i <= n; i++)
       yield [e, i];
   }
@@ -2983,18 +2984,18 @@ class ze {
   data;
   constructor(t, e = !1) {
     this.data = {
-      [f.M]: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-      [f.P]: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-      [f.S]: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
-      [f.Z]: [0, 0, 0, 0, 0, 0, 0, 0],
-      [f.BACK]: ["untouchable", 0],
+      [p.M]: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+      [p.P]: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+      [p.S]: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0],
+      [p.Z]: [0, 0, 0, 0, 0, 0, 0, 0],
+      [p.BACK]: ["untouchable", 0],
       called: [],
       reached: !1,
       tsumo: null
     }, this.init(t, e);
   }
   init(t, e) {
-    const n = Array.isArray(t) ? t : new W(t).parse();
+    const n = Array.isArray(t) ? t : new K(t).parse();
     for (const i of n) {
       if (i.isCalled()) {
         this.data.called = [...this.called, i];
@@ -3006,7 +3007,7 @@ class ze {
       } else if (i.is(w.HAND)) {
         this.inc(i.tiles);
         continue;
-      } else if (!Array.isArray(t) && t.split("").every((r) => r === f.BACK)) {
+      } else if (!Array.isArray(t) && t.split("").every((r) => r === p.BACK)) {
         this.inc(i.tiles);
         continue;
       } else if (e) {
@@ -3021,9 +3022,9 @@ class ze {
    */
   get hands() {
     const t = [];
-    for (const [e, n] of U()) {
+    for (const [e, n] of F()) {
       let i = this.get(e, n);
-      e != f.Z && n == 5 && this.get(e, 0) > 0 && (i -= this.get(e, 0), t.push(new y(e, n, [m.RED])));
+      e != p.Z && n == 5 && this.get(e, 0) > 0 && (i -= this.get(e, 0), t.push(new y(e, n, [m.RED])));
       for (let r = 0; r < i; r++)
         t.push(new y(e, n));
     }
@@ -3033,7 +3034,9 @@ class ze {
       );
       b(
         n >= 0,
-        `hand has drawn: ${this.drawn} but no tile in hands: ${t.join("")}`
+        `drawn tile exists: ${this.drawn} but no tile in hand: ${t.join(
+          ""
+        )}`
       ), t[n] = t[n].clone({ add: m.TSUMO });
     }
     return t;
@@ -3067,14 +3070,14 @@ class ze {
    * 面前かどうかを返す。
    */
   get menzen() {
-    return !this.called.some((t) => !(t instanceof x));
+    return !this.called.some((t) => !(t instanceof C));
   }
   /**
    * 手牌において、指定した牌の種類の合計枚数を返す
    */
   sum(t) {
     let e = 0;
-    for (const [n, i] of U({ filterBy: [t] })) e += this.get(n, i);
+    for (const [n, i] of F({ filterBy: [t] })) e += this.get(n, i);
     return e;
   }
   /**
@@ -3082,7 +3085,7 @@ class ze {
    * 赤のみを取得する場合は n に 0 を指定する。
    */
   get(t, e) {
-    return t == f.BACK ? this.data[t][1] : this.data[t][e];
+    return t == p.BACK ? this.data[t][1] : this.data[t][e];
   }
   /**
    * 指定した牌を手牌に加える。draw に比べプリミティブな操作となる。
@@ -3090,13 +3093,13 @@ class ze {
   inc(t) {
     const e = [];
     for (const n of t) {
-      const i = n.t != f.BACK && this.get(n.t, n.n) >= 4, r = n.has(m.RED) && this.get(n.t, 0) > 0;
+      const i = n.t != p.BACK && this.get(n.t, n.n) >= 4, r = n.has(m.RED) && this.get(n.t, 0) > 0;
       if (i || r) {
         this.dec(e);
         const o = i ? `tile ${n} exists more than 4 times` : `red tile ${n} appears more than 1 times`;
-        throw new Error(`invalid hand: ${o} in ${this.toString()}`);
+        throw new Error(`invalid hand: ${o} in hand: ${this.toString()}`);
       }
-      e.push(n), n.t == f.BACK ? this.data[n.t][1] += 1 : (this.data[n.t][n.n] += 1, n.has(m.RED) && (this.data[n.t][0] += 1));
+      e.push(n), n.t == p.BACK ? this.data[n.t][1] += 1 : (this.data[n.t][n.n] += 1, n.has(m.RED) && (this.data[n.t][0] += 1));
     }
     return e;
   }
@@ -3109,10 +3112,10 @@ class ze {
       const i = this.get(n.t, n.n) < 1, r = n.has(m.RED) && this.get(n.t, 0) <= 0;
       if (i || r) {
         this.inc(e);
-        const o = i ? `tile ${n} is not in` : `red tile ${n} is not in`;
-        throw new Error(`invalid hand: ${o} in ${this.toString()}`);
+        const o = i ? `tile ${n} is not` : `red tile ${n} is not`;
+        throw new Error(`invalid hand: ${o} in hand: ${this.toString()}`);
       }
-      if (e.push(n), n.t == f.BACK ? this.data[n.t][1] -= 1 : (this.data[n.t][n.n] -= 1, n.has(m.RED) && (this.data[n.t][0] -= 1)), k(n) && this.get(n.t, 5) == 0 && this.get(n.t, 0) > 0) {
+      if (e.push(n), n.t == p.BACK ? this.data[n.t][1] -= 1 : (this.data[n.t][n.n] -= 1, n.has(m.RED) && (this.data[n.t][0] -= 1)), k(n) && this.get(n.t, 5) == 0 && this.get(n.t, 0) > 0) {
         this.data[n.t][0] = 0;
         const o = e.pop().clone({ add: m.RED });
         e.push(o);
@@ -3147,23 +3150,25 @@ class ze {
   call(t) {
     const e = t.tiles.filter((n) => !n.has(m.HORIZONTAL));
     if (e.length != t.tiles.length - 1)
-      throw new Error(`removal: ${e} block: ${t}`);
+      throw new Error(`invalid block: removal tiles: ${e}, block: ${t}`);
     this.dec(e), this.data.called = [...this.called, t], this.data.tsumo = null;
   }
   /**
    * ツモした牌を指定したブロックでカンする。鳴く牌はブロック内で表現する。
    */
   kan(t) {
-    if (t instanceof x) {
+    if (t instanceof C) {
       this.dec(t.tiles), this.data.called = [...this.called, t], this.data.tsumo = null;
       return;
     }
-    if (t instanceof L) {
+    if (t instanceof W) {
       const e = this.data.called.findIndex(
         (i) => i.is(w.PON) && i.tiles[0].equals(t.tiles[0])
-        // FIXME handle which tile is called
       );
-      if (e == -1) throw new Error(`unable to find ${t.tiles[0]}`);
+      if (e == -1)
+        throw new Error(
+          `unable to find pon block ${t.tiles[0]} for shokan: ${t}`
+        );
       let n = t.tiles[0];
       n = k(n) ? n.clone({ remove: m.RED }) : n, this.dec([n]), this.data.called = [
         ...this.called.slice(0, e),
@@ -3198,9 +3203,9 @@ class ge {
    * 七対子のシャンテン数を返す。
    */
   sevenPairs() {
-    if (this.hand.called.length > 0) return 1 / 0;
+    if (this.hand.called.length > 0) return Number.POSITIVE_INFINITY;
     let t = 0, e = 0;
-    for (const [n, i] of U({ skipBack: !0 }))
+    for (const [n, i] of F({ skipBack: !0 }))
       this.hand.get(n, i) == 2 && t++, this.hand.get(n, i) == 1 && e++;
     return t > 7 && (t = 7), t + e >= 7 && (e = 7 - t), 13 - 2 * t - e;
   }
@@ -3208,11 +3213,11 @@ class ge {
    * 国士無双のシャンテン数を返す。
    */
   thirteenOrphans() {
-    if (this.hand.called.length > 0) return 1 / 0;
+    if (this.hand.called.length > 0) return Number.POSITIVE_INFINITY;
     let t = 0, e = 0;
-    for (const n of Object.values(f)) {
-      if (n == f.BACK) continue;
-      const i = n == f.Z ? jt : V;
+    for (const n of Object.values(p)) {
+      if (n == p.BACK) continue;
+      const i = n == p.Z ? jt : X;
       for (const r of i)
         this.hand.get(n, r) >= 1 && t++, this.hand.get(n, r) >= 2 && e++;
     }
@@ -3224,25 +3229,25 @@ class ge {
   standardType() {
     const t = (n) => {
       const i = [0, 0, 0];
-      for (const [d, g] of U({ filterBy: [f.Z] }))
+      for (const [d, g] of F({ filterBy: [p.Z] }))
         this.hand.get(d, g) >= 3 ? i[0]++ : this.hand.get(d, g) == 2 ? i[1]++ : this.hand.get(d, g) == 1 && i[2]++;
-      const r = [0, 0, 0], o = this.hand.get(f.BACK, 0), a = o % 3;
+      const r = [0, 0, 0], o = this.hand.get(p.BACK, 0), a = o % 3;
       r[0] = Math.floor(o / 3), a == 2 ? r[1] = 1 : a == 1 && (r[2] = 1);
       let c = 13;
-      const l = this.calcNumberTilePatterns(f.M), u = this.calcNumberTilePatterns(f.P), h = this.calcNumberTilePatterns(f.S);
+      const l = this.calcNumberTilePatterns(p.M), u = this.calcNumberTilePatterns(p.P), h = this.calcNumberTilePatterns(p.S);
       for (const d of [l.patternA, l.patternB])
         for (const g of [u.patternA, u.patternB])
-          for (const p of [h.patternA, h.patternB]) {
+          for (const f of [h.patternA, h.patternB]) {
             const E = [this.hand.called.length, 0, 0];
-            for (let N = 0; N < 3; N++)
-              E[N] += d[N] + g[N] + p[N] + i[N] + r[N];
-            const A = this.calcStandardType(E[0], E[1], E[2], n);
+            for (let I = 0; I < 3; I++)
+              E[I] += d[I] + g[I] + f[I] + i[I] + r[I];
+            const A = this.getStandardTypeShanten(E[0], E[1], E[2], n);
             A < c && (c = A);
           }
       return c;
     };
     let e = t(!1);
-    for (const [n, i] of U())
+    for (const [n, i] of F())
       if (this.hand.get(n, i) >= 2) {
         const r = this.hand.dec(new Array(2).fill(new y(n, i))), o = t(!0);
         this.hand.inc(r), o < e && (e = o);
@@ -3268,14 +3273,14 @@ class ge {
   }
   groupRemainingTiles(t) {
     let e = 0, n = 0, i = 0;
-    for (const [r, o] of U({ filterBy: [t] }))
+    for (const [r, o] of F({ filterBy: [t] }))
       i += this.hand.get(r, o), o <= 7 && this.hand.get(r, o + 1) == 0 && this.hand.get(r, o + 2) == 0 && (e += i >> 1, n += i % 2, i = 0);
     return e += i >> 1, n += i % 2, {
       patternA: [0, e, n],
       patternB: [0, e, n]
     };
   }
-  calcStandardType(t, e, n, i) {
+  getStandardTypeShanten(t, e, n, i) {
     let r = i ? 4 : 5;
     return t > 4 && (e += t - 4, t = 4), t + e > 4 && (n += t + e - 4, e = 4 - t), t + e + n > r && (n = r - t - e), i && e++, 13 - t * 3 - e * 2 - n;
   }
@@ -3304,11 +3309,7 @@ class fr {
    * あがりの形になりうる手牌の構成の配列に対して、最後のあがり牌を考慮したあがりの形になりうる手牌の構成の配列を返す。
    */
   markedHands(t, e) {
-    if (t.length == 0) return [];
-    const n = [];
-    for (let i = 0; i < t.length; i++)
-      n.push(...this.markedHand(t[i], e));
-    return n;
+    return t.length == 0 ? [] : t.map((n) => this.markedHand(n, e)).flat();
   }
   /**
    * あがりの形になりうる手牌の構成に対して、最後のあがり牌を考慮したあがりの形になりうる手牌の構成の配列を返す。
@@ -3346,15 +3347,13 @@ class fr {
   sevenPairs() {
     if (this.hand.called.length > 0) return [];
     const t = [];
-    for (const [e, n] of U({ skipBack: !0 })) {
+    for (const [e, n] of F({ skipBack: !0 })) {
       const i = this.hand.get(e, n);
-      if (i == 2) {
-        const r = this.hand.dec(new Array(2).fill(new y(e, n)));
-        t.push(new D(r[0], r[1])), this.hand.inc(r);
-      } else {
-        if (i == 0) continue;
-        return [];
-      }
+      if (i != 0)
+        if (i == 2) {
+          const r = this.hand.dec(new Array(2).fill(new y(e, n)));
+          t.push(new R(r[0], r[1])), this.hand.inc(r);
+        } else return [];
     }
     return [t];
   }
@@ -3365,14 +3364,14 @@ class fr {
   thirteenOrphans() {
     const t = [];
     let e = !1;
-    for (const n of Object.values(f)) {
-      if (n == f.BACK) continue;
-      const i = n == f.Z ? jt : V;
+    for (const n of Object.values(p)) {
+      if (n == p.BACK) continue;
+      const i = n == p.Z ? jt : X;
       for (let r of i)
         if (this.hand.get(n, r) == 1)
           t.push(new vn(new y(n, r)));
         else if (this.hand.get(n, r) == 2 && e == !1)
-          t.unshift(new D(new y(n, r), new y(n, r))), e = !0;
+          t.unshift(new R(new y(n, r), new y(n, r))), e = !0;
         else return [];
     }
     return [t];
@@ -3383,8 +3382,8 @@ class fr {
    */
   nineGates() {
     const t = (e, n, i) => i.includes(this.hand.get(e, n));
-    for (const e of Object.values(f)) {
-      if (e == f.BACK || e == f.Z) continue;
+    for (const e of Object.values(p)) {
+      if (e == p.BACK || e == p.Z) continue;
       const n = t(e, 1, [3, 4]) && t(e, 9, [3, 4]) && t(e, 2, [1, 2]) && t(e, 3, [1, 2]) && t(e, 4, [1, 2]) && t(e, 5, [1, 2]) && t(e, 6, [1, 2]) && t(e, 7, [1, 2]) && t(e, 8, [1, 2]), i = this.hand.sum(e) == 14;
       if (n && i)
         return [[new Ut(this.hand.hands)]];
@@ -3397,20 +3396,20 @@ class fr {
    */
   standardType() {
     let t = [];
-    for (const [e, n] of U())
+    for (const [e, n] of F())
       if (this.hand.get(e, n) >= 2) {
         const i = new Array(2).fill(new y(e, n));
         n == 5 && this.hand.get(e, 0) > 0 && this.hand.get(e, n) >= 3 && (i[1] = new y(e, n, [m.RED]));
-        const r = this.hand.dec(i), o = this.calcAllBlockCombinations().filter((a) => a.length == 4).map((a) => (a.unshift(new D(r[0], r[1])), a));
+        const r = this.hand.dec(i), o = this.calcAllBlockCombinations().filter((a) => a.length == 4).map((a) => (a.unshift(new R(r[0], r[1])), a));
         t = [...t, ...o], this.hand.inc(r);
       }
     return t;
   }
   calcAllBlockCombinations() {
     return [
-      this.addRedPatterns(f.M, this.handleNumType(f.M)),
-      this.addRedPatterns(f.P, this.handleNumType(f.P)),
-      this.addRedPatterns(f.S, this.handleNumType(f.S)),
+      this.addRedPatterns(p.M, this.handleNumType(p.M)),
+      this.addRedPatterns(p.P, this.handleNumType(p.P)),
+      this.addRedPatterns(p.S, this.handleNumType(p.S)),
       this.handleZ(),
       this.handleBack(),
       [this.hand.called.concat()]
@@ -3421,18 +3420,18 @@ class fr {
   }
   // handle back tiles as same unknown tiles, Not joker tile.
   handleBack() {
-    const t = f.BACK, e = this.hand.get(t, 0);
+    const t = p.BACK, e = this.hand.get(t, 0);
     if (e < 3) return [];
-    const n = new y(t, 0), i = Array(Math.floor(e / 3)).fill(new G([n, n, n]));
+    const n = new y(t, 0), i = Array(Math.floor(e / 3)).fill(new L([n, n, n]));
     return i.length == 0 ? [] : [i];
   }
   handleZ() {
     const t = [];
-    for (const [e, n] of U({ filterBy: [f.Z] })) {
+    for (const [e, n] of F({ filterBy: [p.Z] })) {
       if (this.hand.get(e, n) == 0) continue;
       if (this.hand.get(e, n) != 3) return [];
       const i = new y(e, n);
-      t.push(new G([i, i, i]));
+      t.push(new L([i, i, i]));
     }
     return t.length == 0 ? [] : [t];
   }
@@ -3444,7 +3443,7 @@ class fr {
     let o = null;
     const a = {};
     for (let l = 0; l < e.length; l++) {
-      const u = e[l], h = u.tiles.findIndex((p) => k(p) && !p.has(m.RED)), d = u.tiles.findIndex((p) => k(p) && p.has(m.RED));
+      const u = e[l], h = u.tiles.findIndex((f) => k(f) && !f.has(m.RED)), d = u.tiles.findIndex((f) => k(f) && f.has(m.RED));
       if (d > -1 && (o = [l, d]), d > -1 && h > -1 || h < 0) continue;
       const g = Lt(u);
       a[g] || (a[g] = !0, r.push([l, h]));
@@ -3468,13 +3467,7 @@ class fr {
    */
   // TODO similar to markDrawn
   addRedPatterns(t, e) {
-    if (!(this.hand.get(t, 0) > 0 && this.hand.get(t, 5) >= 2)) return e;
-    const n = [];
-    for (let i = 0; i < e.length; i++) {
-      const r = e[i];
-      n.push(...this.addRedPattern(t, r));
-    }
-    return n;
+    return this.hand.get(t, 0) > 0 && this.hand.get(t, 5) >= 2 ? e.map((n) => this.addRedPattern(t, n)).flat() : e;
   }
   handleNumType(t, e = 1) {
     if (e > 9) return [];
@@ -3497,23 +3490,23 @@ class fr {
       let r = this.handleNumType(t, e);
       this.hand.inc(i), r.length == 0 && (r = [[]]);
       for (const o of r)
-        o.unshift(new G([i[0], i[1], i[2]])), n.push(o);
+        o.unshift(new L([i[0], i[1], i[2]])), n.push(o);
     }
     return n;
   }
 }
-const jt = [1, 2, 3, 4, 5, 6, 7], V = [1, 9], Vt = (s) => {
+const jt = [1, 2, 3, 4, 5, 6, 7], X = [1, 9], Vt = (s) => {
   const t = s.boardContext;
   return {
     ...s,
-    hand: s.hand.map(I.deserialize),
+    hand: s.hand.map(T.deserialize),
     boardContext: {
       ...t,
       doraIndicators: t.doraIndicators.map(y.from),
       hiddenDoraIndicators: t.hiddenDoraIndicators?.map(y.from)
     }
   };
-}, ke = (s) => JSON.parse(JSON.stringify(s)), C = {
+}, ke = (s) => JSON.parse(JSON.stringify(s)), M = {
   MANGAN: 2e3,
   HANEMAN: 3e3,
   DOUBLE: 4e3,
@@ -3523,18 +3516,18 @@ const jt = [1, 2, 3, 4, 5, 6, 7], V = [1, 9], Vt = (s) => {
   DEAD_STICK: 300,
   REACH_STICK: 1e3
 }, pr = [
-  { minHan: 26, points: C.DOUBLE_YAKUMAN },
-  { minHan: 13, points: C.YAKUMAN },
-  { minHan: 11, points: C.TRIPLE },
-  { minHan: 8, points: C.DOUBLE },
-  { minHan: 6, points: C.HANEMAN },
-  { minHan: 5, points: C.MANGAN }
+  { minHan: 26, points: M.DOUBLE_YAKUMAN },
+  { minHan: 13, points: M.YAKUMAN },
+  { minHan: 11, points: M.TRIPLE },
+  { minHan: 8, points: M.DOUBLE },
+  { minHan: 6, points: M.HANEMAN },
+  { minHan: 5, points: M.MANGAN }
 ], gr = {
-  [C.MANGAN]: "満貫",
-  [C.HANEMAN]: "跳満",
-  [C.DOUBLE]: "倍満",
-  [C.TRIPLE]: "三倍満"
-}, Y = {
+  [M.MANGAN]: "満貫",
+  [M.HANEMAN]: "跳満",
+  [M.DOUBLE]: "倍満",
+  [M.TRIPLE]: "三倍満"
+}, J = {
   PARENT_RON: 6,
   CHILD_RON: 4,
   PARENT_TSUMO: 2,
@@ -3553,11 +3546,11 @@ function mr(s) {
 }
 function yr(s, t, e) {
   if (t)
-    return e ? `${Q(s * Y.PARENT_TSUMO)}` : `${Q(s * Y.CHILD_TUMO_FROM_CHILD)}-${Q(
-      s * Y.CHILD_TUMO_FROM_PARENT
+    return e ? `${Q(s * J.PARENT_TSUMO)}` : `${Q(s * J.CHILD_TUMO_FROM_CHILD)}-${Q(
+      s * J.CHILD_TUMO_FROM_PARENT
     )}`;
   {
-    const n = e ? Y.PARENT_RON : Y.CHILD_RON;
+    const n = e ? J.PARENT_RON : J.CHILD_RON;
     return `${Q(s * n)}`;
   }
 }
@@ -3597,7 +3590,9 @@ class un {
       i.isParent,
       i.myWind,
       this.cfg.orig.ronWind
-    ), o = r[i.myWind] - this.cfg.sticks.dead * C.DEAD_STICK, a = mr({
+    ), o = r[i.myWind];
+    this.addStickPoints(r, i.myWind, this.cfg.orig.ronWind);
+    const a = mr({
       base: i.base,
       fu: i.fu,
       han: i.han,
@@ -3608,6 +3603,8 @@ class un {
     });
     return {
       ...n,
+      fu: i.fu,
+      // ceiled value
       deltas: r,
       points: r[i.myWind],
       basePoints: o,
@@ -3692,7 +3689,7 @@ class un {
   calculateScore(t) {
     const { han: e } = t, n = t.fu !== 25 ? Q(t.fu, 10) : 25, i = t.isYakuman ?? !1;
     let r = this.getBasePoints(e, n), o = !1;
-    e >= 13 && e < 26 && !this.hasYakuman(t.yakus) && (r = this.cfg.disableCountableYakuman ? C.TRIPLE : C.YAKUMAN, o = !this.cfg.disableCountableYakuman), this.cfg.enableRoundUpMangan && this.isRoundUpMangan(n, e) && (r = C.MANGAN);
+    e >= 13 && e < 26 && !this.hasYakuman(t.yakus) && (r = this.cfg.disableCountableYakuman ? M.TRIPLE : M.YAKUMAN, o = !this.cfg.disableCountableYakuman), this.cfg.enableRoundUpMangan && this.isRoundUpMangan(n, e) && (r = M.MANGAN);
     const a = this.isTsumoWin(t.hand), c = this.cfg.orig.myWind, l = c === _.E;
     return {
       base: r,
@@ -3718,37 +3715,39 @@ class un {
    * Wind をキーとした点数移動の構成を返す
    */
   calculateDeltas(t, e, n, i, r) {
-    const o = P(0);
-    return e ? this.calculateTsumoDeltas(o, t, n, i) : this.calculateRonDeltas(o, t, n, i, r), this.addStickPoints(o, i), o;
+    const o = B(0);
+    return e ? this.calculateTsumoDeltas(o, t, n, i) : (b(r != null, "tumo is false but ron wind is null"), this.calculateRonDeltas(o, t, n, i, r)), o;
   }
   calculateRonDeltas(t, e, n, i, r) {
-    if (r == null)
-      throw new Error("ron wind is not specified in the parameters");
-    const o = n ? Y.PARENT_RON : Y.CHILD_RON, a = Q(e * o), c = this.cfg.sticks.dead * C.DEAD_STICK, l = a + c;
-    t[i] += l, t[r] -= l;
+    const o = n ? J.PARENT_RON : J.CHILD_RON, a = Q(e * o);
+    t[i] += a, t[r] -= a;
   }
   calculateTsumoDeltas(t, e, n, i) {
-    const r = this.cfg.sticks.dead * (C.DEAD_STICK / 3);
-    n ? this.calculateParentTsumoDeltas(t, e, r) : this.calculateChildTsumoDeltas(t, e, i, r);
-  }
-  calculateParentTsumoDeltas(t, e, n) {
-    const i = Q(e * Y.PARENT_TSUMO);
-    t[_.E] += i * 3 + n * 3, t[_.S] -= i + n, t[_.W] -= i + n, t[_.N] -= i + n;
-  }
-  calculateChildTsumoDeltas(t, e, n, i) {
+    if (n) {
+      const r = Q(e * J.PARENT_TSUMO);
+      t[_.E] += r * 3, t[_.S] -= r, t[_.W] -= r, t[_.N] -= r;
+      return;
+    }
     for (const r of Object.values(_)) {
-      if (r == n) continue;
-      const o = r == _.E ? Y.CHILD_TUMO_FROM_PARENT : Y.CHILD_TUMO_FROM_CHILD, a = Q(e * o);
-      t[r] -= a + i, t[n] += a + i;
+      if (r == i) continue;
+      const o = r == _.E ? J.CHILD_TUMO_FROM_PARENT : J.CHILD_TUMO_FROM_CHILD, a = Q(e * o);
+      t[r] -= a, t[i] += a;
     }
   }
-  addStickPoints(t, e) {
-    t[e] += C.REACH_STICK * this.cfg.sticks.reach;
+  addStickPoints(t, e, n) {
+    t[e] += M.REACH_STICK * this.cfg.sticks.reach;
+    const i = M.DEAD_STICK * this.cfg.sticks.dead;
+    if (n != null) {
+      t[e] += i, t[n] -= i;
+      return;
+    }
+    for (const r of Object.values(_))
+      r == e ? t[r] += i : t[r] -= i / 3;
   }
   getBasePoints(t, e) {
     for (const { minHan: n, points: i } of pr)
       if (t >= n) return i;
-    return Math.min(e * 2 ** (t + 2), C.MANGAN);
+    return Math.min(e * 2 ** (t + 2), M.MANGAN);
   }
   minus() {
     return this.hand.menzen ? 0 : 1;
@@ -3757,7 +3756,7 @@ class un {
     return this.cfg.reached == 1 ? [{ name: "立直", han: 1 }] : this.cfg.reached == 2 ? [{ name: "ダブル立直", han: 2 }] : [];
   }
   dB1(t) {
-    return this.minus() != 0 ? [] : (this.hand.drawn == null, t.some((n) => n.tiles.some((i) => i.has(m.TSUMO))) ? [{ name: "門前清自摸和", han: 1 }] : []);
+    return this.hand.drawn == null, this.minus() != 0 ? [] : t.some((n) => n.tiles.some((i) => i.has(m.TSUMO))) ? [{ name: "門前清自摸和", han: 1 }] : [];
   }
   dC1(t) {
     if (this.minus() != 0) return [];
@@ -3766,7 +3765,7 @@ class un {
   }
   dD1(t) {
     return t.some(
-      (n) => n.tiles.some((i) => i.t == f.Z || V.includes(i.n))
+      (n) => n.tiles.some((i) => i.t == p.Z || X.includes(i.n))
     ) ? [] : [{ name: "断么九", han: 1 }];
   }
   dE1(t) {
@@ -3775,9 +3774,9 @@ class un {
   dF1(t) {
     const e = [];
     return t.forEach((n) => {
-      if (n instanceof D) return;
+      if (n instanceof R) return;
       const i = n.tiles[0];
-      i.t == f.Z && (i.equals(this.cfg.myWind) && e.push({ name: "自風", han: 1 }), i.equals(this.cfg.roundWind) ? e.push({ name: "場風", han: 1 }) : i.n == 5 ? e.push({ name: "白", han: 1 }) : i.n == 6 ? e.push({ name: "發", han: 1 }) : i.n == 7 && e.push({ name: "中", han: 1 }));
+      i.t == p.Z && (i.equals(this.cfg.myWind) && e.push({ name: "自風", han: 1 }), i.equals(this.cfg.roundWind) ? e.push({ name: "場風", han: 1 }) : i.n == 5 ? e.push({ name: "白", han: 1 }) : i.n == 6 ? e.push({ name: "發", han: 1 }) : i.n == 7 && e.push({ name: "中", han: 1 }));
     }), e;
   }
   dG1(t) {
@@ -3810,12 +3809,10 @@ class un {
     return t.length == 7 ? [{ name: "七対子", han: 2 }] : [];
   }
   dB2(t) {
-    const e = (n) => n instanceof dt || n instanceof J;
+    const e = (n) => n instanceof dt || n instanceof q;
     for (const n of t) {
-      if (!e(n)) continue;
-      const i = at(n);
-      if (i.t == f.Z) continue;
-      const r = [f.M, f.P, f.S].filter((c) => c != i.t), o = t.some((c) => {
+      if (!e(n) || n.tiles[0].t == p.Z) continue;
+      const i = at(n), r = [p.M, p.P, p.S].filter((c) => c != i.t), o = t.some((c) => {
         const l = new y(r[0], i.n);
         return e(c) && l.equals(at(c));
       }), a = t.some((c) => {
@@ -3828,24 +3825,24 @@ class un {
   }
   dC2(t) {
     return t.length == 7 ? [] : t.every(
-      (n) => n instanceof x || n instanceof L || n instanceof q || n instanceof G || n instanceof X || n instanceof D
+      (n) => n instanceof C || n instanceof W || n instanceof Z || n instanceof L || n instanceof U || n instanceof R
     ) ? [{ name: "対々和", han: 2 }] : [];
   }
   dD2(t) {
-    return t.filter((n) => (n instanceof x || n instanceof G) && !n.tiles.some((i) => i.has(m.RON))).length >= 3 ? [{ name: "三暗刻", han: 2 }] : [];
+    return t.filter((n) => (n instanceof C || n instanceof L) && !n.tiles.some((i) => i.has(m.RON))).length >= 3 ? [{ name: "三暗刻", han: 2 }] : [];
   }
   dE2(t) {
     return t.filter(
-      (n) => n instanceof x || n instanceof L || n instanceof q
+      (n) => n instanceof C || n instanceof W || n instanceof Z
     ).length >= 3 ? [{ name: "三槓子", han: 2 }] : [];
   }
   dF2(t) {
-    const e = (n) => n instanceof x || n instanceof L || n instanceof q || n instanceof G || n instanceof X;
+    const e = (n) => n instanceof C || n instanceof W || n instanceof Z || n instanceof L || n instanceof U;
     for (const n of t) {
       if (!e(n)) continue;
       const i = at(n);
-      if (i.t == f.Z) continue;
-      const r = [f.M, f.P, f.S].filter((c) => c != i.t), o = t.some((c) => {
+      if (i.t == p.Z) continue;
+      const r = [p.M, p.P, p.S].filter((c) => c != i.t), o = t.some((c) => {
         const l = new y(r[0], i.n);
         return e(c) && l.equals(at(c));
       }), a = t.some((c) => {
@@ -3859,31 +3856,31 @@ class un {
   dG2(t) {
     return t.length == 7 ? [] : t.filter((n) => {
       const i = n.tiles[0];
-      return i.t == f.Z && [5, 6, 7].includes(i.n);
+      return i.t == p.Z && [5, 6, 7].includes(i.n);
     }).length == 3 ? [{ name: "小三元", han: 2 }] : [];
   }
   dH2(t) {
     return t.every((n) => {
-      const i = n.tiles[0].t == f.Z ? jt : V;
-      return n.tiles.every((r) => i.includes(r.n));
+      const i = n.tiles[0], r = i.t == p.Z ? jt : X;
+      return (n instanceof C || n instanceof W || n instanceof Z || n instanceof L || n instanceof U || n instanceof R) && r.includes(i.n);
     }) ? [{ name: "混老頭", han: 2 }] : [];
   }
   dI2(t) {
-    return t.length == 7 ? [] : t.some((n) => n instanceof dt || n instanceof J) ? t.some((n) => n.tiles[0].t == f.Z) ? t.every((n) => {
-      const i = n.tiles[0].t == f.Z ? jt : V;
+    return t.length == 7 ? [] : t.some((n) => n instanceof dt || n instanceof q) ? t.some((n) => n.tiles[0].t == p.Z) ? t.every((n) => {
+      const i = n.tiles[0].t == p.Z ? jt : X;
       return n.tiles.some((r) => i.includes(r.n));
     }) ? [{ name: "混全帯么九", han: 2 - this.minus() }] : [] : [] : [];
   }
   dJ2(t) {
     const e = {
       // 123m, 456m, 789m
-      [f.M]: [0, 0, 0],
-      [f.S]: [0, 0, 0],
-      [f.P]: [0, 0, 0]
+      [p.M]: [0, 0, 0],
+      [p.S]: [0, 0, 0],
+      [p.P]: [0, 0, 0]
     };
     for (const n of t) {
       const i = at(n);
-      i.t != f.BACK && i.t != f.Z && (n instanceof dt || n instanceof J) && (i.n == 1 ? e[i.t][0]++ : i.n == 4 ? e[i.t][1]++ : i.n == 7 && e[i.t][2]++);
+      i.t != p.BACK && i.t != p.Z && (n instanceof dt || n instanceof q) && (i.n == 1 ? e[i.t][0]++ : i.n == 4 ? e[i.t][1]++ : i.n == 7 && e[i.t][2]++);
     }
     for (const n of Object.values(e))
       if (n[0] > 0 && n[1] > 0 && n[2] > 0)
@@ -3891,28 +3888,28 @@ class un {
     return [];
   }
   dA3(t) {
-    if (!t.some((n) => n.tiles[0].t == f.Z)) return [];
-    for (const n of Object.values(f))
-      if (t.every((r) => r.tiles[0].t == f.Z || r.tiles[0].t == n)) return [{ name: "混一色", han: 3 - this.minus() }];
+    if (!t.some((n) => n.tiles[0].t == p.Z)) return [];
+    for (const n of Object.values(p))
+      if (t.every((r) => r.tiles[0].t == p.Z || r.tiles[0].t == n)) return [{ name: "混一色", han: 3 - this.minus() }];
     return [];
   }
   dB3(t) {
-    return t.length == 7 ? [] : t.some((n) => n instanceof dt || n instanceof J) ? t.some((n) => n.tiles[0].t == f.Z) ? [] : t.every((n) => n.tiles.some((i) => V.includes(i.n))) ? [{ name: "純全帯么九色", han: 3 - this.minus() }] : [] : [];
+    return t.length == 7 ? [] : t.some((n) => n instanceof dt || n instanceof q) ? t.some((n) => n.tiles[0].t == p.Z) ? [] : t.every((n) => n.tiles.some((i) => X.includes(i.n))) ? [{ name: "純全帯么九色", han: 3 - this.minus() }] : [] : [];
   }
   dC3(t) {
     return this.minus() != 0 ? [] : dn(t) == 2 ? [{ name: "ニ盃口", han: 3 }] : [];
   }
   dA6(t) {
-    if (t.some((e) => e.tiles[0].t == f.Z)) return [];
-    for (const e of Object.values(f)) {
-      if (e == f.Z) continue;
+    if (t.some((e) => e.tiles[0].t == p.Z)) return [];
+    for (const e of Object.values(p)) {
+      if (e == p.Z) continue;
       if (t.every((i) => i.tiles[0].t == e)) return [{ name: "清一色", han: 6 - this.minus() }];
     }
     return [];
   }
   dA13(t) {
     return t.length != 13 ? [] : t.some(
-      (n) => n instanceof D && n.tiles.some((i) => i.has(m.TSUMO) || i.has(m.RON))
+      (n) => n instanceof R && n.tiles.some((i) => i.has(m.TSUMO) || i.has(m.RON))
     ) ? [{ name: "国士無双13面待ち", han: 26, isYakuman: !0 }] : [{ name: "国士無双", han: 13, isYakuman: !0 }];
   }
   dB13(t) {
@@ -3920,39 +3917,42 @@ class un {
   }
   dC13(t) {
     return t.length == 7 ? [] : t.every(
-      (i) => i instanceof x || i instanceof G && i.tiles.every((r) => !r.has(m.RON)) || i instanceof D
+      (i) => i instanceof C || i instanceof L && i.tiles.every((r) => !r.has(m.RON)) || i instanceof R
     ) ? t.some(
-      (i) => i instanceof D && i.tiles.some((r) => r.has(m.TSUMO) || r.has(m.RON))
+      (i) => i instanceof R && i.tiles.some((r) => r.has(m.TSUMO) || r.has(m.RON))
     ) ? [{ name: "四暗刻単騎待ち", han: 26, isYakuman: !0 }] : [{ name: "四暗刻", han: 13, isYakuman: !0 }] : [];
   }
   dD13(t) {
     if (t.length == 13) return [];
     const e = [5, 6, 7];
     return t.filter(
-      (i) => !(i instanceof D) && i.tiles.some((r) => r.t == f.Z && e.includes(r.n))
+      (i) => !(i instanceof R) && i.tiles.some((r) => r.t == p.Z && e.includes(r.n))
     ).length == 3 ? [{ name: "大三元", han: 13, isYakuman: !0 }] : [];
   }
   dE13(t) {
-    return t.every((n) => n.tiles[0].t == f.Z) ? [{ name: "字一色", han: 13, isYakuman: !0 }] : [];
+    return t.every((n) => n.tiles[0].t == p.Z) ? [{ name: "字一色", han: 13, isYakuman: !0 }] : [];
   }
   dF13(t) {
     return t.every(
-      (n) => n.tiles.every((i) => i.t != f.Z && V.includes(i.n))
+      (n) => (n instanceof C || n instanceof W || n instanceof Z || n instanceof L || n instanceof U || n instanceof R) && X.includes(n.tiles[0].n)
     ) ? [{ name: "清老頭", han: 13, isYakuman: !0 }] : [];
   }
   dG13(t) {
-    return t.filter(
-      (n) => n instanceof x || n instanceof L || n instanceof q
-    ).length == 4 ? [{ name: "四槓子", han: 13, isYakuman: !0 }] : [];
+    return t.length == 7 ? [] : t.every(
+      (n) => n instanceof C || n instanceof W || n instanceof Z || n instanceof R
+    ) ? [{ name: "四槓子", han: 13, isYakuman: !0 }] : [];
   }
   dH13(t) {
     if (t.length == 13) return [];
     if (t.length == 7) return [];
     const e = [1, 2, 3, 4];
-    return t.filter((r) => r.tiles.some((o) => o.t == f.Z && e.includes(o.n))).length == 4 ? t.find((r) => r instanceof D).tiles.some((r) => r.t == f.Z && e.includes(r.n)) ? [{ name: "小四喜", han: 13, isYakuman: !0 }] : [{ name: "大四喜", han: 13, isYakuman: !0 }] : [];
+    return t.filter((r) => {
+      const o = r.tiles[0];
+      return o.t == p.Z && e.includes(o.n);
+    }).length == 4 ? t.find((r) => r instanceof R).tiles.some((r) => r.t == p.Z && e.includes(r.n)) ? [{ name: "小四喜", han: 13, isYakuman: !0 }] : [{ name: "大四喜", han: 13, isYakuman: !0 }] : [];
   }
   dI13(t) {
-    const e = (n) => !!(n.equals(new y(f.Z, 6)) || n.t == f.S && [2, 3, 4, 6, 8].includes(n.n));
+    const e = (n) => !!(n.equals(new y(p.Z, 6)) || n.t == p.S && [2, 3, 4, 6, 8].includes(n.n));
     return t.every((n) => n.tiles.every((i) => e(i))) ? [{ name: "緑一色", han: 13, isYakuman: !0 }] : [];
   }
   // TODO 天和・地和
@@ -3966,41 +3966,41 @@ class un {
    * 手牌の構成から符を計算する
    */
   calcFu(t) {
-    let n = 20;
-    const i = this.cfg.myWind.n, r = this.cfg.roundWind.n;
     if (t.length == 7) return 25;
-    const o = t.find(
-      (p) => p.tiles.some((E) => E.has(m.TSUMO) || E.has(m.RON))
-    ), a = this.minus() == 1, c = o.tiles.some((p) => p.has(m.TSUMO)), l = (p, E) => {
-      const A = p.tiles[0];
-      return A.t == f.Z || V.includes(A.n) ? E * 2 : E;
+    const e = 20;
+    let n = e;
+    const i = this.cfg.myWind.n, r = this.cfg.roundWind.n, o = t.find(
+      (f) => f.tiles.some((E) => E.has(m.TSUMO) || E.has(m.RON))
+    ), a = this.minus() == 1, c = o.tiles.some((f) => f.has(m.TSUMO)), l = (f, E) => {
+      const A = f.tiles[0];
+      return A.t == p.Z || X.includes(A.n) ? E * 2 : E;
     };
-    for (const p of t)
+    for (const f of t)
       switch (!0) {
-        case p instanceof G:
-          const E = p.tiles.some((A) => A.has(m.RON)) ? 2 : 4;
-          n += l(p, E);
+        case f instanceof L:
+          const E = f.tiles.some((A) => A.has(m.RON)) ? 2 : 4;
+          n += l(f, E);
           break;
-        case p instanceof X:
-          n += l(p, 2);
+        case f instanceof U:
+          n += l(f, 2);
           break;
-        case (p instanceof q || p instanceof L):
-          n += l(p, 8);
+        case (f instanceof Z || f instanceof W):
+          n += l(f, 8);
           break;
-        case p instanceof x:
-          n += l(p, 16);
+        case f instanceof C:
+          n += l(f, 16);
           break;
       }
-    n += ((p) => {
-      if (p instanceof G) return 0;
-      if (p instanceof D) return 2;
-      const E = p.tiles, A = E.findIndex((N) => N.has(m.TSUMO) || N.has(m.RON));
+    n += ((f) => {
+      if (f instanceof L) return 0;
+      if (f instanceof R) return 2;
+      const E = f.tiles, A = E.findIndex((I) => I.has(m.TSUMO) || I.has(m.RON));
       return A == 1 || A == 0 && E[2].n == 9 || A == 2 && E[0].n == 1 ? 2 : 0;
     })(o);
-    const d = t.find((p) => p instanceof D).tiles[0];
-    d.t == f.Z && ([5, 6, 7].includes(d.n) && (n += 2), (d.n == r || d.n == i) && (n += 2));
+    const d = t.find((f) => f instanceof R).tiles[0];
+    d.t == p.Z && ([5, 6, 7].includes(d.n) && (n += 2), (d.n == r || d.n == i) && (n += 2));
     let g = !1;
-    return !a && n == 20 && (g = !0), c && !g && (n += 2), !c && !a && (n += 10), !c && !a && n == 30 && (g = !0), a && n == 20 && (n = 30), n;
+    return !a && n == e && (g = !0), c && !g && (n += 2), !c && !a && (n += 10), !c && !a && n == 30 && (g = !0), a && n == e && (n = 30), n;
   }
 }
 const Lt = (s) => s.tiles.reduce((t, e) => `${t}${e.n}${e.t}`, ""), dn = (s) => {
@@ -4016,7 +4016,7 @@ const Lt = (s) => s.tiles.reduce((t, e) => `${t}${e.n}${e.t}`, ""), dn = (s) =>
   return e;
 }, at = (s) => [...s.tiles].sort(fe)[0], fn = (s) => {
   const t = s.n, e = s.t;
-  if (e == f.Z) {
+  if (e == p.Z) {
     if (t == 4) return new y(e, 1);
     if (t == 7) return new y(e, 5);
   }
@@ -4028,9 +4028,9 @@ class Ft {
    * choices は、通常なら hand.hands を指定する。ただし、リーチしている場合は打牌が限られているので choices で制限する。
    */
   static calcEffectiveTiles(t, e, n) {
-    b(e.length > 0, "choices to discard is zero");
+    if (e.length == 0) throw new Error("choices to discard is zero");
     const i = /* @__PURE__ */ new Map();
-    let r = 1 / 0;
+    let r = Number.POSITIVE_INFINITY;
     for (const o of e) {
       const a = t.dec([o]), c = Ft.getEffectiveTiles(t, n);
       t.inc(a);
@@ -4052,9 +4052,9 @@ class Ft {
    * シャンテン数は有効牌を引いた場合の値となる。多くの場合、現在のシャンテン数 -1 となる。
    */
   static getEffectiveTiles(t, e) {
-    let n = 1 / 0, i = [];
+    let n = Number.POSITIVE_INFINITY, i = [];
     const r = new ge(t);
-    for (const [o, a] of U({
+    for (const [o, a] of F({
       skipBack: !0,
       filterBy: e?.typeFilter
     })) {
@@ -4174,7 +4174,7 @@ class oe {
 }
 class ae {
   playerToWind = {};
-  windToPlayer = P("");
+  windToPlayer = B("");
   round;
   sticks;
   constructor(t, e) {
@@ -4184,7 +4184,7 @@ class ae {
   }
   update() {
     for (let t in this.playerToWind) {
-      const e = We(this.playerToWind[t]);
+      const e = De(this.playerToWind[t]);
       this.playerToWind[t] = e, this.windToPlayer[e] = t;
     }
   }
@@ -4224,19 +4224,19 @@ function Fn(s) {
   }
   return s;
 }
-class Nr {
+class Ir {
   constructor(t = !1) {
     this.disable = t, this.c = this.initial();
   }
   c;
-  safeTileMap = P({}, !0);
+  safeTileMap = B({}, !0);
   get(t) {
-    return t.t == f.BACK ? 0 : this.c[t.t][t.n];
+    return t.t == p.BACK ? 0 : this.c[t.t][t.n];
   }
   dec(...t) {
     if (!this.disable) {
       for (let e of t)
-        if (e.t != f.BACK) {
+        if (e.t != p.BACK) {
           if (this.get(e) <= 0)
             throw new Error(
               `[counter] cannot decrease ${e.toString()} due to zero`
@@ -4259,14 +4259,14 @@ class Nr {
   }
   initial() {
     return {
-      [f.M]: [1, 4, 4, 4, 4, 4, 4, 4, 4, 4],
-      [f.S]: [1, 4, 4, 4, 4, 4, 4, 4, 4, 4],
-      [f.P]: [1, 4, 4, 4, 4, 4, 4, 4, 4, 4],
-      [f.Z]: [0, 4, 4, 4, 4, 4, 4, 4]
+      [p.M]: [1, 4, 4, 4, 4, 4, 4, 4, 4, 4],
+      [p.S]: [1, 4, 4, 4, 4, 4, 4, 4, 4, 4],
+      [p.P]: [1, 4, 4, 4, 4, 4, 4, 4, 4, 4],
+      [p.Z]: [0, 4, 4, 4, 4, 4, 4, 4]
     };
   }
 }
-class Zn {
+class Yn {
   m = [];
   constructor() {
   }
@@ -4295,7 +4295,7 @@ class Zn {
     return !0;
   }
 }
-function Tr() {
+function Nr() {
   if (typeof globalThis < "u")
     return globalThis;
   if (typeof self < "u")
@@ -4305,15 +4305,15 @@ function Tr() {
   if (typeof global < "u")
     return global;
 }
-function Ir() {
-  const s = Tr();
+function Tr() {
+  const s = Nr();
   if (s.__xstate__)
     return s.__xstate__;
 }
 const vr = (s) => {
   if (typeof window > "u")
     return;
-  const t = Ir();
+  const t = Tr();
   t && t.register(s);
 };
 class pn {
@@ -4345,7 +4345,7 @@ class pn {
     this._last = null;
   }
 }
-const Gn = ".", Sr = "", Yn = "", Or = "#", kr = "*", Vn = "xstate.init", Re = "xstate.stop";
+const Gn = ".", Sr = "", Zn = "", Or = "#", kr = "*", Vn = "xstate.init", Re = "xstate.stop";
 function Cr(s, t) {
   return {
     type: `xstate.after.${s}.${t}`
@@ -4377,7 +4377,7 @@ function Jn(s) {
     input: s
   };
 }
-function F(s) {
+function G(s) {
   setTimeout(() => {
     throw s;
   });
@@ -4456,7 +4456,7 @@ function Qn(s) {
 function Hr(s) {
   return s.type.startsWith("xstate.error.actor");
 }
-function Nt(s) {
+function It(s) {
   return qn(s).map((t) => typeof t > "u" || typeof t == "string" ? {
     target: t
   } : t);
@@ -4487,34 +4487,34 @@ function wn(s, t) {
   return `${s.sessionId}.${t}`;
 }
 let Pr = 0;
-function Dr(s, t) {
+function Br(s, t) {
   const e = /* @__PURE__ */ new Map(), n = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new WeakMap(), r = /* @__PURE__ */ new Set(), o = {}, {
     clock: a,
     logger: c
   } = t, l = {
-    schedule: (d, g, p, E, A = Math.random().toString(36).slice(2)) => {
-      const N = {
+    schedule: (d, g, f, E, A = Math.random().toString(36).slice(2)) => {
+      const I = {
         source: d,
         target: g,
-        event: p,
+        event: f,
         delay: E,
         id: A,
         startedAt: Date.now()
       }, v = wn(d, A);
-      h._snapshot._scheduledEvents[v] = N;
-      const R = a.setTimeout(() => {
-        delete o[v], delete h._snapshot._scheduledEvents[v], h._relay(d, g, p);
+      h._snapshot._scheduledEvents[v] = I;
+      const x = a.setTimeout(() => {
+        delete o[v], delete h._snapshot._scheduledEvents[v], h._relay(d, g, f);
       }, E);
-      o[v] = R;
+      o[v] = x;
     },
     cancel: (d, g) => {
-      const p = wn(d, g), E = o[p];
-      delete o[p], delete h._snapshot._scheduledEvents[p], E !== void 0 && a.clearTimeout(E);
+      const f = wn(d, g), E = o[f];
+      delete o[f], delete h._snapshot._scheduledEvents[f], E !== void 0 && a.clearTimeout(E);
     },
     cancelAll: (d) => {
       for (const g in h._snapshot._scheduledEvents) {
-        const p = h._snapshot._scheduledEvents[g];
-        p.source === d && l.cancel(d, p.id);
+        const f = h._snapshot._scheduledEvents[g];
+        f.source === d && l.cancel(d, f.id);
       }
     }
   }, u = (d) => {
@@ -4524,7 +4524,7 @@ function Dr(s, t) {
       ...d,
       rootId: s.sessionId
     };
-    r.forEach((p) => p.next?.(g));
+    r.forEach((f) => f.next?.(g));
   }, h = {
     _snapshot: {
       _scheduledEvents: (t?.snapshot && t.snapshot.scheduler) ?? {}
@@ -4539,8 +4539,8 @@ function Dr(s, t) {
     get: (d) => n.get(d),
     getAll: () => Object.fromEntries(n.entries()),
     _set: (d, g) => {
-      const p = n.get(d);
-      if (p && p !== g)
+      const f = n.get(d);
+      if (f && f !== g)
         throw new Error(`Actor with system ID '${d}' already exists.`);
       n.set(d, g), i.set(g, d);
     },
@@ -4553,13 +4553,13 @@ function Dr(s, t) {
       };
     },
     _sendInspectionEvent: u,
-    _relay: (d, g, p) => {
+    _relay: (d, g, f) => {
       h._sendInspectionEvent({
         type: "@xstate.event",
         sourceRef: d,
         actorRef: g,
-        event: p
-      }), g._send(p);
+        event: f
+      }), g._send(f);
     },
     scheduler: l,
     getSnapshot: () => ({
@@ -4572,13 +4572,13 @@ function Dr(s, t) {
       h._snapshot._scheduledEvents = {};
       for (const g in d) {
         const {
-          source: p,
+          source: f,
           target: E,
           event: A,
-          delay: N,
+          delay: I,
           id: v
         } = d[g];
-        l.schedule(p, E, A, N, v);
+        l.schedule(f, E, A, I, v);
       }
     },
     _clock: a,
@@ -4588,10 +4588,10 @@ function Dr(s, t) {
 }
 let _e = !1;
 const Fe = 1;
-let H = /* @__PURE__ */ (function(s) {
+let P = /* @__PURE__ */ (function(s) {
   return s[s.NotStarted = 0] = "NotStarted", s[s.Running = 1] = "Running", s[s.Stopped = 2] = "Stopped", s;
 })({});
-const Br = {
+const Wr = {
   clock: {
     setTimeout: (s, t) => setTimeout(s, t),
     clearTimeout: (s) => clearTimeout(s)
@@ -4599,7 +4599,7 @@ const Br = {
   logger: console.log.bind(console),
   devTools: !1
 };
-class Wr {
+class Dr {
   /**
    * Creates a new actor instance for the given logic with the provided options,
    * if any.
@@ -4608,9 +4608,9 @@ class Wr {
    * @param options Actor options
    */
   constructor(t, e) {
-    this.logic = t, this._snapshot = void 0, this.clock = void 0, this.options = void 0, this.id = void 0, this.mailbox = new pn(this._process.bind(this)), this.observers = /* @__PURE__ */ new Set(), this.eventListeners = /* @__PURE__ */ new Map(), this.logger = void 0, this._processingStatus = H.NotStarted, this._parent = void 0, this._syncSnapshot = void 0, this.ref = void 0, this._actorScope = void 0, this.systemId = void 0, this.sessionId = void 0, this.system = void 0, this._doneEvent = void 0, this.src = void 0, this._deferred = [];
+    this.logic = t, this._snapshot = void 0, this.clock = void 0, this.options = void 0, this.id = void 0, this.mailbox = new pn(this._process.bind(this)), this.observers = /* @__PURE__ */ new Set(), this.eventListeners = /* @__PURE__ */ new Map(), this.logger = void 0, this._processingStatus = P.NotStarted, this._parent = void 0, this._syncSnapshot = void 0, this.ref = void 0, this._actorScope = void 0, this.systemId = void 0, this.sessionId = void 0, this.system = void 0, this._doneEvent = void 0, this.src = void 0, this._deferred = [];
     const n = {
-      ...Br,
+      ...Wr,
       ...e
     }, {
       clock: i,
@@ -4621,7 +4621,7 @@ class Wr {
       systemId: l,
       inspect: u
     } = n;
-    this.system = o ? o.system : Dr(this, {
+    this.system = o ? o.system : Br(this, {
       clock: i,
       logger: r
     }), u && !o && this.system.inspect($e(u)), this.sessionId = this.system._bookId(), this.id = c ?? this.sessionId, this.logger = e?.logger ?? this.system._logger, this.clock = e?.clock ?? this.system._clock, this._parent = o, this._syncSnapshot = a, this.options = n, this.src = n.src ?? t, this.ref = this, this._actorScope = {
@@ -4642,12 +4642,12 @@ class Wr {
         const d = this.eventListeners.get(h.type), g = this.eventListeners.get("*");
         if (!d && !g)
           return;
-        const p = [...d ? d.values() : [], ...g ? g.values() : []];
-        for (const E of p)
+        const f = [...d ? d.values() : [], ...g ? g.values() : []];
+        for (const E of f)
           try {
             E(h);
           } catch (A) {
-            F(A);
+            G(A);
           }
       },
       actionExecutor: (h) => {
@@ -4668,7 +4668,7 @@ class Wr {
             _e = g;
           }
         };
-        this._processingStatus === H.Running ? d() : this._deferred.push(d);
+        this._processingStatus === P.Running ? d() : this._deferred.push(d);
       }
     }, this.send = this.send.bind(this), this.system._sendInspectionEvent({
       type: "@xstate.actor",
@@ -4705,7 +4705,7 @@ class Wr {
           try {
             i.next?.(t);
           } catch (r) {
-            F(r);
+            G(r);
           }
         break;
       case "done":
@@ -4713,7 +4713,7 @@ class Wr {
           try {
             i.next?.(t);
           } catch (r) {
-            F(r);
+            G(r);
           }
         this._stopProcedure(), this._complete(), this._doneEvent = Rr(this.id, this._snapshot.output), this._parent && this.system._relay(this, this._parent, this._doneEvent);
         break;
@@ -4789,7 +4789,7 @@ class Wr {
    */
   subscribe(t, e, n) {
     const i = $e(t, e, n);
-    if (this._processingStatus !== H.Stopped)
+    if (this._processingStatus !== P.Stopped)
       this.observers.add(i);
     else
       switch (this._snapshot.status) {
@@ -4797,18 +4797,18 @@ class Wr {
           try {
             i.complete?.();
           } catch (r) {
-            F(r);
+            G(r);
           }
           break;
         case "error": {
           const r = this._snapshot.error;
           if (!i.error)
-            F(r);
+            G(r);
           else
             try {
               i.error(r);
             } catch (o) {
-              F(o);
+              G(o);
             }
           break;
         }
@@ -4831,7 +4831,7 @@ class Wr {
   }
   /** Starts the Actor from the initial state */
   start() {
-    if (this._processingStatus === H.Running)
+    if (this._processingStatus === P.Running)
       return this;
     this._syncSnapshot && this.subscribe({
       next: (n) => {
@@ -4842,7 +4842,7 @@ class Wr {
       },
       error: () => {
       }
-    }), this.system._register(this.sessionId, this), this.systemId && this.system._set(this.systemId, this), this._processingStatus = H.Running;
+    }), this.system._register(this.sessionId, this), this.systemId && this.system._set(this.systemId, this), this._processingStatus = P.Running;
     const t = Jn(this.options.input);
     switch (this.system._sendInspectionEvent({
       type: "@xstate.event",
@@ -4890,7 +4890,7 @@ class Wr {
     this.update(e, t), t.type === Re && (this._stopProcedure(), this._complete());
   }
   _stop() {
-    return this._processingStatus === H.Stopped ? this : (this.mailbox.clear(), this._processingStatus === H.NotStarted ? (this._processingStatus = H.Stopped, this) : (this.mailbox.enqueue({
+    return this._processingStatus === P.Stopped ? this : (this.mailbox.clear(), this._processingStatus === P.NotStarted ? (this._processingStatus = P.Stopped, this) : (this.mailbox.enqueue({
       type: Re
     }), this));
   }
@@ -4905,13 +4905,13 @@ class Wr {
       try {
         t.complete?.();
       } catch (e) {
-        F(e);
+        G(e);
       }
     this.observers.clear();
   }
   _reportError(t) {
     if (!this.observers.size) {
-      this._parent || F(t);
+      this._parent || G(t);
       return;
     }
     let e = !1;
@@ -4921,10 +4921,10 @@ class Wr {
       try {
         i?.(t);
       } catch (r) {
-        F(r);
+        G(r);
       }
     }
-    this.observers.clear(), e && F(t);
+    this.observers.clear(), e && G(t);
   }
   _error(t) {
     this._stopProcedure(), this._reportError(t), this._parent && this.system._relay(this, this._parent, Mr(this.id, t));
@@ -4935,11 +4935,11 @@ class Wr {
   // right now, they are being stopped within the machine's transition
   // but that could throw and leave us with "orphaned" active actors
   _stopProcedure() {
-    return this._processingStatus !== H.Running ? this : (this.system.scheduler.cancelAll(this), this.mailbox.clear(), this.mailbox = new pn(this._process.bind(this)), this._processingStatus = H.Stopped, this.system._unregister(this), this);
+    return this._processingStatus !== P.Running ? this : (this.system.scheduler.cancelAll(this), this.mailbox.clear(), this.mailbox = new pn(this._process.bind(this)), this._processingStatus = P.Stopped, this.system._unregister(this), this);
   }
   /** @internal */
   _send(t) {
-    this._processingStatus !== H.Stopped && this.mailbox.enqueue(t);
+    this._processingStatus !== P.Stopped && this.mailbox.enqueue(t);
   }
   /**
    * Sends an event to the running Actor to trigger a transition.
@@ -4999,7 +4999,7 @@ class Wr {
   }
 }
 function Rt(s, ...[t]) {
-  return new Wr(s, t);
+  return new Dr(s, t);
 }
 function Kr(s, t, e, n, {
   sendId: i
@@ -5056,7 +5056,7 @@ function jr(s, {
   actorRef: t
 }) {
   t && s.defer(() => {
-    t._processingStatus !== H.Stopped && t.start();
+    t._processingStatus !== P.Stopped && t.start();
   });
 }
 function Fr(...[s, {
@@ -5069,7 +5069,7 @@ function Fr(...[s, {
   }
   return r.type = "xstate.spawnChild", r.id = t, r.systemId = e, r.src = s, r.input = n, r.syncSnapshot = i, r.resolve = Ur, r.execute = jr, r;
 }
-function Zr(s, t, e, n, {
+function Yr(s, t, e, n, {
   actorRef: i
 }) {
   const r = typeof i == "function" ? i(e, n) : i, o = typeof r == "string" ? t.children[r] : r;
@@ -5082,7 +5082,7 @@ function Zr(s, t, e, n, {
 }
 function Gr(s, t) {
   if (t) {
-    if (s.system._unregister(t), t._processingStatus !== H.Running) {
+    if (s.system._unregister(t), t._processingStatus !== P.Running) {
       s.stopChild(t);
       return;
     }
@@ -5094,16 +5094,16 @@ function Gr(s, t) {
 function es(s) {
   function t(e, n) {
   }
-  return t.type = "xstate.stopChild", t.actorRef = s, t.resolve = Zr, t.execute = Gr, t;
+  return t.type = "xstate.stopChild", t.actorRef = s, t.resolve = Yr, t.execute = Gr, t;
 }
-function Ze(s, t, e, n) {
+function Ye(s, t, e, n) {
   const {
     machine: i
   } = n, r = typeof s == "function", o = r ? s : i.implementations.guards[typeof s == "string" ? s : s.type];
   if (!r && !o)
     throw new Error(`Guard '${typeof s == "string" ? s : s.type}' is not implemented.'.`);
   if (typeof o != "function")
-    return Ze(o, t, e, n);
+    return Ye(o, t, e, n);
   const a = {
     context: t,
     event: e
@@ -5122,7 +5122,7 @@ const Ge = (s) => s.type === "atomic" || s.type === "final";
 function Mt(s) {
   return Object.values(s.states).filter((t) => t.type !== "history");
 }
-function Zt(s, t) {
+function Yt(s, t) {
   const e = [];
   if (t === s)
     return e;
@@ -5178,11 +5178,11 @@ function is(s, t) {
   const e = ce(t);
   return ns(s, ss(e));
 }
-function Ye(s, t) {
-  return t.type === "compound" ? Mt(t).some((e) => e.type === "final" && s.has(e)) : t.type === "parallel" ? Mt(t).every((e) => Ye(s, e)) : t.type === "final";
+function Ze(s, t) {
+  return t.type === "compound" ? Mt(t).some((e) => e.type === "final" && s.has(e)) : t.type === "parallel" ? Mt(t).every((e) => Ze(s, e)) : t.type === "final";
 }
 const me = (s) => s[0] === Or;
-function Yr(s, t) {
+function Zr(s, t) {
   return s.transitions.get(t) || [...s.transitions.keys()].filter((n) => {
     if (n === kr)
       return !0;
@@ -5205,7 +5205,7 @@ function Vr(s) {
     return [];
   const e = (i) => {
     const r = Cr(i, s.id), o = r.type;
-    return s.entry.push(To(r, {
+    return s.entry.push(No(r, {
       id: o,
       delay: i
     })), s.exit.push(zr(o)), o;
@@ -5250,27 +5250,27 @@ function Jr(s) {
   const t = /* @__PURE__ */ new Map();
   if (s.config.on)
     for (const e of Object.keys(s.config.on)) {
-      if (e === Yn)
+      if (e === Zn)
         throw new Error('Null events ("") cannot be specified as a transition key. Use `always: { ... }` instead.');
       const n = s.config.on[e];
-      t.set(e, Nt(n).map((i) => ht(s, e, i)));
+      t.set(e, It(n).map((i) => ht(s, e, i)));
     }
   if (s.config.onDone) {
     const e = `xstate.done.state.${s.id}`;
-    t.set(e, Nt(s.config.onDone).map((n) => ht(s, e, n)));
+    t.set(e, It(s.config.onDone).map((n) => ht(s, e, n)));
   }
   for (const e of s.invoke) {
     if (e.onDone) {
       const n = `xstate.done.actor.${e.id}`;
-      t.set(n, Nt(e.onDone).map((i) => ht(s, n, i)));
+      t.set(n, It(e.onDone).map((i) => ht(s, n, i)));
     }
     if (e.onError) {
       const n = `xstate.error.actor.${e.id}`;
-      t.set(n, Nt(e.onError).map((i) => ht(s, n, i)));
+      t.set(n, It(e.onError).map((i) => ht(s, n, i)));
     }
     if (e.onSnapshot) {
       const n = `xstate.snapshot.${e.id}`;
-      t.set(n, Nt(e.onSnapshot).map((i) => ht(s, n, i)));
+      t.set(n, It(e.onSnapshot).map((i) => ht(s, n, i)));
     }
   }
   for (const e of s.after) {
@@ -5334,7 +5334,7 @@ function pt(s) {
 function En(s) {
   const t = os(s);
   for (const e of t)
-    for (const n of Zt(e, s))
+    for (const n of Yt(e, s))
       t.add(n);
   return t;
 }
@@ -5457,7 +5457,7 @@ function as(s, t, e) {
 }
 function io(s) {
   const [t, ...e] = s;
-  for (const n of Zt(t, void 0))
+  for (const n of Yt(t, void 0))
     if (e.every((i) => nt(i, n)))
       return n;
 }
@@ -5538,23 +5538,23 @@ function ao(s, t, e, n, i, r, o, a) {
   const l = /* @__PURE__ */ new Set(), u = /* @__PURE__ */ new Set();
   co(n, o, u, l), a && u.add(s.machine.root);
   const h = /* @__PURE__ */ new Set();
-  for (const d of [...l].sort((g, p) => g.order - p.order)) {
+  for (const d of [...l].sort((g, f) => g.order - f.order)) {
     i.add(d);
     const g = [];
     g.push(...d.entry);
-    for (const p of d.invoke)
-      g.push(Fr(p.src, {
-        ...p,
-        syncSnapshot: !!p.onSnapshot
+    for (const f of d.invoke)
+      g.push(Fr(f.src, {
+        ...f,
+        syncSnapshot: !!f.onSnapshot
       }));
     if (u.has(d)) {
-      const p = d.initial.actions;
-      g.push(...p);
+      const f = d.initial.actions;
+      g.push(...f);
     }
-    if (c = $t(c, t, e, g, r, d.invoke.map((p) => p.id)), d.type === "final") {
-      const p = d.parent;
-      let E = p?.type === "parallel" ? p : p?.parent, A = E || d;
-      for (p?.type === "compound" && r.push(Me(p.id, d.output !== void 0 ? xe(d.output, c.context, t, e.self) : void 0)); E?.type === "parallel" && !h.has(E) && Ye(i, E); )
+    if (c = $t(c, t, e, g, r, d.invoke.map((f) => f.id)), d.type === "final") {
+      const f = d.parent;
+      let E = f?.type === "parallel" ? f : f?.parent, A = E || d;
+      for (f?.type === "compound" && r.push(Me(f.id, d.output !== void 0 ? xe(d.output, c.context, t, e.self) : void 0)); E?.type === "parallel" && !h.has(E) && Ze(i, E); )
         h.add(E), r.push(Me(E.id)), A = E, E = E.parent;
       if (E)
         continue;
@@ -5574,44 +5574,44 @@ function co(s, t, e, n) {
       (i.source !== a || // we know that the domain can't lie within the source
       // if it's different than the source then it's outside of it and it means that the target has to be entered as well
       i.source !== r || // reentering transitions always enter the target, even if it's the source itself
-      i.reenter) && (n.add(a), e.add(a)), Tt(a, t, e, n);
+      i.reenter) && (n.add(a), e.add(a)), Nt(a, t, e, n);
     const o = Je(i, t);
     for (const a of o) {
-      const c = Zt(a, r);
+      const c = Yt(a, r);
       r?.type === "parallel" && c.push(r), ls(n, t, e, c, !i.source.parent && i.reenter ? void 0 : r);
     }
   }
 }
-function Tt(s, t, e, n) {
+function Nt(s, t, e, n) {
   if (pt(s))
     if (t[s.id]) {
       const i = t[s.id];
       for (const r of i)
-        n.add(r), Tt(r, t, e, n);
+        n.add(r), Nt(r, t, e, n);
       for (const r of i)
         Ae(r, s.parent, n, t, e);
     } else {
       const i = rs(s);
       for (const r of i.target)
-        n.add(r), i === s.parent?.initial && e.add(s.parent), Tt(r, t, e, n);
+        n.add(r), i === s.parent?.initial && e.add(s.parent), Nt(r, t, e, n);
       for (const r of i.target)
         Ae(r, s.parent, n, t, e);
     }
   else if (s.type === "compound") {
     const [i] = s.initial.target;
-    pt(i) || (n.add(i), e.add(i)), Tt(i, t, e, n), Ae(i, s, n, t, e);
+    pt(i) || (n.add(i), e.add(i)), Nt(i, t, e, n), Ae(i, s, n, t, e);
   } else if (s.type === "parallel")
     for (const i of Mt(s).filter((r) => !pt(r)))
-      [...n].some((r) => nt(r, i)) || (pt(i) || (n.add(i), e.add(i)), Tt(i, t, e, n));
+      [...n].some((r) => nt(r, i)) || (pt(i) || (n.add(i), e.add(i)), Nt(i, t, e, n));
 }
 function ls(s, t, e, n, i) {
   for (const r of n)
     if ((!i || nt(r, i)) && s.add(r), r.type === "parallel")
       for (const o of Mt(r).filter((a) => !pt(a)))
-        [...s].some((a) => nt(a, o)) || (s.add(o), Tt(o, t, e, s));
+        [...s].some((a) => nt(a, o)) || (s.add(o), Nt(o, t, e, s));
 }
 function Ae(s, t, e, n, i) {
-  ls(e, n, i, Zt(s, t));
+  ls(e, n, i, Yt(s, t));
 }
 function lo(s, t, e, n, i, r, o, a) {
   let c = s;
@@ -5621,7 +5621,7 @@ function lo(s, t, e, n, i, r, o, a) {
   for (const h of l)
     for (const d of no(h)) {
       let g;
-      d.history === "deep" ? g = (p) => Ge(p) && nt(p, h) : g = (p) => p.parent === h, u ??= {
+      d.history === "deep" ? g = (f) => Ge(f) && nt(f, h) : g = (f) => f.parent === h, u ??= {
         ...r
       }, u[d.id] = Array.from(i).filter(g);
     }
@@ -5661,7 +5661,7 @@ function hs(s, t, e, n, i, r) {
       });
       continue;
     }
-    const g = u, [p, E, A] = g.resolve(
+    const g = u, [f, E, A] = g.resolve(
       e,
       a,
       h,
@@ -5670,7 +5670,7 @@ function hs(s, t, e, n, i, r) {
       // this holds all params
       i
     );
-    a = p, "retryResolve" in g && r?.push([g, E]), "execute" in g && e.actionExecutor({
+    a = f, "retryResolve" in g && r?.push([g, E]), "execute" in g && e.actionExecutor({
       type: g.type,
       info: h,
       params: E,
@@ -5753,10 +5753,10 @@ function An(s, t) {
 function uo(s, t) {
   const e = /* @__PURE__ */ new Set(), n = s._nodes.filter(Ge);
   for (const i of n)
-    t: for (const r of [i].concat(Zt(i, void 0)))
+    t: for (const r of [i].concat(Yt(i, void 0)))
       if (r.always) {
         for (const o of r.always)
-          if (o.guard === void 0 || Ze(o.guard, s.context, t, s)) {
+          if (o.guard === void 0 || Ye(o.guard, s.context, t, s)) {
             e.add(o);
             break t;
           }
@@ -5911,7 +5911,7 @@ function bo(s, t, e, n, {
     delay: u
   }, void 0];
 }
-function No(s, t) {
+function Io(s, t) {
   const {
     event: e,
     delay: n,
@@ -5925,12 +5925,12 @@ function No(s, t) {
     return;
   }
 }
-function To(s, t) {
+function No(s, t) {
   function e(n, i) {
   }
-  return e.type = "xstate.raise", e.event = s, e.id = t?.id, e.delay = t?.delay, e.resolve = bo, e.execute = No, e;
+  return e.type = "xstate.raise", e.event = s, e.id = t?.id, e.delay = t?.delay, e.resolve = bo, e.execute = Io, e;
 }
-function Io(s, {
+function To(s, {
   machine: t,
   context: e
 }, n, i) {
@@ -5965,7 +5965,7 @@ function Io(s, {
   return (o, a) => {
     const c = r(o, a);
     return i[c.id] = c, s.defer(() => {
-      c._processingStatus !== H.Stopped && c.start();
+      c._processingStatus !== P.Stopped && c.start();
     }), c;
   };
 }
@@ -5977,7 +5977,7 @@ function vo(s, t, e, n, {
   const r = {}, o = {
     context: t.context,
     event: e.event,
-    spawn: Io(s, t, e.event, r),
+    spawn: To(s, t, e.event, r),
     self: s.self,
     system: s.system
   };
@@ -6010,7 +6010,7 @@ function bt(s, t, e) {
     [t]: e()
   }, bn.set(s, n)), n[t];
 }
-const Oo = {}, Wt = (s) => typeof s == "string" ? {
+const Oo = {}, Dt = (s) => typeof s == "string" ? {
   type: s
 } : typeof s == "function" ? "resolve" in s ? {
   type: s.type
@@ -6029,7 +6029,7 @@ class ue {
   }
   /** @internal */
   _initialize() {
-    this.transitions = Jr(this), this.config.always && (this.always = Nt(this.config.always).map((t) => ht(this, Yn, t))), Object.keys(this.states).forEach((t) => {
+    this.transitions = Jr(this), this.config.always && (this.always = It(this.config.always).map((t) => ht(this, Zn, t))), Object.keys(this.states).forEach((t) => {
       this.states[t]._initialize();
     });
   }
@@ -6043,13 +6043,13 @@ class ue {
       initial: this.initial ? {
         target: this.initial.target,
         source: this,
-        actions: this.initial.actions.map(Wt),
+        actions: this.initial.actions.map(Dt),
         eventType: null,
         reenter: !1,
         toJSON: () => ({
           target: this.initial.target.map((t) => `#${t.id}`),
           source: `#${this.id}`,
-          actions: this.initial.actions.map(Wt),
+          actions: this.initial.actions.map(Dt),
           eventType: null
         })
       } : void 0,
@@ -6058,10 +6058,10 @@ class ue {
       on: this.on,
       transitions: [...this.transitions.values()].flat().map((t) => ({
         ...t,
-        actions: t.actions.map(Wt)
+        actions: t.actions.map(Dt)
       })),
-      entry: this.entry.map(Wt),
-      exit: this.exit.map(Wt),
+      entry: this.entry.map(Dt),
+      exit: this.exit.map(Dt),
       meta: this.meta,
       order: this.order || -1,
       output: this.output,
@@ -6116,14 +6116,14 @@ class ue {
   next(t, e) {
     const n = e.type, i = [];
     let r;
-    const o = bt(this, `candidates-${n}`, () => Yr(this, n));
+    const o = bt(this, `candidates-${n}`, () => Zr(this, n));
     for (const a of o) {
       const {
         guard: c
       } = a, l = t.context;
       let u = !1;
       try {
-        u = !c || Ze(c, l, e, t);
+        u = !c || Ye(c, l, e, t);
       } catch (h) {
         const d = typeof c == "string" ? c : typeof c == "object" ? c.type : void 0;
         throw new Error(`Unable to evaluate guard ${d ? `'${d}' ` : ""}in transition for event '${n}' in state node '${this.id}':
@@ -6214,7 +6214,7 @@ class Xe {
       _nodes: [...n],
       context: t.context || {},
       children: {},
-      status: Ye(n, this.root) ? "done" : t.status || "active",
+      status: Ze(n, this.root) ? "done" : t.status || "active",
       output: t.output,
       error: t.error,
       historyValue: t.historyValue
@@ -6307,7 +6307,7 @@ class Xe {
   restoreSnapshot(t, e) {
     const n = {}, i = t.children;
     Object.keys(i).forEach((h) => {
-      const d = i[h], g = d.snapshot, p = d.src, E = typeof p == "string" ? je(this, p) : p;
+      const d = i[h], g = d.snapshot, f = d.src, E = typeof f == "string" ? je(this, f) : f;
       if (!E)
         return;
       const A = Rt(E, {
@@ -6315,7 +6315,7 @@ class Xe {
         parent: e.self,
         syncSnapshot: d.syncSnapshot,
         snapshot: g,
-        src: p,
+        src: f,
         systemId: d.systemId
       });
       n[h] = A;
@@ -6332,11 +6332,11 @@ class Xe {
       if (!d || typeof d != "object")
         return {};
       const g = {};
-      for (const p in d) {
-        const E = d[p];
+      for (const f in d) {
+        const E = d[f];
         for (const A of E) {
-          const N = r(h, A);
-          N && (g[p] ??= [], g[p].push(N));
+          const I = r(h, A);
+          I && (g[f] ??= [], g[f].push(I));
         }
       }
       return g;
@@ -6351,13 +6351,13 @@ class Xe {
       if (!l.has(h)) {
         l.add(h);
         for (const g in h) {
-          const p = h[g];
-          if (p && typeof p == "object") {
-            if ("xstate$$type" in p && p.xstate$$type === Fe) {
-              h[g] = d[p.id];
+          const f = h[g];
+          if (f && typeof f == "object") {
+            if ("xstate$$type" in f && f.xstate$$type === Fe) {
+              h[g] = d[f.id];
               continue;
             }
-            u(p, d);
+            u(f, d);
           }
         }
       }
@@ -6372,14 +6372,14 @@ const Xt = (s) => s === !1 ? !1 : s.map((t) => t.serialize()), Ro = (s) => s ===
   tile: t.tile.toString(),
   effectiveTiles: t.effectiveTiles.map((e) => e.toString()),
   shanten: t.shanten
-})), qt = (s) => s === !1 ? !1 : ke(s), Nn = (s) => Co(
+})), qt = (s) => s === !1 ? !1 : ke(s), In = (s) => Co(
   {
     id: "Untitled",
     initial: "distribute",
     context: {
       currentWind: _.E,
-      oneShotMap: P(!1),
-      missingMap: P(!1),
+      oneShotMap: B(!1),
+      missingMap: B(!1),
       controller: s,
       genEventID: xo()
     },
@@ -6693,12 +6693,12 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
     actions: {
       updateNextWind: ({ context: t, event: e }) => {
         const n = t.currentWind;
-        t.currentWind = It(n);
+        t.currentWind = Tt(n);
       },
       notify_distribution: ({ context: t, event: e }) => {
         const n = t.genEventID(), i = t.controller.initialHands();
         for (const r of Object.values(_)) {
-          const o = P("_____________");
+          const o = B("_____________");
           o[r] = i[r].toString();
           const a = {
             id: n,
@@ -6776,7 +6776,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         const i = t.genEventID(), r = t.currentWind;
         let o = t.controller.doDiscard(r);
         const a = t.controller.hand(t.currentWind).called.at(-1);
-        (a instanceof J || a instanceof X) && (o = t.controller.doDiscard(r, a));
+        (a instanceof q || a instanceof U) && (o = t.controller.doDiscard(r, a));
         const c = {
           id: i,
           type: "CHOICE_AFTER_CALLED",
@@ -6879,7 +6879,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         const a = t.currentWind;
         t.controller.hand(a).reached || (t.missingMap[a] = !1);
         for (const c of Object.values(_)) {
-          let l = new y(f.BACK, 0, [m.TSUMO]);
+          let l = new y(p.BACK, 0, [m.TSUMO]);
           c == a && (l = o);
           const u = {
             id: i,
@@ -6981,7 +6981,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.oneShotMap[t.currentWind] = !1;
       },
       notify_end: ({ context: t, event: e }) => {
-        const n = t.genEventID(), i = P("");
+        const n = t.genEventID(), i = B("");
         if (e.type == "DRAWN_GAME_BY_NINE_ORPHANS") {
           i[e.iam] = t.controller.hand(e.iam).toString();
           for (const r of Object.values(_)) {
@@ -6993,7 +6993,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
               shouldContinue: !0,
               sticks: t.controller.placeManager.sticks,
               scores: t.controller.scoreManager.summary,
-              deltas: P(0),
+              deltas: B(0),
               hands: i
             };
             t.controller.emit(o);
@@ -7029,8 +7029,8 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
               shouldContinue: !0,
               sticks: t.controller.placeManager.sticks,
               scores: t.controller.scoreManager.summary,
-              deltas: P(0),
-              hands: P("")
+              deltas: B(0),
+              hands: B("")
             };
             t.controller.emit(a);
           }
@@ -7043,7 +7043,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
               const u = t.controller.hand(l);
               new ge(u).calc() == 0 && (r.push(l), i[l] = u.toString());
             }
-            const o = r.length == 0 || r.length == 4, a = P(0);
+            const o = r.length == 0 || r.length == 4, a = B(0);
             for (const l of Object.values(_))
               r.includes(l) ? a[l] += o ? 0 : 3e3 / r.length : a[l] -= o ? 0 : 3e3 / (4 - r.length);
             const c = r.length == 4 || a[_.E] > 0;
@@ -7129,7 +7129,7 @@ class St {
     return this.walls.drawable.length > 0;
   }
   initialHands() {
-    const t = P("");
+    const t = B("");
     for (let e = 0; e < 3; e++)
       for (const n of Object.values(_))
         for (let i = 0; i < 4; i++)
@@ -7142,13 +7142,13 @@ class St {
       this.walls = St.clone(t);
       return;
     } else {
-      for (let e of Object.values(f)) {
-        if (e == f.BACK) continue;
-        const n = e == f.Z ? [1, 2, 3, 4, 5, 6, 7] : [1, 2, 3, 4, 5, 6, 7, 8, 9];
+      for (let e of Object.values(p)) {
+        if (e == p.BACK) continue;
+        const n = e == p.Z ? [1, 2, 3, 4, 5, 6, 7] : [1, 2, 3, 4, 5, 6, 7, 8, 9];
         for (let i = 0; i < 4; i++)
           for (let r of n) {
             let o = new y(e, r);
-            e != f.Z && i == 3 && r == 5 && (o = o.clone({ add: m.RED })), this.walls.drawable.push(o.toString());
+            e != p.Z && i == 3 && r == 5 && (o = o.clone({ add: m.RED })), this.walls.drawable.push(o.toString());
           }
       }
       Fn(this.walls.drawable);
@@ -7178,7 +7178,7 @@ class St {
 class ye {
   wall = new St();
   playerIDs;
-  actor = Rt(Nn(this), {});
+  actor = Rt(In(this), {});
   observer;
   handlers = {};
   mailBox = {};
@@ -7283,7 +7283,7 @@ class ye {
           b(o.choices.DAI_KAN, "daikan choice is none"), this.actor.send({
             type: r.type,
             iam: o.wind,
-            block: q.from(o.choices.DAI_KAN.tiles)
+            block: Z.from(o.choices.DAI_KAN.tiles)
           });
           break;
         case "CHI":
@@ -7293,7 +7293,7 @@ class ye {
             r.events.length == 1,
             `found more than one selected: ${JSON.stringify(r, null, 2)}`
           );
-          const c = X.deserialize(a[0]);
+          const c = U.deserialize(a[0]);
           this.actor.send({
             type: r.type,
             iam: o.wind,
@@ -7336,7 +7336,7 @@ class ye {
           const u = o.choices[r.type];
           b(u, `${r.type} choice is none`), this.actor.send({
             type: r.type,
-            block: x.from(u[0].tiles),
+            block: C.from(u[0].tiles),
             iam: a
           });
           break;
@@ -7345,7 +7345,7 @@ class ye {
           const u = o.choices[r.type];
           b(u, `${r.type} choice is none`), this.actor.send({
             type: r.type,
-            block: L.from(u[0].tiles),
+            block: W.from(u[0].tiles),
             iam: a
           });
           break;
@@ -7444,7 +7444,7 @@ class ye {
       );
   }
   startGame() {
-    for (; console.debug(`start========${this.placeManager.round}=============`), this.start(), this.wall = new St(), this.observer.applied = {}, this.mailBox = {}, this.actor = Rt(Nn(this)), !this.placeManager.is(O.W1); )
+    for (; console.debug(`start========${this.placeManager.round}=============`), this.start(), this.wall = new St(), this.observer.applied = {}, this.mailBox = {}, this.actor = Rt(In(this)), !this.placeManager.is(O.W1); )
       ;
   }
   finalResult(t, e) {
@@ -7479,7 +7479,7 @@ class ye {
     if (n == null || t == e) return !1;
     const i = this.hand(t);
     if (i.reached || i.hands.length < 3 || i.get(n.t, n.n) < 2) return !1;
-    const r = n.clone({ removeAll: !0 }), o = nn(t, e, w.PON), a = [], c = new X([r, r, r]).clone({
+    const r = n.clone({ removeAll: !0 }), o = nn(t, e, w.PON), a = [], c = new U([r, r, r]).clone({
       replace: { idx: o, tile: n.clone({ add: m.HORIZONTAL }) }
     });
     let l = c;
@@ -7503,7 +7503,7 @@ class ye {
     return a;
   }
   doChi(t, e, n) {
-    if (n == null || !n.isNum() || It(e) != t) return !1;
+    if (n == null || !n.isNum() || Tt(e) != t) return !1;
     const i = this.hand(t);
     if (i.reached || i.hands.length < 3) return !1;
     const r = n.clone({
@@ -7511,32 +7511,32 @@ class ye {
       add: [m.HORIZONTAL]
     }), o = [];
     r.n - 2 >= 1 && i.get(n.t, r.n - 2) > 0 && i.get(n.t, r.n - 1) > 0 && o.push(
-      new J([
+      new q([
         r,
         new y(n.t, r.n - 1),
         new y(n.t, r.n - 2)
       ])
     ), r.n + 2 <= 9 && i.get(n.t, r.n + 1) > 0 && i.get(n.t, r.n + 2) > 0 && o.push(
-      new J([
+      new q([
         r,
         new y(n.t, r.n + 1),
         new y(n.t, r.n + 2)
       ])
     ), r.n - 1 >= 1 && r.n + 1 <= 9 && i.get(n.t, r.n - 1) > 0 && i.get(n.t, r.n + 1) > 0 && o.push(
-      new J([
+      new q([
         r,
         new y(n.t, r.n - 1),
         new y(n.t, r.n + 1)
       ])
     );
     for (let d = 0; d < o.length; d++) {
-      const g = o[d], p = this.cannotDiscardTile(g), E = [];
-      for (const v of p) {
-        const R = i.get(v.t, v.n);
-        for (let Et = 0; Et < R; Et++) E.push(v.clone({ remove: m.RED }));
+      const g = o[d], f = this.cannotDiscardTile(g), E = [];
+      for (const v of f) {
+        const x = i.get(v.t, v.n);
+        for (let Et = 0; Et < x; Et++) E.push(v.clone({ remove: m.RED }));
       }
-      const A = i.dec([...E, g.tiles[1], g.tiles[2]]), N = i.hands.length == 0;
-      i.inc(A), N && o.splice(d, 1);
+      const A = i.dec([...E, g.tiles[1], g.tiles[2]]), I = i.hands.length == 0;
+      i.inc(A), I && o.splice(d, 1);
     }
     if (o.length == 0) return !1;
     const h = i.get(n.t, 0) > 0 ? this.redPattern(o) : [];
@@ -7563,7 +7563,7 @@ class ye {
     if (this.hand(t).reached) return [this.hand(t).drawn];
     const n = this.hand(t).hands;
     if (e == null) return n;
-    if (e instanceof X)
+    if (e instanceof U)
       return n.filter((o) => !o.equals(e.tiles[0]));
     const i = this.cannotDiscardTile(e), r = n.filter((o) => !i.some((a) => o.equals(a)));
     return b(
@@ -7580,10 +7580,10 @@ class ye {
   doAnKan(t) {
     const e = this.hand(t), n = [];
     if (e.reached) return !1;
-    for (const [i, r] of U())
+    for (const [i, r] of F())
       if (e.get(i, r) == 4) {
         const o = new y(i, r), a = [o, o, o, o];
-        k(o) && (a[1] = o.clone({ add: m.RED })), n.push(new x(a));
+        k(o) && (a[1] = o.clone({ add: m.RED })), n.push(new C(a));
       }
     if (n.length == 0) return !1;
     for (const i of n)
@@ -7596,7 +7596,7 @@ class ye {
   doShoKan(t) {
     const e = this.hand(t);
     if (e.reached) return !1;
-    const n = e.called.filter((r) => r instanceof X);
+    const n = e.called.filter((r) => r instanceof U);
     if (n.length == 0) return !1;
     const i = [];
     for (const r of n) {
@@ -7606,7 +7606,7 @@ class ye {
       });
       if (e.get(o.t, o.n) == 1) {
         const a = k(o) && e.get(o.t, 0) > 0 ? o.clone({ add: m.RED }) : o;
-        i.push(new L([...r.tiles, a]));
+        i.push(new W([...r.tiles, a]));
       }
     }
     if (i.length == 0) return !1;
@@ -7623,7 +7623,7 @@ class ye {
     const r = n.clone({ removeAll: !0 });
     if (i.get(r.t, r.n) != 3) return !1;
     const o = nn(t, e, w.DAI_KAN);
-    let a = new q([r, r, r, r]).clone({
+    let a = new Z([r, r, r, r]).clone({
       replace: { idx: o, tile: r.clone({ add: m.HORIZONTAL }) }
     });
     if (k(n) && n.has(m.RED))
@@ -7652,9 +7652,9 @@ class ye {
     if (this.river.discards(t).length != 0) return !1;
     const e = this.hand(t);
     let n = 0;
-    for (const i of Object.values(f)) {
-      if (i == f.BACK) continue;
-      const r = i == f.Z ? jt : V;
+    for (const i of Object.values(p)) {
+      if (i == p.BACK) continue;
+      const r = i == p.Z ? jt : X;
       for (const o of r)
         e.get(i, o) > 0 && n++;
     }
@@ -7666,29 +7666,29 @@ class ye {
 }
 class Ht extends ze {
   isBackHand() {
-    for (const t of Object.values(f))
-      if (t != f.BACK && this.sum(t) > 0)
+    for (const t of Object.values(p))
+      if (t != p.BACK && this.sum(t) > 0)
         return !1;
-    return this.sum(f.BACK) > 0;
+    return this.sum(p.BACK) > 0;
   }
   clone() {
     const t = new Ht(this.toString());
     return t.data.reached = this.data.reached, t;
   }
   dec(t) {
-    return this.isBackHand() ? (super.dec(t.map(() => new y(f.BACK, 0))), [...t]) : super.dec(t);
+    return this.isBackHand() ? (super.dec(t.map(() => new y(p.BACK, 0))), [...t]) : super.dec(t);
   }
 }
 class ds {
   id;
-  river = new Zn();
+  river = new Yn();
   placeManager = new ae({});
   // empty for init
   scoreManager = new oe({});
   // empty for init
-  hands = P(new Ht(""));
+  hands = B(new Ht(""));
   // empty for init
-  counter = new Nr();
+  counter = new Ir();
   doraIndicators = [];
   // empty for init
   eventHandler;
@@ -7734,17 +7734,17 @@ class ds {
       case "PON":
       case "CHI":
       case "DAI_KAN": {
-        const i = I.deserialize(t.block);
+        const i = T.deserialize(t.block);
         this.hands[t.iam].call(i), this.river.markCalled(), t.iam != t.wind && this.counter.dec(...i.tiles.filter((r) => !r.has(m.HORIZONTAL)));
         break;
       }
       case "SHO_KAN": {
-        const i = L.from(t.block.tiles);
+        const i = W.from(t.block.tiles);
         this.hands[t.iam].kan(i), t.iam != t.wind && this.counter.dec(i.tiles.filter((r) => r.has(m.HORIZONTAL))[0]);
         break;
       }
       case "AN_KAN": {
-        const i = x.from(t.block.tiles);
+        const i = C.from(t.block.tiles);
         this.hands[t.iam].kan(i), t.iam != t.wind && this.counter.dec(...i.tiles.filter((r) => !r.has(m.HORIZONTAL)));
         break;
       }
@@ -7798,7 +7798,7 @@ class ds {
 class $o extends ds {
   applied = {};
   constructor(t) {
-    super("observer", t), this.counter.disable = !0, this.hands = P(new Ht("_____________"));
+    super("observer", t), this.counter.disable = !0, this.hands = B(new Ht("_____________"));
   }
   setHands(t) {
     this.hands[t.wind] = new Ht(t.hands[t.wind]);
@@ -7808,7 +7808,7 @@ class $o extends ds {
       case "DISTRIBUTE":
         let e = !0;
         for (const n of Object.values(_))
-          e &&= this.hand(n).get(f.BACK, 0) == 0;
+          e &&= this.hand(n).get(p.BACK, 0) == 0;
         if (!e) break;
         console.debug(
           "DISTRIBUTE:",
@@ -7866,7 +7866,7 @@ class $o extends ds {
       case "END_GAME":
         for (const n of Object.values(_))
           console.debug(
-            `${this.placeManager.playerID(n)}(${We(n)})`,
+            `${this.placeManager.playerID(n)}(${De(n)})`,
             `end hand: ${this.hand(n).toString()}`
           );
         console.debug(
@@ -7880,7 +7880,7 @@ class $o extends ds {
   }
 }
 class Qt extends ds {
-  river = new Zn();
+  river = new Yn();
   doras = [];
   constructor(t, e) {
     super(t, e), this.eventHandler.on((n) => this.handleEvent(n));
@@ -7930,7 +7930,7 @@ class Qt extends ds {
     }
   }
 }
-class Yo {
+class Zo {
   index = 0;
   histories = [];
   constructor(t) {
@@ -7951,20 +7951,20 @@ class Yo {
   }
 }
 const Vo = (s) => {
-  const [t, e] = Jt(), [n, i] = Jt(), [r, o] = Jt(), [a, c] = Jt(), l = ["player-1", "player-2", "player-3", "player-4"], u = s?.playerInjection, h = u?.p1 ?? Qt, d = u?.p2 ?? Qt, g = u?.p3 ?? Qt, p = u?.p4 ?? Qt, E = new h(l[0], e), A = new d(l[1], i), N = new g(l[2], o), v = new p(l[3], c), R = [
+  const [t, e] = Jt(), [n, i] = Jt(), [r, o] = Jt(), [a, c] = Jt(), l = ["player-1", "player-2", "player-3", "player-4"], u = s?.playerInjection, h = u?.p1 ?? Qt, d = u?.p2 ?? Qt, g = u?.p3 ?? Qt, f = u?.p4 ?? Qt, E = new h(l[0], e), A = new d(l[1], i), I = new g(l[2], o), v = new f(l[3], c), x = [
     { handler: t, id: l[0] },
     { handler: n, id: l[1] },
     { handler: r, id: l[2] },
     { handler: a, id: l[3] }
   ];
   return {
-    c: new ye(R, {
+    c: new ye(x, {
       debug: s?.debug,
       shuffle: s?.shuffle
     }),
     p1: E,
     p2: A,
-    p3: N,
+    p3: I,
     p4: v
   };
 }, ct = (s, t) => {
@@ -8006,13 +8006,13 @@ class de {
   static calcPriority(t, e, n) {
     const i = e.tile;
     let r = 0;
-    if (i.t == f.Z)
+    if (i.t == p.Z)
       return r = t.get(i), (i.n == 5 || i.n == 6 || i.n == 7) && (r *= 2), r * ct(i, n);
     {
       const o = t.get(i);
       r += o * ct(i, n);
-      const a = t.get(new y(i.t, i.n + 1)), c = t.get(new y(i.t, i.n + 2)), l = t.get(new y(i.t, i.n - 1)), u = t.get(new y(i.t, i.n - 2)), h = i.n - 2 > 0 ? Math.min(l, u) : 0, d = i.n + 2 <= 9 ? Math.min(a, c) : 0, g = i.n - 1 >= 1 && i.n + 1 <= 9 ? Math.min(a, l) : 0, p = Math.max(h, g), E = Math.max(g, d);
-      return r += o * ct(i, n), r += h * ct(new y(i.t, i.n - 2), n), r += d * ct(new y(i.t, i.n + 2), n), r += p * ct(new y(i.t, i.n - 1), n), r += E * ct(new y(i.t, i.n + 1), n), i.n == 0, r;
+      const a = t.get(new y(i.t, i.n + 1)), c = t.get(new y(i.t, i.n + 2)), l = t.get(new y(i.t, i.n - 1)), u = t.get(new y(i.t, i.n - 2)), h = i.n - 2 > 0 ? Math.min(l, u) : 0, d = i.n + 2 <= 9 ? Math.min(a, c) : 0, g = i.n - 1 >= 1 && i.n + 1 <= 9 ? Math.min(a, l) : 0, f = Math.max(h, g), E = Math.max(g, d);
+      return r += o * ct(i, n), r += h * ct(new y(i.t, i.n - 2), n), r += d * ct(new y(i.t, i.n + 2), n), r += f * ct(new y(i.t, i.n - 1), n), r += E * ct(new y(i.t, i.n + 1), n), i.n == 0, r;
     }
   }
 }
@@ -8036,7 +8036,7 @@ class zt {
     return i;
   }
   static rankZ(t, e, n) {
-    if (n.t != f.Z) throw new Error(`expected TYPE.Z but ${n.toString()}`);
+    if (n.t != p.Z) throw new Error(`expected TYPE.Z but ${n.toString()}`);
     if (t.isSafeTile(n.t, n.n, e)) return 0;
     const i = t.get(n);
     return Math.min(i, 3);
@@ -8058,90 +8058,90 @@ export {
   Ht as ActorHand,
   w as BLOCK,
   ds as BaseActor,
-  I as Block,
-  x as BlockAnKan,
+  T as Block,
+  C as BlockAnKan,
   fr as BlockCalculator,
-  J as BlockChi,
-  q as BlockDaiKan,
+  q as BlockChi,
+  Z as BlockDaiKan,
   Ut as BlockHand,
   vn as BlockIsolated,
   Sn as BlockOther,
-  D as BlockPair,
-  X as BlockPon,
+  R as BlockPair,
+  U as BlockPon,
   dt as BlockRun,
-  L as BlockShoKan,
-  G as BlockThree,
+  W as BlockShoKan,
+  L as BlockThree,
   ye as Controller,
-  Nr as Counter,
+  Ir as Counter,
   Ft as Efficiency,
-  Tn as FONT_FAMILY,
-  T as G,
+  Nn as FONT_FAMILY,
+  N as G,
   ze as Hand,
   ut as INPUT_SEPARATOR,
   Hn as Image,
-  Wn as ImageHelper,
+  Dn as ImageHelper,
   wt as Mark,
   Po as MeasureText,
   Ko as MyG,
   Lo as MyImage,
   Uo as MyRect,
-  Wo as MySVG,
+  Do as MySVG,
   jo as MyText,
   zo as MyUse,
-  V as N19,
+  X as N19,
   jt as NZ,
   m as OP,
   $o as Observer,
-  W as Parser,
+  K as Parser,
   ae as PlaceManager,
   Qt as Player,
   de as PlayerEfficiency,
   un as PointCalculator,
   O as ROUND,
-  In as ROUND_MAP,
+  Tn as ROUND_MAP,
   Pn as Rect,
-  Yo as Replayer,
+  Zo as Replayer,
   zt as RiskRank,
-  Zn as River,
+  Yn as River,
   Qe as STICK_CONTEXT,
   xi as SVG,
   oe as ScoreManager,
   ge as ShantenCalculator,
   Mi as Svg,
-  Dn as Symbol,
+  Bn as Symbol,
   ws as TABLE_CONTEXT,
   gt as TILE_CONTEXT,
-  f as TYPE,
+  p as TYPE,
   vt as Text,
   y as Tile,
   Le as Use,
   _ as WIND,
-  De as WIND_MAP,
+  Be as WIND_MAP,
   St as Wall,
   fe as compareTiles,
   ur as convertInput,
-  Nn as createControllerMachine,
+  In as createControllerMachine,
   br as createEventEmitter,
   Jt as createEventPipe,
   Kt as createHand,
   Vo as createLocalGame,
   Gi as createTable,
-  P as createWindMap,
+  B as createWindMap,
   Vt as deserializeWinResult,
   Fo as drawBlocks,
   Go as drawTable,
-  U as forHand,
+  F as forHand,
   nn as getCallBlockIndex,
   mr as getPointDescription,
   xo as incrementalIDGenerator,
   k as is5Tile,
   te as nextRound,
-  It as nextWind,
-  Zo as optimizeSVG,
+  Tt as nextWind,
+  Yo as optimizeSVG,
   or as parse,
   ar as parseTableInput,
-  Do as prevRound,
-  We as prevWind,
+  Bo as prevRound,
+  De as prevWind,
   wr as prioritizeDiscardedEvents,
   Er as prioritizeDrawnEvents,
   ke as serializeWinResult,