@konoui/mjimage 0.0.42 → 0.0.43

package/dist/index.js

@@ -12,7 +12,7 @@ const zs = "MS Gothic, sans-serif", Rt = {
   S: "s",
   Z: "z",
   BACK: "_"
-}, y = {
+}, g = {
   TSUMO: "t",
   RON: "v",
   DORA: "d",
@@ -57,7 +57,7 @@ const zs = "MS Gothic, sans-serif", Rt = {
   N2: "4w2",
   N3: "4w3",
   N4: "4w4"
-}, Ln = {
+}, Kn = {
   [v.E]: "東",
   [v.S]: "南",
   [v.W]: "西",
@@ -80,7 +80,7 @@ const zs = "MS Gothic, sans-serif", Rt = {
   [j.N3]: "北3局",
   [j.N4]: "北４局"
 };
-function O(s, t) {
+function k(s, t) {
   if (!s)
     throw new Error(t);
 }
@@ -90,7 +90,7 @@ class lh {
     A(this, "strText");
     A(this, "numText");
     A(this, "measure", (t, e) => {
-      this.ctx == null && (this.ctx = document.createElement("canvas").getContext("2d"), O(this.ctx, "context is null"));
+      this.ctx == null && (this.ctx = document.createElement("canvas").getContext("2d"), k(this.ctx, "context is null"));
       const n = this.ctx;
       n.font = e;
       const i = n.measureText(t);
@@ -148,11 +148,11 @@ class er {
     return /\s/.test(t);
   }
 }
-const Je = (s, t) => {
+const Ve = (s, t) => {
   if (s.t == t.t) {
     if (z(s) && z(t)) {
-      if (s.has(y.RED)) return -1;
-      if (t.has(y.RED)) return 1;
+      if (s.has(g.RED)) return -1;
+      if (t.has(g.RED)) return 1;
     }
     return s.n - t.n;
   }
@@ -166,20 +166,20 @@ const Je = (s, t) => {
   return e[s.t] - e[t.t];
 }, nr = (s, t) => {
   const e = {
-    [y.HORIZONTAL]: 1,
-    [y.TSUMO]: 2,
-    [y.RON]: 3,
-    [y.DORA]: 4,
-    [y.COLOR_GRAYSCALE]: 5,
-    [y.RED]: 6
+    [g.HORIZONTAL]: 1,
+    [g.TSUMO]: 2,
+    [g.RON]: 3,
+    [g.DORA]: 4,
+    [g.COLOR_GRAYSCALE]: 5,
+    [g.RED]: 6
   };
   return e[s] - e[t];
 }, sr = (s) => {
   const t = [];
   s.forEach((n, i) => {
-    n.has(y.HORIZONTAL) && t.push(i);
+    n.has(g.HORIZONTAL) && t.push(i);
   });
-  const e = s.filter((n) => !n.has(y.HORIZONTAL)).sort(Je);
+  const e = s.filter((n) => !n.has(g.HORIZONTAL)).sort(Ve);
   return t.forEach((n) => {
     e.splice(n, 0, s[n]);
   }), e;
@@ -231,7 +231,7 @@ class P {
       return;
     }
     if (this._type != b.IMAGE_DISCARD) {
-      this._tiles = [...this._tiles].sort(Je);
+      this._tiles = [...this._tiles].sort(Ve);
       return;
     }
   }
@@ -244,7 +244,7 @@ class P {
       throw new Error(
         `input type is ${t.type} but got is ${n}: ${t.tiles}`
       );
-    return Be(e[0].tiles, t.type);
+    return Pe(e[0].tiles, t.type);
   }
   serialize() {
     return {
@@ -277,7 +277,7 @@ class P {
   clone(t) {
     const e = t == null ? void 0 : t.replace;
     let n = [...this.tiles];
-    return e && (n[e.idx] = e.tile), Be(n, this._type);
+    return e && (n[e.idx] = e.tile), Pe(n, this._type);
   }
 }
 const zt = (s) => {
@@ -287,7 +287,7 @@ const zt = (s) => {
     t += e.toString().slice(0, -1);
   }
   return `${t}${s[0].t}`;
-}, Kn = (s) => {
+}, Un = (s) => {
   let t = s[0].t, e = "";
   for (let i = 0; i < s.length; i++) {
     const r = s[i], o = r.t, a = o == p.BACK ? r.toString() : r.toString().slice(0, -1);
@@ -324,7 +324,7 @@ class Z extends P {
     if (e.length < t.length) {
       if (z(n)) {
         const i = new w(n.t, 5);
-        super([i.clone({ add: y.RED }), i, i, i], b.AN_KAN);
+        super([i.clone({ add: g.RED }), i, i, i], b.AN_KAN);
         return;
       }
       super([n, n, n, n], b.AN_KAN);
@@ -333,14 +333,14 @@ class Z extends P {
     super(t, b.AN_KAN);
   }
   get tilesWithBack() {
-    const t = this.tiles[0].clone({ remove: y.RED }), e = z(t) ? t.clone({ add: y.RED }) : t;
+    const t = this.tiles[0].clone({ remove: g.RED }), e = z(t) ? t.clone({ add: g.RED }) : t;
     return [new w(p.BACK, 0), e, t, new w(p.BACK, 0)];
   }
   static from(t) {
     return P.deserialize({ tiles: t, type: b.AN_KAN });
   }
   toString() {
-    return Kn(this.tilesWithBack);
+    return Un(this.tilesWithBack);
   }
 }
 class yt extends P {
@@ -403,23 +403,23 @@ class Ks extends P {
     return this.tiles[0].toString();
   }
 }
-class Fn extends P {
+class me extends P {
   constructor(t) {
     super(t, b.HAND);
   }
   toString() {
-    return Kn(this.tiles);
+    return Un(this.tiles);
   }
 }
-class Fs extends P {
+class Us extends P {
   constructor(t, e) {
     super(t, e);
   }
   toString() {
-    return this.is(b.IMAGE_DISCARD) ? this.tiles.join("") : Kn(this.tiles);
+    return this.is(b.IMAGE_DISCARD) ? this.tiles.join("") : Un(this.tiles);
   }
 }
-const Be = (s, t) => {
+const Pe = (s, t) => {
   switch (t) {
     case b.CHI:
       return new ut([s[0], s[1], s[2]]);
@@ -440,9 +440,9 @@ const Be = (s, t) => {
     case b.ISOLATED:
       return new Ks(s[0]);
     case b.HAND:
-      return new Fn(s);
+      return new me(s);
     default:
-      return new Fs(s, t);
+      return new Us(s, t);
   }
 };
 class nt {
@@ -482,7 +482,7 @@ class nt {
           n.push(a), t.readChar();
           continue;
         }
-        const [h, l] = Us(i);
+        const [h, l] = Fs(i);
         if (!l)
           throw new Error(
             `encounter unexpected number. n: ${h}, current: ${i}, input: ${t.input}`
@@ -501,13 +501,13 @@ class nt {
     if (t.length == 0) return n;
     for (const o of t) {
       if (o == Dt) {
-        const a = ys(e), c = Be(e, a);
+        const a = ys(e), c = Pe(e, a);
         n.push(c), e = [];
         continue;
       }
       e.push(o);
     }
-    const i = ys(e), r = Be(e, i);
+    const i = ys(e), r = Pe(e, i);
     return n.push(r), e = [], n;
   }
   validate(t) {
@@ -522,11 +522,11 @@ class nt {
 function ys(s) {
   if (s.length === 0) return b.UNKNOWN;
   if (s.length === 1)
-    return s[0].has(y.DORA) ? b.IMAGE_DORA : s[0].has(y.TSUMO) ? b.TSUMO : b.HAND;
+    return s[0].has(g.DORA) ? b.IMAGE_DORA : s[0].has(g.TSUMO) ? b.TSUMO : b.HAND;
   const t = s.every((r) => r.equals(s[0])), e = s.filter(
-    (r) => r.has(y.HORIZONTAL)
+    (r) => r.has(g.HORIZONTAL)
   ).length, n = s.filter(
-    (r) => r.has(y.TSUMO) || r.has(y.DORA)
+    (r) => r.has(g.TSUMO) || r.has(g.DORA)
   ).length, i = s.filter((r) => r.t == p.BACK).length;
   if (n > 0) return b.UNKNOWN;
   if (e == 0 && i == 0) return b.HAND;
@@ -540,7 +540,7 @@ function ys(s) {
   return e == 1 || n == 0 ? b.IMAGE_DISCARD : b.UNKNOWN;
 }
 function rr(s) {
-  const t = [...s].sort(Je);
+  const t = [...s].sort(Ve);
   if (!t.every((n) => t[0].t == n.t)) return !1;
   const e = t.map((n) => n.n);
   for (let n = 0; n < e.length - 1; n++)
@@ -550,7 +550,7 @@ function rr(s) {
 function or(s, t) {
   return s.map((e) => {
     const n = new w(t, e.n, e.ops);
-    return n.isNum() && n.n == 0 ? n.clone({ n: 5, add: y.RED }) : n;
+    return n.isNum() && n.n == 0 ? n.clone({ n: 5, add: g.RED }) : n;
   });
 }
 function ws(s, t) {
@@ -565,24 +565,29 @@ function ws(s, t) {
   }
   return [p.BACK, !1];
 }
-function Us(s) {
+function Fs(s) {
   const t = Number(s), e = 0 <= t && t <= 9;
   return [t, e];
 }
 function ar(s) {
-  const t = Object.values(y);
+  const t = Object.values(g);
   if (!t.includes(s.char)) return [new w(p.BACK, 0), !1];
   const e = [];
   for (let n = 0; n < 4; n++) {
     const i = s.peekCharN(n);
     if (t.includes(i)) e.push(i);
     else {
-      const [r, o] = Us(i);
+      const [r, o] = Fs(i);
       if (!o) break;
       for (let c = 0; c < e.length; c++) s.readChar();
-      if (e.some((c) => c == y.RED) && r != 5)
-        throw new Error(`found ${y.RED} but number is not 5: ${r}`);
-      return [new w(p.BACK, r, e), !0];
+      if (e.some((c) => c == g.RED) && r != 5)
+        throw new Error(`found ${g.RED} but number is not 5: ${r}`);
+      const a = new w(p.BACK, r, e);
+      if (a.has(g.DORA) && a.has(g.TSUMO))
+        throw new Error(
+          `unable to specify both ${g.DORA} and ${g.TSUMO}`
+        );
+      return [a, !0];
     }
   }
   return [new w(p.BACK, 0), !1];
@@ -598,10 +603,10 @@ function G(s, t = !1) {
     for (let n of Object.values(v)) e[n] = structuredClone(s);
   return e;
 }
-const $e = (s) => {
+const We = (s) => {
   let t = s.substring(0, 2), e = Number(s.substring(2, 3));
   return e == 4 ? (e = 1, t = Ht(t)) : e++, `${t}${e}`;
-}, uh = (s) => $e($e($e(s))), Ht = (s) => {
+}, uh = (s) => We(We(We(s))), Ht = (s) => {
   let t = Number(s.toString()[0]);
   return t = t % 4 + 1, `${t}w`;
 }, cr = (s) => {
@@ -609,23 +614,23 @@ const $e = (s) => {
   return t = t % 2 + 1, `${t}w`;
 }, _s = (s, t, e) => {
   const n = Math.abs(Number(s[0]) - Number(t[0]));
-  return O(n == 1 || n == 2 || n == 3), e == b.PON ? n == 3 ? 0 : n == 2 ? 1 : 2 : n == 3 ? 0 : n == 1 ? 3 : 2;
-}, _n = {}, qs = [];
-function T(s, t) {
+  return k(n == 1 || n == 2 || n == 3), e == b.PON ? n == 3 ? 0 : n == 2 ? 1 : 2 : n == 3 ? 0 : n == 1 ? 3 : 2;
+}, bn = {}, qs = [];
+function O(s, t) {
   if (Array.isArray(s)) {
     for (const e of s)
-      T(e, t);
+      O(e, t);
     return;
   }
   if (typeof s == "object") {
     for (const e in s)
-      T(e, s[e]);
+      O(e, s[e]);
     return;
   }
-  Zs(Object.getOwnPropertyNames(t)), _n[s] = Object.assign(_n[s] || {}, t);
+  Zs(Object.getOwnPropertyNames(t)), bn[s] = Object.assign(bn[s] || {}, t);
 }
 function X(s) {
-  return _n[s] || {};
+  return bn[s] || {};
 }
 function hr() {
   return [...new Set(qs)];
@@ -633,7 +638,7 @@ function hr() {
 function Zs(s) {
   qs.push(...s);
 }
-function Un(s, t) {
+function Fn(s, t) {
   let e;
   const n = s.length, i = [];
   for (e = 0; e < n; e++)
@@ -647,7 +652,7 @@ function lr(s, t) {
     t(s[e]) && i.push(s[e]);
   return i;
 }
-function cn(s) {
+function hn(s) {
   return s % 360 * Math.PI / 180;
 }
 function ur(s) {
@@ -664,7 +669,7 @@ function ae(s, t, e, n) {
     height: e
   };
 }
-function bn(s, t) {
+function vn(s, t) {
   const e = s.origin;
   let n = s.ox != null ? s.ox : s.originX != null ? s.originX : "center", i = s.oy != null ? s.oy : s.originY != null ? s.originY : "center";
   e != null && ([n, i] = Array.isArray(e) ? e : typeof e == "object" ? [e.x, e.y] : [e, e]);
@@ -675,12 +680,12 @@ function bn(s, t) {
   }
   return [n, i];
 }
-const fr = /* @__PURE__ */ new Set(["desc", "metadata", "title"]), vn = (s) => fr.has(s.nodeName), Ys = (s, t, e = {}) => {
+const fr = /* @__PURE__ */ new Set(["desc", "metadata", "title"]), An = (s) => fr.has(s.nodeName), Ys = (s, t, e = {}) => {
   const n = { ...t };
   for (const i in n)
     n[i].valueOf() === e[i] && delete n[i];
   Object.keys(n).length ? s.node.setAttribute("data-svgjs", JSON.stringify(n)) : (s.node.removeAttribute("data-svgjs"), s.node.removeAttribute("svgjs:data"));
-}, qn = "http://www.w3.org/2000/svg", dr = "http://www.w3.org/1999/xhtml", hn = "http://www.w3.org/2000/xmlns/", be = "http://www.w3.org/1999/xlink", N = {
+}, qn = "http://www.w3.org/2000/svg", dr = "http://www.w3.org/1999/xhtml", ln = "http://www.w3.org/2000/xmlns/", ve = "http://www.w3.org/1999/xlink", N = {
   window: typeof window > "u" ? null : window,
   document: typeof document > "u" ? null : document
 };
@@ -698,22 +703,22 @@ class Zn {
   // }
 }
 const $t = {}, Gn = "___SYMBOL___ROOT___";
-function me(s, t = qn) {
+function ge(s, t = qn) {
   return N.document.createElementNS(t, s);
 }
 function Y(s, t = !1) {
   if (s instanceof Zn) return s;
   if (typeof s == "object")
-    return ln(s);
+    return un(s);
   if (s == null)
     return new $t[Gn]();
   if (typeof s == "string" && s.charAt(0) !== "<")
-    return ln(N.document.querySelector(s));
-  const e = t ? N.document.createElement("div") : me("svg");
-  return e.innerHTML = s, s = ln(e.firstChild), e.removeChild(e.firstChild), s;
+    return un(N.document.querySelector(s));
+  const e = t ? N.document.createElement("div") : ge("svg");
+  return e.innerHTML = s, s = un(e.firstChild), e.removeChild(e.firstChild), s;
 }
 function $(s, t) {
-  return t && (t instanceof N.window.Node || t.ownerDocument && t instanceof t.ownerDocument.defaultView.Node) ? t : me(s);
+  return t && (t instanceof N.window.Node || t.ownerDocument && t instanceof t.ownerDocument.defaultView.Node) ? t : ge(s);
 }
 function st(s) {
   if (!s) return null;
@@ -723,7 +728,7 @@ function st(s) {
   let t = Gs(s.nodeName || "Dom");
   return t === "LinearGradient" || t === "RadialGradient" ? t = "Gradient" : $t[t] || (t = "Dom"), new $t[t](s);
 }
-let ln = st;
+let un = st;
 function D(s, t = s.name, e = !1) {
   return $t[t] = s, e && ($t[Gn] = s), Zs(Object.getOwnPropertyNames(s.prototype)), s;
 }
@@ -782,18 +787,18 @@ function Er(s) {
   const t = this.position();
   return this.parent().add(s, t), this;
 }
-function kr(s) {
+function Tr(s) {
   s = Y(s), s.remove();
   const t = this.position();
   return this.parent().add(s, t + 1), this;
 }
-function Tr(s) {
+function Or(s) {
   return s = Y(s), s.before(this), this;
 }
-function Or(s) {
+function kr(s) {
   return s = Y(s), s.after(this), this;
 }
-T("Dom", {
+O("Dom", {
   siblings: yr,
   position: wr,
   next: _r,
@@ -803,9 +808,9 @@ T("Dom", {
   front: Sr,
   back: xr,
   before: Er,
-  after: kr,
-  insertBefore: Tr,
-  insertAfter: Or
+  after: Tr,
+  insertBefore: Or,
+  insertAfter: kr
 });
 const Vs = /^([+-]?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?)([a-z%]*)$/i, Ir = /^#?([a-f\d]{2})([a-f\d]{2})([a-f\d]{2})$/i, Nr = /rgb\((\d+),(\d+),(\d+)\)/, Dr = /(#[a-z_][a-z0-9\-_]*)/i, Cr = /\)\s*,?\s*/, Mr = /\s/g, bs = /^#[a-f0-9]{3}$|^#[a-f0-9]{6}$/i, vs = /^rgb\(/, As = /^(\s+)?$/, Ss = /^[+-]?(\d+(\.\d*)?|\.\d+)(e[+-]?\d+)?$/i, Rr = /\.(jpg|jpeg|png|gif|svg)(\?[^=]+.*)?/i, _t = /[\s,]+/, Yn = /[MLHVCSQTAZ]/i;
 function Hr() {
@@ -833,7 +838,7 @@ function Br(s) {
 function Pr(s) {
   return this.hasClass(s) ? this.removeClass(s) : this.addClass(s);
 }
-T("Dom", {
+O("Dom", {
   classes: Hr,
   hasClass: $r,
   addClass: Wr,
@@ -880,16 +885,16 @@ function Lr() {
 function Kr() {
   return this.css("display") !== "none";
 }
-T("Dom", {
+O("Dom", {
   css: jr,
   show: zr,
   hide: Lr,
   visible: Kr
 });
-function Fr(s, t, e) {
+function Ur(s, t, e) {
   if (s == null)
     return this.data(
-      Un(
+      Fn(
         lr(
           this.node.attributes,
           (n) => n.nodeName.indexOf("data-") === 0
@@ -918,8 +923,8 @@ function Fr(s, t, e) {
     );
   return this;
 }
-T("Dom", { data: Fr });
-function Ur(s, t) {
+O("Dom", { data: Ur });
+function Fr(s, t) {
   if (typeof arguments[0] == "object")
     for (const e in s)
       this.remember(e, s[e]);
@@ -941,7 +946,7 @@ function qr() {
 function Zr() {
   return this._memory = this._memory || {};
 }
-T("Dom", { remember: Ur, forget: qr, memory: Zr });
+O("Dom", { remember: Fr, forget: qr, memory: Zr });
 function Gr(s) {
   return s.length === 4 ? [
     "#",
@@ -970,7 +975,7 @@ function Xr(s, t) {
 function Jr(s) {
   return s === "lab" || s === "xyz" || s === "lch";
 }
-function un(s, t, e) {
+function fn(s, t, e) {
   return e < 0 && (e += 1), e > 1 && (e -= 1), e < 1 / 6 ? s + (t - s) * 6 * e : e < 1 / 2 ? t : e < 2 / 3 ? s + (t - s) * (2 / 3 - e) * 6 : s;
 }
 class M {
@@ -1027,7 +1032,7 @@ class M {
     return new M(c, h, l, a, "cmyk");
   }
   hsl() {
-    const { _a: t, _b: e, _c: n } = this.rgb(), [i, r, o] = [t, e, n].map((g) => g / 255), a = Math.max(i, r, o), c = Math.min(i, r, o), h = (a + c) / 2, l = a === c, u = a - c, f = l ? 0 : h > 0.5 ? u / (2 - a - c) : u / (a + c), m = l ? 0 : a === i ? ((r - o) / u + (r < o ? 6 : 0)) / 6 : a === r ? ((o - i) / u + 2) / 6 : a === o ? ((i - r) / u + 4) / 6 : 0;
+    const { _a: t, _b: e, _c: n } = this.rgb(), [i, r, o] = [t, e, n].map((y) => y / 255), a = Math.max(i, r, o), c = Math.min(i, r, o), h = (a + c) / 2, l = a === c, u = a - c, f = l ? 0 : h > 0.5 ? u / (2 - a - c) : u / (a + c), m = l ? 0 : a === i ? ((r - o) / u + (r < o ? 6 : 0)) / 6 : a === r ? ((o - i) / u + 2) / 6 : a === o ? ((i - r) / u + 4) / 6 : 0;
     return new M(360 * m, 100 * f, 100 * h, "hsl");
   }
   init(t = 0, e = 0, n = 0, i = 0, r = "rgb") {
@@ -1043,10 +1048,10 @@ class M {
       Object.assign(this, u);
     } else if (typeof t == "string")
       if (vs.test(t)) {
-        const u = t.replace(Mr, ""), [f, m, d] = Nr.exec(u).slice(1, 4).map((g) => parseInt(g));
+        const u = t.replace(Mr, ""), [f, m, d] = Nr.exec(u).slice(1, 4).map((y) => parseInt(y));
         Object.assign(this, { _a: f, _b: m, _c: d, _d: 0, space: "rgb" });
       } else if (bs.test(t)) {
-        const u = (g) => parseInt(g, 16), [, f, m, d] = Ir.exec(Gr(t)).map(u);
+        const u = (y) => parseInt(y, 16), [, f, m, d] = Ir.exec(Gr(t)).map(u);
         Object.assign(this, { _a: f, _b: m, _c: d, _d: 0, space: "rgb" });
       } else throw Error("Unsupported string format, can't construct Color");
     const { _a: o, _b: a, _c: c, _d: h } = this, l = this.space === "rgb" ? { r: o, g: a, b: c } : this.space === "xyz" ? { x: o, y: a, z: c } : this.space === "hsl" ? { h: o, s: a, l: c } : this.space === "lab" ? { l: o, a, b: c } : this.space === "lch" ? { l: o, c: a, h: c } : this.space === "cmyk" ? { c: o, m: a, y: c, k: h } : {};
@@ -1070,13 +1075,13 @@ class M {
     if (Jr(this.space)) {
       let { x: t, y: e, z: n } = this;
       if (this.space === "lab" || this.space === "lch") {
-        let { l: m, a: d, b: g } = this;
+        let { l: m, a: d, b: y } = this;
         if (this.space === "lch") {
           const { c: rt, h: dt } = this, Lt = Math.PI / 180;
-          d = rt * Math.cos(Lt * dt), g = rt * Math.sin(Lt * dt);
+          d = rt * Math.cos(Lt * dt), y = rt * Math.sin(Lt * dt);
         }
-        const _ = (m + 16) / 116, x = d / 500 + _, k = _ - g / 200, R = 16 / 116, U = 8856e-6, K = 7.787;
-        t = 0.95047 * (x ** 3 > U ? x ** 3 : (x - R) / K), e = 1 * (_ ** 3 > U ? _ ** 3 : (_ - R) / K), n = 1.08883 * (k ** 3 > U ? k ** 3 : (k - R) / K);
+        const _ = (m + 16) / 116, x = d / 500 + _, T = _ - y / 200, R = 16 / 116, F = 8856e-6, K = 7.787;
+        t = 0.95047 * (x ** 3 > F ? x ** 3 : (x - R) / K), e = 1 * (_ ** 3 > F ? _ ** 3 : (_ - R) / K), n = 1.08883 * (T ** 3 > F ? T ** 3 : (T - R) / K);
       }
       const i = t * 3.2406 + e * -1.5372 + n * -0.4986, r = t * -0.9689 + e * 1.8758 + n * 0.0415, o = t * 0.0557 + e * -0.204 + n * 1.057, a = Math.pow, c = 31308e-7, h = i > c ? 1.055 * a(i, 1 / 2.4) - 0.055 : 12.92 * i, l = r > c ? 1.055 * a(r, 1 / 2.4) - 0.055 : 12.92 * r, u = o > c ? 1.055 * a(o, 1 / 2.4) - 0.055 : 12.92 * o;
       return new M(255 * h, 255 * l, 255 * u);
@@ -1084,7 +1089,7 @@ class M {
       let { h: t, s: e, l: n } = this;
       if (t /= 360, e /= 100, n /= 100, e === 0)
         return n *= 255, new M(n, n, n);
-      const i = n < 0.5 ? n * (1 + e) : n + e - n * e, r = 2 * n - i, o = 255 * un(r, i, t + 1 / 3), a = 255 * un(r, i, t), c = 255 * un(r, i, t - 1 / 3);
+      const i = n < 0.5 ? n * (1 + e) : n + e - n * e, r = 2 * n - i, o = 255 * fn(r, i, t + 1 / 3), a = 255 * fn(r, i, t), c = 255 * fn(r, i, t - 1 / 3);
       return new M(o, a, c);
     } else if (this.space === "cmyk") {
       const { c: t, m: e, y: n, k: i } = this, r = 255 * (1 - Math.min(1, t * (1 - i) + i)), o = 255 * (1 - Math.min(1, e * (1 - i) + i)), a = 255 * (1 - Math.min(1, n * (1 - i) + i));
@@ -1108,8 +1113,8 @@ class M {
     return this.toHex();
   }
   xyz() {
-    const { _a: t, _b: e, _c: n } = this.rgb(), [i, r, o] = [t, e, n].map((x) => x / 255), a = i > 0.04045 ? Math.pow((i + 0.055) / 1.055, 2.4) : i / 12.92, c = r > 0.04045 ? Math.pow((r + 0.055) / 1.055, 2.4) : r / 12.92, h = o > 0.04045 ? Math.pow((o + 0.055) / 1.055, 2.4) : o / 12.92, l = (a * 0.4124 + c * 0.3576 + h * 0.1805) / 0.95047, u = (a * 0.2126 + c * 0.7152 + h * 0.0722) / 1, f = (a * 0.0193 + c * 0.1192 + h * 0.9505) / 1.08883, m = l > 8856e-6 ? Math.pow(l, 1 / 3) : 7.787 * l + 16 / 116, d = u > 8856e-6 ? Math.pow(u, 1 / 3) : 7.787 * u + 16 / 116, g = f > 8856e-6 ? Math.pow(f, 1 / 3) : 7.787 * f + 16 / 116;
-    return new M(m, d, g, "xyz");
+    const { _a: t, _b: e, _c: n } = this.rgb(), [i, r, o] = [t, e, n].map((x) => x / 255), a = i > 0.04045 ? Math.pow((i + 0.055) / 1.055, 2.4) : i / 12.92, c = r > 0.04045 ? Math.pow((r + 0.055) / 1.055, 2.4) : r / 12.92, h = o > 0.04045 ? Math.pow((o + 0.055) / 1.055, 2.4) : o / 12.92, l = (a * 0.4124 + c * 0.3576 + h * 0.1805) / 0.95047, u = (a * 0.2126 + c * 0.7152 + h * 0.0722) / 1, f = (a * 0.0193 + c * 0.1192 + h * 0.9505) / 1.08883, m = l > 8856e-6 ? Math.pow(l, 1 / 3) : 7.787 * l + 16 / 116, d = u > 8856e-6 ? Math.pow(u, 1 / 3) : 7.787 * u + 16 / 116, y = f > 8856e-6 ? Math.pow(f, 1 / 3) : 7.787 * f + 16 / 116;
+    return new M(m, d, y, "xyz");
   }
   /*
   Input and Output methods
@@ -1151,7 +1156,7 @@ class W {
 function Vr(s, t) {
   return new W(s, t).transformO(this.screenCTM().inverseO());
 }
-function Ft(s, t, e) {
+function Ut(s, t, e) {
   return Math.abs(t - s) < 1e-6;
 }
 class S {
@@ -1165,13 +1170,13 @@ class S {
     ), f = u.x, m = u.y, d = new W(
       t.position || t.px || t.positionX || NaN,
       t.py || t.positionY || NaN
-    ), g = d.x, _ = d.y, x = new W(
+    ), y = d.x, _ = d.y, x = new W(
       t.translate || t.tx || t.translateX,
       t.ty || t.translateY
-    ), k = x.x, R = x.y, U = new W(
+    ), T = x.x, R = x.y, F = new W(
       t.relative || t.rx || t.relativeX,
       t.ry || t.relativeY
-    ), K = U.x, rt = U.y;
+    ), K = F.x, rt = F.y;
     return {
       scaleX: a,
       scaleY: c,
@@ -1181,11 +1186,11 @@ class S {
       theta: l,
       rx: K,
       ry: rt,
-      tx: k,
+      tx: T,
       ty: R,
       ox: f,
       oy: m,
-      px: g,
+      px: y,
       py: _
     };
   }
@@ -1214,14 +1219,14 @@ class S {
   }
   // Decomposes this matrix into its affine parameters
   decompose(t = 0, e = 0) {
-    const n = this.a, i = this.b, r = this.c, o = this.d, a = this.e, c = this.f, h = n * o - i * r, l = h > 0 ? 1 : -1, u = l * Math.sqrt(n * n + i * i), f = Math.atan2(l * i, l * n), m = 180 / Math.PI * f, d = Math.cos(f), g = Math.sin(f), _ = (n * r + i * o) / h, x = r * u / (_ * n - i) || o * u / (_ * i + n), k = a - t + t * d * u + e * (_ * d * u - g * x), R = c - e + t * g * u + e * (_ * g * u + d * x);
+    const n = this.a, i = this.b, r = this.c, o = this.d, a = this.e, c = this.f, h = n * o - i * r, l = h > 0 ? 1 : -1, u = l * Math.sqrt(n * n + i * i), f = Math.atan2(l * i, l * n), m = 180 / Math.PI * f, d = Math.cos(f), y = Math.sin(f), _ = (n * r + i * o) / h, x = r * u / (_ * n - i) || o * u / (_ * i + n), T = a - t + t * d * u + e * (_ * d * u - y * x), R = c - e + t * y * u + e * (_ * y * u + d * x);
     return {
       // Return the affine parameters
       scaleX: u,
       scaleY: x,
       shear: _,
       rotate: m,
-      translateX: k,
+      translateX: T,
       translateY: R,
       originX: t,
       originY: e,
@@ -1238,7 +1243,7 @@ class S {
   equals(t) {
     if (t === this) return !0;
     const e = new S(t);
-    return Ft(this.a, e.a) && Ft(this.b, e.b) && Ft(this.c, e.c) && Ft(this.d, e.d) && Ft(this.e, e.e) && Ft(this.f, e.f);
+    return Ut(this.a, e.a) && Ut(this.b, e.b) && Ut(this.c, e.c) && Ut(this.d, e.d) && Ut(this.e, e.e) && Ut(this.f, e.f);
   }
   // Flip matrix on x or y, at a given offset
   flip(t, e) {
@@ -1282,7 +1287,7 @@ class S {
     return this.clone().rotateO(t, e, n);
   }
   rotateO(t, e = 0, n = 0) {
-    t = cn(t);
+    t = hn(t);
     const i = Math.cos(t), r = Math.sin(t), { a: o, b: a, c, d: h, e: l, f: u } = this;
     return this.a = o * i - a * r, this.b = a * i + o * r, this.c = c * i - h * r, this.d = h * i + c * r, this.e = l * i - u * r + n * r - e * i + e, this.f = u * i + l * r - e * r - n * i + n, this;
   }
@@ -1309,7 +1314,7 @@ class S {
     return this.clone().skewO(...arguments);
   }
   skewO(t, e = t, n = 0, i = 0) {
-    arguments.length === 3 && (i = n, n = e, e = t), t = cn(t), e = cn(e);
+    arguments.length === 3 && (i = n, n = e, e = t), t = hn(t), e = hn(e);
     const r = Math.tan(t), o = Math.tan(e), { a, b: c, c: h, d: l, e: u, f } = this;
     return this.a = a + c * r, this.b = c + a * o, this.c = h + l * r, this.d = l + h * o, this.e = u + f * r - i * r, this.f = f + u * o - n * o, this;
   }
@@ -1481,7 +1486,7 @@ function io(s, t) {
   const e = this.bbox();
   return s > e.x && t > e.y && s < e.x + e.width && t < e.y + e.height;
 }
-T({
+O({
   viewbox: {
     viewbox(s, t, e, n) {
       return s == null ? new L(this.attr("viewBox")) : this.attr("viewBox", new L(s, t, e, n));
@@ -1527,7 +1532,7 @@ Wt.extend = function(s) {
 };
 function ce(s, t) {
   return new Wt(
-    Un((t || N.document).querySelectorAll(s), function(e) {
+    Fn((t || N.document).querySelectorAll(s), function(e) {
       return st(e);
     })
   );
@@ -1551,7 +1556,7 @@ function ho(s) {
   let t = s.getEventHolder();
   t === N.window && (t = ei), t.events && (t.events = {});
 }
-function An(s, t, e, n, i) {
+function Sn(s, t, e, n, i) {
   const r = e.bind(n || s), o = Y(s), a = ni(o), c = Xn(o);
   t = Array.isArray(t) ? t : t.split(_t), e._svgjsListenerId || (e._svgjsListenerId = ++co), t.forEach(function(h) {
     const l = h.split(".")[0], u = h.split(".")[1] || "*";
@@ -1600,7 +1605,7 @@ function lo(s, t, e, n) {
     ...n
   })), i.dispatchEvent(t), t;
 }
-class ve extends Zn {
+class Ae extends Zn {
   addEventListener() {
   }
   dispatch(t, e, n) {
@@ -1631,12 +1636,12 @@ class ve extends Zn {
   }
   // Bind given event to listener
   on(t, e, n, i) {
-    return An(this, t, e, n, i), this;
+    return Sn(this, t, e, n, i), this;
   }
   removeEventListener() {
   }
 }
-D(ve, "EventTarget");
+D(Ae, "EventTarget");
 function xs() {
 }
 const fe = {
@@ -1774,7 +1779,7 @@ function mo(s, t, e) {
   }
   return this;
 }
-class At extends ve {
+class At extends Ae {
   constructor(t, e) {
     super(), this.node = t, this.type = t.nodeName, e && t !== e && this.attr(e);
   }
@@ -1789,7 +1794,7 @@ class At extends ve {
   // Returns all child elements
   children() {
     return new Wt(
-      Un(this.node.children, function(t) {
+      Fn(this.node.children, function(t) {
         return st(t);
       })
     );
@@ -1815,7 +1820,7 @@ class At extends ve {
     return this;
   }
   element(t, e) {
-    return this.put(new At(me(t), e));
+    return this.put(new At(ge(t), e));
   }
   // Get first child
   first() {
@@ -1934,7 +1939,7 @@ class At extends ve {
       return e ? a.node.outerHTML : a.node.innerHTML;
     }
     e = e ?? !1;
-    const i = me("wrapper", n), r = N.document.createDocumentFragment();
+    const i = ge("wrapper", n), r = N.document.createDocumentFragment();
     i.innerHTML = t;
     for (let a = i.children.length; a--; )
       r.appendChild(i.firstElementChild);
@@ -2075,9 +2080,9 @@ const le = {
       for (e = le[s].length - 1; e >= 0; e--)
         n[le[s][e]] != null && this.attr(le.prefix(s, le[s][e]), n[le[s][e]]);
     return this;
-  }, T(["Element", "Runner"], t);
+  }, O(["Element", "Runner"], t);
 });
-T(["Element", "Runner"], {
+O(["Element", "Runner"], {
   // Let the user set the matrix directly
   matrix: function(s, t, e, n, i, r) {
     return s == null ? new S(this) : this.attr("transform", new S(s, t, e, n, i, r));
@@ -2114,13 +2119,13 @@ T(["Element", "Runner"], {
     return this.attr("opacity", s);
   }
 });
-T("radius", {
+O("radius", {
   // Add x and y radius
   radius: function(s, t = s) {
     return (this._element || this).type === "radialGradient" ? this.attr("r", new E(s)) : this.rx(s).ry(t);
   }
 });
-T("Path", {
+O("Path", {
   // Get path length
   length: function() {
     return this.node.getTotalLength();
@@ -2130,7 +2135,7 @@ T("Path", {
     return new W(this.node.getPointAtLength(s));
   }
 });
-T(["Element", "Runner"], {
+O(["Element", "Runner"], {
   // Set font
   font: function(s, t) {
     if (typeof s == "object") {
@@ -2168,7 +2173,7 @@ const go = [
   };
   return s[t] = e, s;
 }, {});
-T("Element", go);
+O("Element", go);
 function yo() {
   return this.attr("transform", null);
 }
@@ -2187,7 +2192,7 @@ function wo() {
 }
 function _o(s, t) {
   if (this === s) return this;
-  if (vn(this.node)) return this.addTo(s, t);
+  if (An(this.node)) return this.addTo(s, t);
   const e = this.screenCTM(), n = s.screenCTM().inverse();
   return this.addTo(s, t).untransform().transform(n.multiply(e)), this;
 }
@@ -2199,11 +2204,11 @@ function vo(s, t) {
     const i = new S(this).decompose();
     return s == null ? i : i[s];
   }
-  S.isMatrixLike(s) || (s = { ...s, origin: bn(s, this) });
+  S.isMatrixLike(s) || (s = { ...s, origin: vn(s, this) });
   const e = t === !0 ? this : t || !1, n = new S(e).transform(s);
   return this.attr("transform", n);
 }
-T("Element", {
+O("Element", {
   untransform: yo,
   matrixify: wo,
   toParent: _o,
@@ -2274,7 +2279,7 @@ const Ao = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   x: ii,
   y: ri
 }, Symbol.toStringTag, { value: "Module" }));
-class Ve extends et {
+class Qe extends et {
   constructor(t, e = t) {
     super($("ellipse", t), e);
   }
@@ -2285,14 +2290,14 @@ class Ve extends et {
     );
   }
 }
-I(Ve, Ao);
-T("Container", {
+I(Qe, Ao);
+O("Container", {
   // Create an ellipse
   ellipse: H(function(s = 0, t = s) {
-    return this.put(new Ve()).size(s, t).move(0, 0);
+    return this.put(new Qe()).size(s, t).move(0, 0);
   })
 });
-D(Ve, "Ellipse");
+D(Qe, "Ellipse");
 class li extends At {
   constructor(t = N.document.createDocumentFragment()) {
     super(t);
@@ -2300,7 +2305,7 @@ class li extends At {
   // Import / Export raw xml
   xml(t, e, n) {
     if (typeof t == "boolean" && (n = e, e = t, t = null), t == null || typeof t == "function") {
-      const i = new At(me("wrapper", n));
+      const i = new At(ge("wrapper", n));
       return i.add(this.node.cloneNode(!0)), i.xml(!1, n);
     }
     return super.xml(t, !1, n);
@@ -2318,7 +2323,7 @@ const So = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   from: ui,
   to: fi
 }, Symbol.toStringTag, { value: "Module" }));
-class Ae extends J {
+class Se extends J {
   constructor(t, e) {
     super(
       $(t + "Gradient", typeof t == "string" ? null : t),
@@ -2348,8 +2353,8 @@ class Ae extends J {
     return "url(#" + this.id() + ")";
   }
 }
-I(Ae, So);
-T({
+I(Se, So);
+O({
   Container: {
     // Create gradient element in defs
     gradient(...s) {
@@ -2359,12 +2364,12 @@ T({
   // define gradient
   Defs: {
     gradient: H(function(s, t) {
-      return this.put(new Ae(s)).update(t);
+      return this.put(new Se(s)).update(t);
     })
   }
 });
-D(Ae, "Gradient");
-class ge extends J {
+D(Se, "Gradient");
+class ye extends J {
   // Initialize node
   constructor(t, e = t) {
     super($("pattern", t), e);
@@ -2392,7 +2397,7 @@ class ge extends J {
     return "url(#" + this.id() + ")";
   }
 }
-T({
+O({
   Container: {
     // Create pattern element in defs
     pattern(...s) {
@@ -2401,7 +2406,7 @@ T({
   },
   Defs: {
     pattern: H(function(s, t, e) {
-      return this.put(new ge()).update(e).attr({
+      return this.put(new ye()).update(e).attr({
         x: 0,
         y: 0,
         width: s,
@@ -2411,8 +2416,8 @@ T({
     })
   }
 });
-D(ge, "Pattern");
-class Se extends et {
+D(ye, "Pattern");
+class xe extends et {
   constructor(t, e = t) {
     super($("image", t), e);
   }
@@ -2420,33 +2425,33 @@ class Se extends et {
   load(t, e) {
     if (!t) return this;
     const n = new N.window.Image();
-    return An(
+    return Sn(
       n,
       "load",
       function(i) {
-        const r = this.parent(ge);
-        this.width() === 0 && this.height() === 0 && this.size(n.width, n.height), r instanceof ge && r.width() === 0 && r.height() === 0 && r.size(this.width(), this.height()), typeof e == "function" && e.call(this, i);
+        const r = this.parent(ye);
+        this.width() === 0 && this.height() === 0 && this.size(n.width, n.height), r instanceof ye && r.width() === 0 && r.height() === 0 && r.size(this.width(), this.height()), typeof e == "function" && e.call(this, i);
       },
       this
-    ), An(n, "load error", function() {
+    ), Sn(n, "load error", function() {
       Zt(n);
-    }), this.attr("href", n.src = t, be);
+    }), this.attr("href", n.src = t, ve);
   }
 }
 po(function(s, t, e) {
-  return (s === "fill" || s === "stroke") && Rr.test(t) && (t = e.root().defs().image(t)), t instanceof Se && (t = e.root().defs().pattern(0, 0, (n) => {
+  return (s === "fill" || s === "stroke") && Rr.test(t) && (t = e.root().defs().image(t)), t instanceof xe && (t = e.root().defs().pattern(0, 0, (n) => {
     n.add(t);
   })), t;
 });
-T({
+O({
   Container: {
     // create image element, load image and set its size
     image: H(function(s, t) {
-      return this.put(new Se()).size(0, 0).load(s, t);
+      return this.put(new xe()).size(0, 0).load(s, t);
     })
   }
 });
-D(Se, "Image");
+D(xe, "Image");
 class St extends Jt {
   // Get bounding box of points
   bbox() {
@@ -2512,26 +2517,26 @@ const xo = St;
 function Eo(s) {
   return s == null ? this.bbox().x : this.move(s, this.bbox().y);
 }
-function ko(s) {
+function To(s) {
   return s == null ? this.bbox().y : this.move(this.bbox().x, s);
 }
-function To(s) {
+function Oo(s) {
   const t = this.bbox();
   return s == null ? t.width : this.size(s, t.height);
 }
-function Oo(s) {
+function ko(s) {
   const t = this.bbox();
   return s == null ? t.height : this.size(t.width, s);
 }
 const ts = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   MorphArray: xo,
-  height: Oo,
-  width: To,
+  height: ko,
+  width: Oo,
   x: Eo,
-  y: ko
+  y: To
 }, Symbol.toStringTag, { value: "Module" }));
-class ye extends et {
+class we extends et {
   // Initialize node
   constructor(t, e = t) {
     super($("line", t), e);
@@ -2557,20 +2562,20 @@ class ye extends et {
     return this.attr(this.array().size(n.width, n.height).toLine());
   }
 }
-I(ye, ts);
-T({
+I(we, ts);
+O({
   Container: {
     // Create a line element
     line: H(function(...s) {
-      return ye.prototype.plot.apply(
-        this.put(new ye()),
+      return we.prototype.plot.apply(
+        this.put(new we()),
         s[0] != null ? s : [0, 0, 0, 0]
       );
     })
   }
 });
-D(ye, "Line");
-class Pe extends J {
+D(we, "Line");
+class je extends J {
   // Initialize node
   constructor(t, e = t) {
     super($("marker", t), e);
@@ -2599,7 +2604,7 @@ class Pe extends J {
     return this.attr("markerWidth", t);
   }
 }
-T({
+O({
   Container: {
     marker(...s) {
       return this.defs().marker(...s);
@@ -2608,18 +2613,18 @@ T({
   Defs: {
     // Create marker
     marker: H(function(s, t, e) {
-      return this.put(new Pe()).size(s, t).ref(s / 2, t / 2).viewbox(0, 0, s, t).attr("orient", "auto").update(e);
+      return this.put(new je()).size(s, t).ref(s / 2, t / 2).viewbox(0, 0, s, t).attr("orient", "auto").update(e);
     })
   },
   marker: {
     // Create and attach markers
     marker(s, t, e, n) {
       let i = ["marker"];
-      return s !== "all" && i.push(s), i = i.join("-"), s = arguments[1] instanceof Pe ? arguments[1] : this.defs().marker(t, e, n), this.attr(i, s);
+      return s !== "all" && i.push(s), i = i.join("-"), s = arguments[1] instanceof je ? arguments[1] : this.defs().marker(t, e, n), this.attr(i, s);
     }
   }
 });
-D(Pe, "Marker");
+D(je, "Marker");
 function Gt(s, t) {
   return function(e) {
     return e == null ? this[s] : (this[s] = e, t && t.call(this), this);
@@ -2659,7 +2664,7 @@ class es {
     return !1;
   }
 }
-class Sn extends es {
+class xn extends es {
   constructor(t = fe.ease) {
     super(), this.ease = Io[t] || t;
   }
@@ -2667,7 +2672,7 @@ class Sn extends es {
     return typeof t != "number" ? n < 1 ? t : e : t + (e - t) * this.ease(n);
   }
 }
-let je = class extends es {
+let ze = class extends es {
   constructor(t) {
     super(), this.stepper = t;
   }
@@ -2682,7 +2687,7 @@ function Es() {
   const s = (this._duration || 500) / 1e3, t = this._overshoot || 0, e = 1e-10, n = Math.PI, i = Math.log(t / 100 + e), r = -i / Math.sqrt(n * n + i * i), o = 3.9 / (r * s);
   this.d = 2 * r * o, this.k = o * o;
 }
-class No extends je {
+class No extends ze {
   constructor(t = 500, e = 0) {
     super(), this.duration(t).overshoot(e);
   }
@@ -2699,7 +2704,7 @@ I(No, {
   duration: Gt("_duration", Es),
   overshoot: Gt("_overshoot", Es)
 });
-class Do extends je {
+class Do extends ze {
   constructor(t = 0.1, e = 0.01, n = 0, i = 1e3) {
     super(), this.p(t).i(e).d(n).windup(i);
   }
@@ -2730,7 +2735,7 @@ const Co = {
   T: 2,
   A: 7,
   Z: 0
-}, xn = {
+}, En = {
   M: function(s, t, e) {
     return t.x = e.x = s[0], t.y = e.y = s[1], ["M", t.x, t.y];
   },
@@ -2761,9 +2766,9 @@ const Co = {
   A: function(s, t) {
     return t.x = s[5], t.y = s[6], ["A", s[0], s[1], s[2], s[3], s[4], s[5], s[6]];
   }
-}, fn = "mlhvqtcsaz".split("");
-for (let s = 0, t = fn.length; s < t; ++s)
-  xn[fn[s]] = /* @__PURE__ */ function(e) {
+}, dn = "mlhvqtcsaz".split("");
+for (let s = 0, t = dn.length; s < t; ++s)
+  En[dn[s]] = /* @__PURE__ */ function(e) {
     return function(n, i, r) {
       if (e === "H") n[0] = n[0] + i.x;
       else if (e === "V") n[0] = n[0] + i.y;
@@ -2772,18 +2777,18 @@ for (let s = 0, t = fn.length; s < t; ++s)
       else
         for (let o = 0, a = n.length; o < a; ++o)
           n[o] = n[o] + (o % 2 ? i.y : i.x);
-      return xn[e](n, i, r);
+      return En[e](n, i, r);
     };
-  }(fn[s].toUpperCase());
+  }(dn[s].toUpperCase());
 function Mo(s) {
   const t = s.segment[0];
-  return xn[t](s.segment.slice(1), s.p, s.p0);
+  return En[t](s.segment.slice(1), s.p, s.p0);
 }
-function En(s) {
+function Tn(s) {
   return s.segment.length && s.segment.length - 1 === Co[s.segment[0].toUpperCase()];
 }
 function Ro(s, t) {
-  s.inNumber && Ot(s, !1);
+  s.inNumber && kt(s, !1);
   const e = Yn.test(t);
   if (e)
     s.segment = [t];
@@ -2793,11 +2798,11 @@ function Ro(s, t) {
   }
   return s.inSegment = !0, s.lastCommand = s.segment[0], e;
 }
-function Ot(s, t) {
+function kt(s, t) {
   if (!s.inNumber) throw new Error("Parser Error");
-  s.number && s.segment.push(parseFloat(s.number)), s.inNumber = t, s.number = "", s.pointSeen = !1, s.hasExponent = !1, En(s) && kn(s);
+  s.number && s.segment.push(parseFloat(s.number)), s.inNumber = t, s.number = "", s.pointSeen = !1, s.hasExponent = !1, Tn(s) && On(s);
 }
-function kn(s) {
+function On(s) {
   s.inSegment = !1, s.absolute && (s.segment = Mo(s)), s.segments.push(s.segment);
 }
 function Ho(s) {
@@ -2829,7 +2834,7 @@ function Bo(s, t = !0) {
     if (!(!i.inSegment && Ro(i, n))) {
       if (n === ".") {
         if (i.pointSeen || i.hasExponent) {
-          Ot(i, !1), --e;
+          kt(i, !1), --e;
           continue;
         }
         i.inNumber = !0, i.pointSeen = !0, i.number += n;
@@ -2837,19 +2842,19 @@ function Bo(s, t = !0) {
       }
       if (!isNaN(parseInt(n))) {
         if (i.number === "0" || Ho(i)) {
-          i.inNumber = !0, i.number = n, Ot(i, !0);
+          i.inNumber = !0, i.number = n, kt(i, !0);
           continue;
         }
         i.inNumber = !0, i.number += n;
         continue;
       }
       if (Wo.has(n)) {
-        i.inNumber && Ot(i, !1);
+        i.inNumber && kt(i, !1);
         continue;
       }
       if (n === "-" || n === "+") {
         if (i.inNumber && !$o(i)) {
-          Ot(i, !1), --e;
+          kt(i, !1), --e;
           continue;
         }
         i.number += n, i.inNumber = !0;
@@ -2861,15 +2866,15 @@ function Bo(s, t = !0) {
       }
       if (Yn.test(n)) {
         if (i.inNumber)
-          Ot(i, !1);
-        else if (En(i))
-          kn(i);
+          kt(i, !1);
+        else if (Tn(i))
+          On(i);
         else
           throw new Error("parser Error");
         --e;
       }
     }
-  return i.inNumber && Ot(i, !1), i.inSegment && En(i) && kn(i), i.segments;
+  return i.inNumber && kt(i, !1), i.inSegment && Tn(i) && On(i), i.segments;
 }
 function Po(s) {
   let t = "";
@@ -2909,11 +2914,11 @@ class Bt extends Jt {
 }
 const di = (s) => {
   const t = typeof s;
-  return t === "number" ? E : t === "string" ? M.isColor(s) ? M : _t.test(s) ? Yn.test(s) ? Bt : Jt : Vs.test(s) ? E : Tn : ns.indexOf(s.constructor) > -1 ? s.constructor : Array.isArray(s) ? Jt : t === "object" ? we : Tn;
+  return t === "number" ? E : t === "string" ? M.isColor(s) ? M : _t.test(s) ? Yn.test(s) ? Bt : Jt : Vs.test(s) ? E : kn : ns.indexOf(s.constructor) > -1 ? s.constructor : Array.isArray(s) ? Jt : t === "object" ? _e : kn;
 };
 class It {
   constructor(t) {
-    this._stepper = t || new Sn("-"), this._from = null, this._to = null, this._type = null, this._context = null, this._morphObj = null;
+    this._stepper = t || new xn("-"), this._from = null, this._to = null, this._type = null, this._context = null, this._morphObj = null;
   }
   at(t) {
     return this._morphObj.morph(
@@ -2944,12 +2949,12 @@ class It {
   _set(t) {
     this._type || this.type(di(t));
     let e = new this._type(t);
-    return this._type === M && (e = this._to ? e[this._to[4]]() : this._from ? e[this._from[4]]() : e), this._type === we && (e = this._to ? e.align(this._to) : this._from ? e.align(this._from) : e), e = e.toConsumable(), this._morphObj = this._morphObj || new this._type(), this._context = this._context || Array.apply(null, Array(e.length)).map(Object).map(function(n) {
+    return this._type === M && (e = this._to ? e[this._to[4]]() : this._from ? e[this._from[4]]() : e), this._type === _e && (e = this._to ? e.align(this._to) : this._from ? e.align(this._from) : e), e = e.toConsumable(), this._morphObj = this._morphObj || new this._type(), this._context = this._context || Array.apply(null, Array(e.length)).map(Object).map(function(n) {
       return n.done = !0, n;
     }), e;
   }
 }
-class Tn {
+class kn {
   constructor(...t) {
     this.init(...t);
   }
@@ -2963,7 +2968,7 @@ class Tn {
     return this.value;
   }
 }
-class xe {
+class Ee {
   constructor(...t) {
     this.init(...t);
   }
@@ -2977,7 +2982,7 @@ class xe {
       translateY: t[5],
       originX: t[6],
       originY: t[7]
-    }), Object.assign(this, xe.defaults, t), this;
+    }), Object.assign(this, Ee.defaults, t), this;
   }
   toArray() {
     const t = this;
@@ -2993,7 +2998,7 @@ class xe {
     ];
   }
 }
-xe.defaults = {
+Ee.defaults = {
   scaleX: 1,
   scaleY: 1,
   shear: 0,
@@ -3004,7 +3009,7 @@ xe.defaults = {
   originY: 0
 };
 const jo = (s, t) => s[0] < t[0] ? -1 : s[0] > t[0] ? 1 : 0;
-class we {
+class _e {
   constructor(...t) {
     this.init(...t);
   }
@@ -3058,7 +3063,7 @@ class we {
     return t;
   }
 }
-const ns = [Tn, xe, we];
+const ns = [kn, Ee, _e];
 function zo(s = []) {
   ns.push(...[].concat(s));
 }
@@ -3128,7 +3133,7 @@ class he extends et {
   }
 }
 he.prototype.MorphArray = Bt;
-T({
+O({
   Container: {
     // Create a wrapped path element
     path: H(function(s) {
@@ -3140,10 +3145,10 @@ D(he, "Path");
 function Ko() {
   return this._array || (this._array = new St(this.attr("points")));
 }
-function Fo() {
+function Uo() {
   return delete this._array, this;
 }
-function Uo(s, t) {
+function Fo(s, t) {
   return this.attr("points", this.array().move(s, t));
 }
 function qo(s) {
@@ -3159,62 +3164,62 @@ function Zo(s, t) {
 const pi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   array: Ko,
-  clear: Fo,
-  move: Uo,
+  clear: Uo,
+  move: Fo,
   plot: qo,
   size: Zo
 }, Symbol.toStringTag, { value: "Module" }));
-class Ee extends et {
+class Te extends et {
   // Initialize node
   constructor(t, e = t) {
     super($("polygon", t), e);
   }
 }
-T({
+O({
   Container: {
     // Create a wrapped polygon element
     polygon: H(function(s) {
-      return this.put(new Ee()).plot(s || new St());
+      return this.put(new Te()).plot(s || new St());
     })
   }
 });
-I(Ee, ts);
-I(Ee, pi);
-D(Ee, "Polygon");
-class ke extends et {
+I(Te, ts);
+I(Te, pi);
+D(Te, "Polygon");
+class Oe extends et {
   // Initialize node
   constructor(t, e = t) {
     super($("polyline", t), e);
   }
 }
-T({
+O({
   Container: {
     // Create a wrapped polygon element
     polyline: H(function(s) {
-      return this.put(new ke()).plot(s || new St());
+      return this.put(new Oe()).plot(s || new St());
     })
   }
 });
-I(ke, ts);
-I(ke, pi);
-D(ke, "Polyline");
-class Te extends et {
+I(Oe, ts);
+I(Oe, pi);
+D(Oe, "Polyline");
+class ke extends et {
   // Initialize node
   constructor(t, e = t) {
     super($("rect", t), e);
   }
 }
-I(Te, { rx: Vn, ry: Qn });
-T({
+I(ke, { rx: Vn, ry: Qn });
+O({
   Container: {
     // Create a rect element
     rect: H(function(s, t) {
-      return this.put(new Te()).size(s, t);
+      return this.put(new ke()).size(s, t);
     })
   }
 });
-D(Te, "Rect");
-class dn {
+D(ke, "Rect");
+class pn {
   constructor() {
     this._first = null, this._last = null;
   }
@@ -3241,9 +3246,9 @@ class dn {
 }
 const C = {
   nextDraw: null,
-  frames: new dn(),
-  timeouts: new dn(),
-  immediates: new dn(),
+  frames: new pn(),
+  timeouts: new pn(),
+  immediates: new pn(),
   timer: () => N.window.performance || N.window.Date,
   transforms: [],
   frame(s) {
@@ -3294,7 +3299,7 @@ const C = {
   const s = N.window;
   return (s.performance || s.Date).now();
 };
-class mi extends ve {
+class mi extends Ae {
   // Construct a new timeline on the given element
   constructor(t = Yo) {
     super(), this._timeSource = t, this.terminate();
@@ -3419,16 +3424,16 @@ class mi extends ve {
     this._startTime = 0, this._speed = 1, this._persist = 0, this._nextFrame = null, this._paused = !0, this._runners = [], this._runnerIds = [], this._lastRunnerId = -1, this._time = 0, this._lastSourceTime = 0, this._lastStepTime = 0, this._step = this._stepFn.bind(this, !1), this._stepImmediate = this._stepFn.bind(this, !0);
   }
 }
-T({
+O({
   Element: {
     timeline: function(s) {
       return s == null ? (this._timeline = this._timeline || new mi(), this._timeline) : (this._timeline = s, this);
     }
   }
 });
-class tt extends ve {
+class tt extends Ae {
   constructor(t) {
-    super(), this.id = tt.id++, t = t ?? fe.duration, t = typeof t == "function" ? new je(t) : t, this._element = null, this._timeline = null, this.done = !1, this._queue = [], this._duration = typeof t == "number" && t, this._isDeclarative = t instanceof je, this._stepper = this._isDeclarative ? t : new Sn(), this._history = {}, this.enabled = !0, this._time = 0, this._lastTime = 0, this._reseted = !0, this.transforms = new S(), this.transformId = 1, this._haveReversed = !1, this._reverse = !1, this._loopsDone = 0, this._swing = !1, this._wait = 0, this._times = 1, this._frameId = null, this._persist = this._isDeclarative ? !0 : null;
+    super(), this.id = tt.id++, t = t ?? fe.duration, t = typeof t == "function" ? new ze(t) : t, this._element = null, this._timeline = null, this.done = !1, this._queue = [], this._duration = typeof t == "number" && t, this._isDeclarative = t instanceof ze, this._stepper = this._isDeclarative ? t : new xn(), this._history = {}, this.enabled = !0, this._time = 0, this._lastTime = 0, this._reseted = !0, this.transforms = new S(), this.transformId = 1, this._haveReversed = !1, this._reverse = !1, this._loopsDone = 0, this._swing = !1, this._wait = 0, this._times = 1, this._frameId = null, this._persist = this._isDeclarative ? !0 : null;
   }
   static sanitise(t, e, n) {
     let i = 1, r = !1, o = 0;
@@ -3476,7 +3481,7 @@ class tt extends ve {
     return this.queue(null, t);
   }
   ease(t) {
-    return this._stepper = new Sn(t), this;
+    return this._stepper = new xn(t), this;
   }
   /*
   Runner Definitions
@@ -3510,7 +3515,7 @@ class tt extends ve {
     let c;
     if (t == null) {
       const f = function(d) {
-        const g = o * Math.floor(d % (2 * (i + n)) / (i + n)), _ = g && !a || !g && a, x = Math.pow(-1, _) * (d % (i + n)) / n + _;
+        const y = o * Math.floor(d % (2 * (i + n)) / (i + n)), _ = y && !a || !y && a, x = Math.pow(-1, _) * (d % (i + n)) / n + _;
         return Math.max(Math.min(x, 1), 0);
       }, m = r * (i + n) - i;
       return c = e <= 0 ? Math.round(f(1e-5)) : e < m ? f(e) : Math.round(f(m - 1e-5)), c;
@@ -3620,16 +3625,16 @@ class tt extends ve {
   }
 }
 tt.id = 0;
-class ze {
+class Le {
   constructor(t = new S(), e = -1, n = !0) {
     this.transforms = t, this.id = e, this.done = n;
   }
   clearTransformsFromQueue() {
   }
 }
-I([tt, ze], {
+I([tt, Le], {
   mergeWith(s) {
-    return new ze(
+    return new Le(
       s.transforms.lmultiply(this.transforms),
       s.id
     );
@@ -3651,7 +3656,7 @@ class Jo {
   }
   clearBefore(t) {
     const e = this.ids.indexOf(t + 1) || 1;
-    return this.ids.splice(0, e, 0), this.runners.splice(0, e, new ze()).forEach((n) => n.clearTransformsFromQueue()), this;
+    return this.ids.splice(0, e, 0), this.runners.splice(0, e, new Le()).forEach((n) => n.clearTransformsFromQueue()), this;
   }
   edit(t, e) {
     const n = this.ids.indexOf(t + 1);
@@ -3682,7 +3687,7 @@ class Jo {
     return this.ids.splice(e, 1), this.runners.splice(e, 1), this;
   }
 }
-T({
+O({
   Element: {
     animate(s, t, e) {
       const n = tt.sanitise(s, t, e), i = this.timeline();
@@ -3706,7 +3711,7 @@ T({
     },
     _prepareRunner() {
       this._frameId == null && (this._transformationRunners = new Jo().add(
-        new ze(new S(this))
+        new Le(new S(this))
       ));
     }
   }
@@ -3736,10 +3741,10 @@ I(tt, {
       function(o) {
         const a = Object.keys(o), c = Vo(a, r);
         if (c.length) {
-          const l = this.element()[s](c), u = new we(i.from()).valueOf();
+          const l = this.element()[s](c), u = new _e(i.from()).valueOf();
           Object.assign(u, l), i.from(u);
         }
-        const h = new we(i.to()).valueOf();
+        const h = new _e(i.to()).valueOf();
         Object.assign(h, o), i.to(h), r = a, n = o;
       }
     ), this._rememberMorpher(s, i), this;
@@ -3780,29 +3785,29 @@ I(tt, {
     const n = S.isMatrixLike(s);
     e = s.affine != null ? s.affine : e ?? !n;
     const i = new It(this._stepper).type(
-      e ? xe : S
+      e ? Ee : S
     );
     let r, o, a, c, h;
     function l() {
-      o = o || this.element(), r = r || bn(s, o), h = new S(t ? void 0 : o), o._addRunner(this), t || o._clearTransformRunnersBefore(this);
+      o = o || this.element(), r = r || vn(s, o), h = new S(t ? void 0 : o), o._addRunner(this), t || o._clearTransformRunnersBefore(this);
     }
     function u(m) {
       t || this.clearTransform();
-      const { x: d, y: g } = new W(r).transform(
+      const { x: d, y } = new W(r).transform(
         o._currentTransform(this)
       );
-      let _ = new S({ ...s, origin: [d, g] }), x = this._isDeclarative && a ? a : h;
+      let _ = new S({ ...s, origin: [d, y] }), x = this._isDeclarative && a ? a : h;
       if (e) {
-        _ = _.decompose(d, g), x = x.decompose(d, g);
-        const R = _.rotate, U = x.rotate, K = [R - 360, R, R + 360], rt = K.map((an) => Math.abs(an - U)), dt = Math.min(...rt), Lt = rt.indexOf(dt);
+        _ = _.decompose(d, y), x = x.decompose(d, y);
+        const R = _.rotate, F = x.rotate, K = [R - 360, R, R + 360], rt = K.map((cn) => Math.abs(cn - F)), dt = Math.min(...rt), Lt = rt.indexOf(dt);
         _.rotate = K[Lt];
       }
       t && (n || (_.rotate = s.rotate || 0), this._isDeclarative && c && (x.rotate = c)), i.from(x), i.to(_);
-      const k = i.at(m);
-      return c = k.rotate, a = new S(k), this.addTransform(a), o._addRunner(this), i.done();
+      const T = i.at(m);
+      return c = T.rotate, a = new S(T), this.addTransform(a), o._addRunner(this), i.done();
     }
     function f(m) {
-      (m.origin || "center").toString() !== (s.origin || "center").toString() && (r = bn(m, o)), s = { ...m, origin: r };
+      (m.origin || "center").toString() !== (s.origin || "center").toString() && (r = vn(m, o)), s = { ...m, origin: r };
     }
     return this.queue(l, u, f, !0), this._isDeclarative && this._rememberMorpher("transform", i), this;
   },
@@ -3940,12 +3945,12 @@ class ss extends J {
   namespace() {
     return this.isRoot() ? this.attr({ xmlns: qn, version: "1.1" }).attr(
       "xmlns:xlink",
-      be,
-      hn
+      ve,
+      ln
     ) : this.root().namespace();
   }
   removeNamespace() {
-    return this.attr({ xmlns: null, version: null }).attr("xmlns:xlink", null, hn).attr("xmlns:svgjs", null, hn);
+    return this.attr({ xmlns: null, version: null }).attr("xmlns:xlink", null, ln).attr("xmlns:svgjs", null, ln);
   }
   // Check if this is a root svg
   // If not, call root() from this element
@@ -3953,7 +3958,7 @@ class ss extends J {
     return this.isRoot() ? this : super.root();
   }
 }
-T({
+O({
   Container: {
     // Create nested svg document
     nested: H(function() {
@@ -3962,20 +3967,20 @@ T({
   }
 });
 D(ss, "Svg", !0);
-let Qe = class extends J {
+let tn = class extends J {
   // Initialize node
   constructor(t, e = t) {
     super($("symbol", t), e);
   }
 };
-T({
+O({
   Container: {
     symbol: H(function() {
-      return this.put(new Qe());
+      return this.put(new tn());
     })
   }
 });
-D(Qe, "Symbol");
+D(tn, "Symbol");
 function Qo(s) {
   return this._build === !1 && this.clear(), this.node.appendChild(N.document.createTextNode(s)), this;
 }
@@ -4027,7 +4032,7 @@ const wi = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   x: ea,
   y: na
 }, Symbol.toStringTag, { value: "Module" }));
-class F extends et {
+class U extends et {
   // Initialize node
   constructor(t, e = t) {
     super($("text", t), e), this.dom.leading = this.dom.leading ?? new E(1.3), this._rebuild = !0, this._build = !1;
@@ -4043,7 +4048,7 @@ class F extends et {
       let n = 0;
       const i = this.dom.leading;
       this.each(function(r) {
-        if (vn(this.node)) return;
+        if (An(this.node)) return;
         const o = N.window.getComputedStyle(this.node).getPropertyValue("font-size"), a = i * new E(o);
         this.dom.newLined && (this.attr("x", e.attr("x")), this.text() === `
 ` ? n += a : (this.attr("dy", r ? a + n : 0), n = 0));
@@ -4065,7 +4070,7 @@ class F extends et {
       let n = 0;
       t = "";
       for (let i = 0, r = e.length; i < r; ++i) {
-        if (e[i].nodeName === "textPath" || vn(e[i])) {
+        if (e[i].nodeName === "textPath" || An(e[i])) {
           i === 0 && (n = i + 1);
           continue;
         }
@@ -4085,21 +4090,21 @@ class F extends et {
     return this.build(!1).rebuild();
   }
 }
-I(F, wi);
-T({
+I(U, wi);
+O({
   Container: {
     // Create text element
     text: H(function(s = "") {
-      return this.put(new F()).text(s);
+      return this.put(new U()).text(s);
     }),
     // Create plain text element
     plain: H(function(s = "") {
-      return this.put(new F()).plain(s);
+      return this.put(new U()).plain(s);
     })
   }
 });
-D(F, "Text");
-class tn extends et {
+D(U, "Text");
+class en extends et {
   // Initialize node
   constructor(t, e = t) {
     super($("tspan", t), e), this._build = !1;
@@ -4116,7 +4121,7 @@ class tn extends et {
   newLine() {
     this.dom.newLined = !0;
     const t = this.parent();
-    if (!(t instanceof F))
+    if (!(t instanceof U))
       return this;
     const e = t.index(this), n = N.window.getComputedStyle(this.node).getPropertyValue("font-size"), i = t.dom.leading * new E(n);
     return this.dy(e ? i : 0).attr("x", t.x());
@@ -4127,11 +4132,11 @@ class tn extends et {
 ` : "") : (typeof t == "function" ? (this.clear().build(!0), t.call(this, this), this.build(!1)) : this.plain(t), this);
   }
 }
-I(tn, wi);
-T({
+I(en, wi);
+O({
   Tspan: {
     tspan: H(function(s = "") {
-      const t = new tn();
+      const t = new en();
       return this._build || this.clear(), this.put(t).text(s);
     })
   },
@@ -4141,7 +4146,7 @@ T({
     }
   }
 });
-D(tn, "Tspan");
+D(en, "Tspan");
 class is extends et {
   constructor(t, e = t) {
     super($("circle", t), e);
@@ -4162,7 +4167,7 @@ class is extends et {
   }
 }
 I(is, { x: ii, y: ri, cx: oi, cy: ai, width: ci, height: hi });
-T({
+O({
   Container: {
     // Create circle element
     circle: H(function(s = 0) {
@@ -4171,7 +4176,7 @@ T({
   }
 });
 D(is, "Circle");
-class On extends J {
+class In extends J {
   constructor(t, e = t) {
     super($("clipPath", t), e);
   }
@@ -4185,11 +4190,11 @@ class On extends J {
     return ce("svg [clip-path*=" + this.id() + "]");
   }
 }
-T({
+O({
   Container: {
     // Create clipping element
     clip: H(function() {
-      return this.defs().put(new On());
+      return this.defs().put(new In());
     })
   },
   Element: {
@@ -4198,7 +4203,7 @@ T({
       return this.reference("clip-path");
     },
     clipWith(s) {
-      const t = s instanceof On ? s : this.parent().clip().add(s);
+      const t = s instanceof In ? s : this.parent().clip().add(s);
       return this.attr("clip-path", "url(#" + t.id() + ")");
     },
     // Unclip element
@@ -4207,13 +4212,13 @@ T({
     }
   }
 });
-D(On, "ClipPath");
+D(In, "ClipPath");
 class _i extends ft {
   constructor(t, e = t) {
     super($("foreignObject", t), e);
   }
 }
-T({
+O({
   Container: {
     foreignObject: H(function(s, t) {
       return this.put(new _i()).size(s, t);
@@ -4280,7 +4285,7 @@ class B extends J {
   }
 }
 I(B, bi);
-T({
+O({
   Container: {
     // Create a group element
     group: H(function() {
@@ -4289,7 +4294,7 @@ T({
   }
 });
 D(B, "G");
-class Le extends J {
+class Ke extends J {
   constructor(t, e = t) {
     super($("a", t), e);
   }
@@ -4299,15 +4304,15 @@ class Le extends J {
   }
   // Link url
   to(t) {
-    return this.attr("href", t, be);
+    return this.attr("href", t, ve);
   }
 }
-I(Le, bi);
-T({
+I(Ke, bi);
+O({
   Container: {
     // Create a hyperlink element
     link: H(function(s) {
-      return this.put(new Le()).to(s);
+      return this.put(new Ke()).to(s);
     })
   },
   Element: {
@@ -4322,7 +4327,7 @@ T({
     },
     linkTo(s) {
       let t = this.linker();
-      return t || (t = new Le(), this.wrap(t)), typeof s == "function" ? s.call(t, t) : t.to(s), this;
+      return t || (t = new Ke(), this.wrap(t)), typeof s == "function" ? s.call(t, t) : t.to(s), this;
     },
     linker() {
       const s = this.parent();
@@ -4330,8 +4335,8 @@ T({
     }
   }
 });
-D(Le, "A");
-class In extends J {
+D(Ke, "A");
+class Nn extends J {
   // Initialize node
   constructor(t, e = t) {
     super($("mask", t), e);
@@ -4346,10 +4351,10 @@ class In extends J {
     return ce("svg [mask*=" + this.id() + "]");
   }
 }
-T({
+O({
   Container: {
     mask: H(function() {
-      return this.defs().put(new In());
+      return this.defs().put(new Nn());
     })
   },
   Element: {
@@ -4358,7 +4363,7 @@ T({
       return this.reference("mask");
     },
     maskWith(s) {
-      const t = s instanceof In ? s : this.parent().mask().add(s);
+      const t = s instanceof Nn ? s : this.parent().mask().add(s);
       return this.attr("mask", "url(#" + t.id() + ")");
     },
     // Unmask element
@@ -4367,7 +4372,7 @@ T({
     }
   }
 });
-D(In, "Mask");
+D(Nn, "Mask");
 class vi extends ft {
   constructor(t, e = t) {
     super($("stop", t), e);
@@ -4381,7 +4386,7 @@ class vi extends ft {
     }), t.opacity != null && this.attr("stop-opacity", t.opacity), t.color != null && this.attr("stop-color", t.color), t.offset != null && this.attr("offset", new E(t.offset)), this;
   }
 }
-T({
+O({
   Gradient: {
     // Add a color stop
     stop: function(s, t, e) {
@@ -4398,7 +4403,7 @@ function ba(s, t) {
     e += ur(n) + ":" + t[n] + ";";
   return e += "}", e;
 }
-class Nn extends ft {
+class Dn extends ft {
   constructor(t, e = t) {
     super($("style", t), e);
   }
@@ -4416,16 +4421,16 @@ class Nn extends ft {
     return this.addText(ba(t, e));
   }
 }
-T("Dom", {
+O("Dom", {
   style(s, t) {
-    return this.put(new Nn()).rule(s, t);
+    return this.put(new Dn()).rule(s, t);
   },
   fontface(s, t, e) {
-    return this.put(new Nn()).font(s, t, e);
+    return this.put(new Dn()).font(s, t, e);
   }
 });
-D(Nn, "Style");
-class rs extends F {
+D(Dn, "Style");
+class rs extends U {
   // Initialize node
   constructor(t, e = t) {
     super($("textPath", t), e);
@@ -4446,17 +4451,17 @@ class rs extends F {
     return this.reference("href");
   }
 }
-T({
+O({
   Container: {
     textPath: H(function(s, t) {
-      return s instanceof F || (s = this.text(s)), s.path(t);
+      return s instanceof U || (s = this.text(s)), s.path(t);
     })
   },
   Text: {
     // Create path for text to run on
     path: H(function(s, t = !0) {
       const e = new rs();
-      s instanceof he || (s = this.defs().path(s)), e.attr("href", "#" + s, be);
+      s instanceof he || (s = this.defs().path(s)), e.attr("href", "#" + s, ve);
       let n;
       if (t)
         for (; n = this.node.firstChild; )
@@ -4471,7 +4476,7 @@ T({
   Path: {
     // creates a textPath from this path
     text: H(function(s) {
-      return s instanceof F || (s = new F().addTo(this.parent()).text(s)), s.path(this);
+      return s instanceof U || (s = new U().addTo(this.parent()).text(s)), s.path(this);
     }),
     targets() {
       return ce("svg textPath").filter((s) => (s.attr("href") || "").includes(this.id()));
@@ -4480,37 +4485,37 @@ T({
 });
 rs.prototype.MorphArray = Bt;
 D(rs, "TextPath");
-class en extends et {
+class nn extends et {
   constructor(t, e = t) {
     super($("use", t), e);
   }
   // Use element as a reference
   use(t, e) {
-    return this.attr("href", (e || "") + "#" + t, be);
+    return this.attr("href", (e || "") + "#" + t, ve);
   }
 }
-T({
+O({
   Container: {
     // Create a use element
     use: H(function(s, t) {
-      return this.put(new en()).use(s, t);
+      return this.put(new nn()).use(s, t);
     })
   }
 });
-D(en, "Use");
-I([ss, Qe, Se, ge, Pe], X("viewbox"));
-I([ye, ke, Ee, he], X("marker"));
-I(F, X("Text"));
+D(nn, "Use");
+I([ss, tn, xe, ye, je], X("viewbox"));
+I([we, Oe, Te, he], X("marker"));
+I(U, X("Text"));
 I(he, X("Path"));
 I(Jn, X("Defs"));
-I([F, tn], X("Tspan"));
-I([Te, Ve, Ae, tt], X("radius"));
-I(ve, X("EventTarget"));
+I([U, en], X("Tspan"));
+I([ke, Qe, Se, tt], X("radius"));
+I(Ae, X("EventTarget"));
 I(At, X("Dom"));
 I(ft, X("Element"));
 I(et, X("Shape"));
 I([J, li], X("Container"));
-I(Ae, X("Gradient"));
+I(Se, X("Gradient"));
 I(tt, X("Runner"));
 Wt.extend(hr());
 zo([
@@ -4534,8 +4539,8 @@ const ot = (s, t) => {
   }, 0);
   return { width: s.tiles.reduce((a, c) => a + Q(c, t).width, 0), height: r };
 }, Q = (s, t) => {
-  const e = parseFloat((Rt.HEIGHT * t).toPrecision(5)), n = parseFloat((Rt.WIDTH * t).toPrecision(5)), i = s.has(y.HORIZONTAL) ? { width: e, height: n, baseWidth: n, baseHeight: e } : { width: n, height: e, w: n, baseWidth: n, baseHeight: e };
-  return (s.has(y.TSUMO) || s.has(y.DORA)) && (i.width += n * Rt.TEXT_SCALE), i;
+  const e = parseFloat((Rt.HEIGHT * t).toPrecision(5)), n = parseFloat((Rt.WIDTH * t).toPrecision(5)), i = s.has(g.HORIZONTAL) ? { width: e, height: n, baseWidth: n, baseHeight: e } : { width: n, height: e, w: n, baseWidth: n, baseHeight: e };
+  return (s.has(g.TSUMO) || s.has(g.DORA)) && (i.width += n * Rt.TEXT_SCALE), i;
 };
 class Vt {
   constructor(t = {}) {
@@ -4554,15 +4559,15 @@ class Vt {
   }
   // image wrapper
   image(t) {
-    let e = new Se().load(this.buildURL(t));
-    return this.svgSprite && (e = new en().use(Vt.buildID(t))), t instanceof w && t.has(y.COLOR_GRAYSCALE) && e.css({ filter: "contrast(65%)" }), e;
+    let e = new xe().load(this.buildURL(t));
+    return this.svgSprite && (e = new nn().use(Vt.buildID(t))), t instanceof w && t.has(g.COLOR_GRAYSCALE) && e.css({ filter: "contrast(65%)" }), e;
   }
   createImage(t, e, n) {
     const i = Q(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 = Q(t, this.scale), a = o.baseHeight * 0.2, c = o.baseWidth, h = o.baseHeight, l = new F().text(i);
+    const r = this.createImage(t, e, n), o = Q(t, this.scale), a = o.baseHeight * 0.2, c = o.baseWidth, h = o.baseHeight, l = new U().text(i);
     l.size(o.baseWidth, o.baseHeight).font({
       family: zs,
       size: a
@@ -4580,7 +4585,7 @@ class Vt {
   static buildID(t) {
     if (t == 100 || t == 1e3)
       return t == 100 ? "stick100" : "stick1000";
-    const e = t.t == p.BACK || t.has(y.RED) ? 0 : t.n;
+    const e = t.t == p.BACK || t.has(g.RED) ? 0 : t.n;
     return `${t.t}${e}`;
   }
   buildURL(t) {
@@ -4597,30 +4602,30 @@ class Ai extends Vt {
     const n = e instanceof Z ? e.tilesWithBack : e.tiles, i = new B();
     let r = 0;
     for (let o of n) {
-      const a = Q(o, this.scale), c = o.has(y.HORIZONTAL) ? this.createRotate90Image.bind(this) : this.createImage.bind(this), h = o.has(y.HORIZONTAL) ? this.getDiffTileHeightWidth(o) : 0, l = c(o, r, h);
+      const a = Q(o, this.scale), c = o.has(g.HORIZONTAL) ? this.createRotate90Image.bind(this) : this.createImage.bind(this), h = o.has(g.HORIZONTAL) ? this.getDiffTileHeightWidth(o) : 0, l = c(o, r, h);
       i.add(l), r += a.width;
     }
     return i;
   }
   createBlockPonChiKan(e) {
-    const n = e.tiles.findIndex((o) => o.has(y.HORIZONTAL));
+    const n = e.tiles.findIndex((o) => o.has(g.HORIZONTAL));
     let i = 0;
     const r = new B();
     if (e.type == b.SHO_KAN) {
       let o = n;
       for (let a = 0; a < e.tiles.length; a++)
-        e.tiles[a].has(y.HORIZONTAL) && (o = a);
+        e.tiles[a].has(g.HORIZONTAL) && (o = a);
       for (let a = 0; a < e.tiles.length; a++) {
         const c = Q(e.tiles[a], this.scale);
         if (a == o) continue;
         if (a == n) {
-          const u = e.tiles[n], f = e.tiles[o], m = Q(u, this.scale), d = this.createRotate90Image(u, 0, 0, !0), g = this.createRotate90Image(
+          const u = e.tiles[n], f = e.tiles[o], m = Q(u, this.scale), d = this.createRotate90Image(u, 0, 0, !0), y = this.createRotate90Image(
             f,
             0,
             m.height,
             !0
           );
-          r.add(new B().translate(i, 0).add(d).add(g)), i += m.width;
+          r.add(new B().translate(i, 0).add(d).add(y)), i += m.width;
           continue;
         }
         const h = c.width * 2 - c.height, l = this.createImage(e.tiles[a], i, h);
@@ -4649,89 +4654,95 @@ class Ai extends Vt {
     return r;
   }
 }
-const va = (s) => {
-  const t = s.scale;
+const va = (s, t) => {
+  const e = s.scale;
   return {
-    [b.CHI]: function(n) {
-      const i = ot(n, t), r = s.createBlockPonChiKan(n);
-      return { ...i, e: r };
+    [b.CHI]: function(i) {
+      const r = ot(i, e), o = s.createBlockPonChiKan(i);
+      return { ...r, e: o };
     },
-    [b.PON]: function(n) {
-      const i = ot(n, t), r = s.createBlockPonChiKan(n);
-      return { ...i, e: r };
+    [b.PON]: function(i) {
+      const r = ot(i, e), o = s.createBlockPonChiKan(i);
+      return { ...r, e: o };
     },
-    [b.DAI_KAN]: function(n) {
-      const i = ot(n, t), r = s.createBlockPonChiKan(n);
-      return { ...i, e: r };
+    [b.DAI_KAN]: function(i) {
+      const r = ot(i, e), o = s.createBlockPonChiKan(i);
+      return { ...r, e: o };
     },
-    [b.SHO_KAN]: function(n) {
-      const i = ot(n, t), r = s.createBlockPonChiKan(n);
-      return { ...i, e: r };
+    [b.SHO_KAN]: function(i) {
+      const r = ot(i, e), o = s.createBlockPonChiKan(i);
+      return { ...r, e: o };
     },
-    [b.AN_KAN]: function(n) {
-      O(
-        n instanceof Z,
-        `block type is not ankan: ${n.type}`
+    [b.AN_KAN]: function(i) {
+      k(
+        i instanceof Z,
+        `block type is not ankan: ${i.type}`
       );
-      const i = ot(n, t), r = s.createBlockHandDiscard(n);
-      return { ...i, e: r };
+      const r = ot(i, e), o = s.createBlockHandDiscard(i);
+      return { ...r, e: o };
     },
-    [b.IMAGE_DORA]: function(n) {
-      const i = ot(n, t), r = new B(), o = s.createTextImage(n.tiles[0], 0, 0, "(ドラ)");
-      return r.add(o), { ...i, e: r };
+    [b.IMAGE_DORA]: function(i) {
+      i = (t == null ? void 0 : t.doraText) == !1 ? new me([i.tiles[0].clone({ remove: g.DORA })]) : i;
+      const r = ot(i, e), o = new B(), a = (t == null ? void 0 : t.doraText) === !1 ? s.createBlockHandDiscard(i) : s.createTextImage(i.tiles[0], 0, 0, "(ドラ)");
+      return o.add(a), { ...r, e: o };
     },
-    [b.TSUMO]: function(n) {
-      const i = ot(n, t), r = new B(), o = s.createTextImage(n.tiles[0], 0, 0, "(ツモ)");
-      return r.add(o), { ...i, e: r };
+    [b.TSUMO]: function(i) {
+      i = (t == null ? void 0 : t.tsumoText) == !1 ? new me([i.tiles[0].clone({ remove: g.TSUMO })]) : i;
+      const r = ot(i, e), o = new B(), a = (t == null ? void 0 : t.tsumoText) === !1 ? s.createBlockHandDiscard(i) : s.createTextImage(i.tiles[0], 0, 0, "(ツモ)");
+      return o.add(a), { ...r, e: o };
     },
-    [b.HAND]: function(n) {
-      const i = ot(n, t), r = s.createBlockHandDiscard(n);
-      return { ...i, e: r };
+    [b.HAND]: function(i) {
+      const r = ot(i, e), o = s.createBlockHandDiscard(i);
+      return { ...r, e: o };
     },
-    [b.IMAGE_DISCARD]: function(n) {
-      const i = ot(n, t), r = s.createBlockHandDiscard(n);
-      return { ...i, e: r };
+    [b.IMAGE_DISCARD]: function(i) {
+      const r = ot(i, e), o = s.createBlockHandDiscard(i);
+      return { ...r, e: o };
     },
-    [b.THREE]: function(n) {
+    [b.THREE]: function(i) {
       throw new Error("three is unsupported");
     },
-    [b.RUN]: function(n) {
+    [b.RUN]: function(i) {
       throw new Error("run is unsupported");
     },
-    [b.PAIR]: function(n) {
+    [b.PAIR]: function(i) {
       throw new Error("pair is unsupported");
     },
-    [b.ISOLATED]: function(n) {
+    [b.ISOLATED]: function(i) {
       throw new Error("isolated is unsupported");
     },
-    [b.UNKNOWN]: function(n) {
-      if (n.tiles.some((o) => o.has(y.TSUMO) || o.has(y.DORA)))
+    [b.UNKNOWN]: function(i) {
+      if (i.tiles.some((a) => a.has(g.TSUMO) || a.has(g.DORA)))
         throw new Error("found an unknown block with operator tiles");
-      const i = ot(n, t), r = s.createBlockHandDiscard(n);
-      return { ...i, e: r };
+      const r = ot(i, e), o = s.createBlockHandDiscard(i);
+      return { ...r, e: o };
     }
   };
-}, de = (s, t) => {
-  const { maxHeight: e, sumWidth: n } = t.reduce(
-    (l, u) => {
-      const f = ot(u, s.scale);
-      return { maxHeight: f.height > l.maxHeight ? f.height : l.maxHeight, sumWidth: l.sumWidth + f.width };
+}, de = (s, t, e) => {
+  const { maxHeight: n, sumWidth: i } = t.reduce(
+    (u, f) => {
+      const m = ot(f, s.scale);
+      return { maxHeight: m.height > u.maxHeight ? m.height : u.maxHeight, sumWidth: u.sumWidth + m.width };
     },
     { maxHeight: 0, sumWidth: 0 }
-  ), i = e, r = n + (t.length - 1) * s.blockMargin, o = va(s), a = [];
-  for (let l of t) {
-    const u = o[l.type], f = u(l);
-    a.push(f);
-  }
-  const c = new B();
-  let h = 0;
-  for (let l of a) {
-    const u = i - l.height, f = new B().translate(h, u);
-    f.add(l.e), c.add(f), h += l.width + s.blockMargin;
-  }
-  return { e: c, width: r, height: i };
-}, ph = (s, t, e = {}, n = { responsive: !1 }) => {
-  const i = new Ai(e), r = de(i, t);
+  ), r = n, o = i + (t.length - 1) * s.blockMargin, a = va(s, e), c = [];
+  for (let u of t) {
+    const f = a[u.type], m = f(u);
+    c.push(m);
+  }
+  const h = new B();
+  let l = 0;
+  for (let u of c) {
+    const f = r - u.height, m = new B().translate(l, f);
+    m.add(u.e), h.add(m), l += u.width + s.blockMargin;
+  }
+  return { e: h, width: o, height: r };
+}, ph = (s, t, e = {}, n = {
+  responsive: !1,
+  doraText: !0,
+  tsumoText: !0
+}) => {
+  const i = new Ai(e), r = de(i, t, n);
   n.responsive || s.size(r.width, r.height), s.viewbox(0, 0, r.width, r.height), s.add(r.e);
 }, Si = () => {
   const s = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9], t = [];
@@ -4749,7 +4760,7 @@ const va = (s) => {
   const t = Si(), e = [];
   return s.each((n, i) => {
     const r = i[n];
-    if (r instanceof en) {
+    if (r instanceof nn) {
       const a = r.attr("href").substring(1);
       t.includes(a) && e.push(a);
     }
@@ -4758,7 +4769,7 @@ const va = (s) => {
   const t = Si(), e = Aa(s);
   s.each((n, i) => {
     const r = i[n];
-    r instanceof Qe && (t.includes(r.id()) && e.includes(r.id()) || r.remove());
+    r instanceof tn && (t.includes(r.id()) && e.includes(r.id()) || r.remove());
   }, !0);
 }, Sa = (s) => {
   const e = [];
@@ -4782,11 +4793,11 @@ const va = (s) => {
     return o.rotate(n, 0, e).translate(a, c), o;
   }
   return o;
-}, Ie = (s, t) => {
+}, Ne = (s, t) => {
   const e = new B(), n = Sa(s);
   for (let i = 0; i < n.length; i++) {
     let r = n[i], o = i * t.tileHeight;
-    const a = t.createBlockHandDiscard(new Fs(r, b.IMAGE_DISCARD)).translate(0, o);
+    const a = t.createBlockHandDiscard(new Us(r, b.IMAGE_DISCARD)).translate(0, o);
     e.add(a);
   }
   return {
@@ -4797,12 +4808,12 @@ const va = (s) => {
 }, xa = (s, t, e) => {
   const n = t.font, i = t.textWidth, r = t.textHeight, o = new B(), a = e.sticks.dead, c = e.sticks.reach, h = 125 * s.scale, l = 27.5 * s.scale;
   let u = i * 3, f = r;
-  const m = (h + s.tileWidth + i - u) / 2, d = new F().plain(e.round).font(n).move(m, 0);
+  const m = (h + s.tileWidth + i - u) / 2, d = new U().plain(e.round).font(n).move(m, 0);
   o.add(d), f += 25 * s.scale;
-  const g = s.tileHeight, _ = new B().size(h, g).translate(0, f), x = { family: n.family, size: n.size * 0.7 }, k = s.createStick(1e3).size(h, l).move(0, 0), R = new F().plain(c.toString()).font(x).attr({ x: h, y: l });
-  _.add(k), _.add(R);
-  const U = s.createStick(100).size(h, l).move(0, l + l), K = new F().plain(a.toString()).font(x).attr({ x: h, y: l * 3 });
-  _.add(U), _.add(K);
+  const y = s.tileHeight, _ = new B().size(h, y).translate(0, f), x = { family: n.family, size: n.size * 0.7 }, T = s.createStick(1e3).size(h, l).move(0, 0), R = new U().plain(c.toString()).font(x).attr({ x: h, y: l });
+  _.add(T), _.add(R);
+  const F = s.createStick(100).size(h, l).move(0, l + l), K = new U().plain(a.toString()).font(x).attr({ x: h, y: l * 3 });
+  _.add(F), _.add(K);
   const rt = s.createImage(e.doras[0], 0, 0).move(h + i, 0);
   return _.add(rt), o.add(d), o.add(_), {
     e: o,
@@ -4811,7 +4822,7 @@ const va = (s) => {
   };
 }, Ea = (s, t, e = 0) => {
   const n = de(s, t.front), i = de(s, t.right), r = de(s, t.opposite), o = de(s, t.left), a = [n.width, i.width, r.width, o.width].reduce(
-    (g, _) => Math.max(g, _)
+    (y, _) => Math.max(y, _)
   ), c = Math.max(
     e + s.tileHeight * 2 + s.blockMargin * 2,
     a + s.tileWidth * 2 + s.blockMargin
@@ -4829,27 +4840,27 @@ const va = (s) => {
     (c - o.width) / 2
   );
   return l.add(u), l.add(f), l.add(m), l.add(d), { e: l, width: c, height: h };
-}, ka = (s) => {
-  const t = Object.values(Ln), e = t.indexOf(s);
+}, Ta = (s) => {
+  const t = Object.values(Kn), e = t.indexOf(s);
   return [...t.slice(e), ...t.slice(0, e)];
-}, Ta = (s, t, e) => {
-  const n = s.tileWidth * 5 + s.tileHeight * 1, i = new B(), r = new Te().size(n, n).move(0, 0).fill("none").stroke("#000000");
+}, Oa = (s, t, e) => {
+  const n = s.tileWidth * 5 + s.tileHeight * 1, i = new B(), r = new ke().size(n, n).move(0, 0).fill("none").stroke("#000000");
   i.add(r);
   const o = t.font, a = t.textWidth, c = t.textHeight, h = t.numWidth, l = xa(s, t, e);
   l.e.translate(
     n / 2 - l.width / 2,
     n / 2 - l.height / 2
   );
-  const u = (an, gs, Yi) => {
-    const Xi = `${an} ${gs}`, Ji = new F().plain(Xi).font(o).attr(Yi);
+  const u = (cn, gs, Yi) => {
+    const Xi = `${cn} ${gs}`, Ji = new U().plain(Xi).font(o).attr(Yi);
     return {
       e: new B().add(Ji),
       width: a + h * gs.toString().length,
       height: c
     };
-  }, [f, m, d, g] = ka(
+  }, [f, m, d, y] = Ta(
     e.frontPlace
-  ), _ = e.scores, k = u(f, _.front, {
+  ), _ = e.scores, T = u(f, _.front, {
     x: n / 2,
     y: n,
     "dominant-baseline": "text-after-edge",
@@ -4859,7 +4870,7 @@ const va = (s) => {
     "dominant-baseline": "text-after-edge",
     "text-anchor": "middle"
   });
-  const U = at(R.e, R.width, R.height, 270).translate(
+  const F = at(R.e, R.width, R.height, 270).translate(
     n,
     n / 2 - R.width
   );
@@ -4871,7 +4882,7 @@ const va = (s) => {
     n / 2 - K.width,
     -K.height
   );
-  let dt = u(g, _.left, {
+  let dt = u(y, _.left, {
     "dominant-baseline": "ideographic",
     "text-anchor": "middle"
   });
@@ -4879,14 +4890,14 @@ const va = (s) => {
     -dt.height,
     n / 2
   );
-  return i.add(l.e), i.add(k), i.add(U), i.add(rt), i.add(Lt), { e: i, width: n, height: n };
-}, Oa = (s, t) => {
-  const e = Ie(t.front, s), n = Ie(t.right, s), i = Ie(t.opposite, s), r = Ie(t.left, s), o = [e.height, n.height, i.height, r.height].reduce(
-    (k, R) => Math.max(k, R)
+  return i.add(l.e), i.add(T), i.add(F), i.add(rt), i.add(Lt), { e: i, width: n, height: n };
+}, ka = (s, t) => {
+  const e = Ne(t.front, s), n = Ne(t.right, s), i = Ne(t.opposite, s), r = Ne(t.left, s), o = [e.height, n.height, i.height, r.height].reduce(
+    (T, R) => Math.max(T, R)
   ), a = s.tileWidth * 5 + s.tileHeight * 1, c = o, h = a + o * 2 + s.blockMargin, l = h, u = new B().size(h, l), f = h / 2 - a / 2, m = l / 2 - a / 2, d = at(e.e, a, c, 0).translate(
     f,
     l - c
-  ), g = at(n.e, a, c, 270).translate(
+  ), y = at(n.e, a, c, 270).translate(
     h - c,
     m
   ), _ = at(
@@ -4898,9 +4909,9 @@ const va = (s) => {
     0,
     m
   );
-  return u.add(d), u.add(g), u.add(_), u.add(x), { e: u, width: h, height: l };
+  return u.add(d), u.add(y), u.add(_), u.add(x), { e: u, width: h, height: l };
 }, Ia = (s, t, e, n, i) => {
-  const r = new B(), o = Oa(s, n), a = Ea(s, e, o.height), c = Ta(s, t, i);
+  const r = new B(), o = ka(s, n), a = Ea(s, e, o.height), c = Oa(s, t, i);
   return o.e.translate(
     (a.width - o.width) / 2,
     (a.height - o.height) / 2
@@ -4921,18 +4932,18 @@ function Na(s) {
     abortPipeEarly: (s == null ? void 0 : s.abortPipeEarly) ?? (pt == null ? void 0 : pt.abortPipeEarly)
   };
 }
-var pn;
-function Da(s) {
-  return pn == null ? void 0 : pn.get(s);
-}
 var mn;
-function Ca(s) {
+function Da(s) {
   return mn == null ? void 0 : mn.get(s);
 }
 var gn;
+function Ca(s) {
+  return gn == null ? void 0 : gn.get(s);
+}
+var yn;
 function Ma(s, t) {
   var e;
-  return (e = gn == null ? void 0 : gn.get(s)) == null ? void 0 : e.get(t);
+  return (e = yn == null ? void 0 : yn.get(s)) == null ? void 0 : e.get(t);
 }
 function Qt(s) {
   var e, n;
@@ -4963,11 +4974,11 @@ function Ra(s, t) {
   const e = [...new Set(s)];
   return e.length > 1 ? `(${e.join(` ${t} `)})` : e[0] ?? "never";
 }
-function Dn(s, t) {
+function Cn(s, t) {
   return {
     kind: "validation",
     type: "max_value",
-    reference: Dn,
+    reference: Cn,
     async: !1,
     expects: `<=${s instanceof Date ? s.toJSON() : Qt(s)}`,
     requirement: s,
@@ -4979,11 +4990,11 @@ function Dn(s, t) {
     }
   };
 }
-function Cn(s, t) {
+function Mn(s, t) {
   return {
     kind: "validation",
     type: "min_value",
-    reference: Cn,
+    reference: Mn,
     async: !1,
     expects: `>=${s instanceof Date ? s.toJSON() : Qt(s)}`,
     requirement: s,
@@ -5004,11 +5015,11 @@ function Ha(s, t, e) {
     s.default
   );
 }
-function Ke(s) {
+function Ue(s) {
   return {
     kind: "schema",
     type: "number",
-    reference: Ke,
+    reference: Ue,
     expects: "number",
     async: !1,
     message: s,
@@ -5035,11 +5046,11 @@ function it(s, ...t) {
   };
   return 0 in t && (e.default = t[0]), e;
 }
-function Mn(s, t) {
+function Rn(s, t) {
   return {
     kind: "schema",
     type: "picklist",
-    reference: Mn,
+    reference: Rn,
     expects: Ra(s.map(Qt), "|"),
     async: !1,
     options: s,
@@ -5124,7 +5135,7 @@ function Fe(s) {
     }
   };
 }
-function ks(...s) {
+function Ts(...s) {
   return {
     ...s[0],
     pipe: s,
@@ -5153,18 +5164,18 @@ function $a(s, t, e) {
     issues: n.issues
   };
 }
-const Ne = it(
+const De = it(
   te({
     discard: it(Fe(), ""),
     hand: it(Fe(), ""),
-    score: it(Ke(), 25e3)
+    score: it(Ue(), 25e3)
   }),
   { discard: "", hand: "", score: 25e3 }
 ), Wa = te({
-  [v.E]: Ne,
-  [v.S]: Ne,
-  [v.W]: Ne,
-  [v.N]: Ne
+  [v.E]: De,
+  [v.S]: De,
+  [v.W]: De,
+  [v.N]: De
 }), Et = {
   round: j.E1,
   sticks: { reach: 0, dead: 0 },
@@ -5173,17 +5184,17 @@ const Ne = it(
 }, Ba = it(
   te({
     round: it(
-      Mn(Object.keys(Ls)),
+      Rn(Object.keys(Ls)),
       Et.round
     ),
     sticks: it(
       te({
         reach: it(
-          ks(Ke(), Cn(0, ""), Dn(9, "")),
+          Ts(Ue(), Mn(0, ""), Cn(9, "")),
           Et.sticks.reach
         ),
         dead: it(
-          ks(Ke(), Cn(0, ""), Dn(9, "")),
+          Ts(Ue(), Mn(0, ""), Cn(9, "")),
           Et.sticks.dead
         )
       }),
@@ -5191,7 +5202,7 @@ const Ne = it(
     ),
     doras: it(Fe(), Et.doras),
     front: it(
-      Mn(Object.keys(Ln)),
+      Rn(Object.keys(Kn)),
       Et.front
     )
   }),
@@ -5201,7 +5212,7 @@ const Ne = it(
   board: Ba
 }), ja = (s) => {
   const t = za(s);
-  return Ua(t);
+  return Fa(t);
 }, za = (s) => {
   const t = La(s), e = $a(Pa, t);
   if (!e.success)
@@ -5222,7 +5233,7 @@ const Ne = it(
     const c = o.find((h) => a.startsWith(h));
     if (c == null) throw new Error(`encountered unexpected line ${a}`);
     if (o = o.filter((h) => !a.startsWith(h)), c == e) {
-      const [h, l] = Fa([...n]);
+      const [h, l] = Ua([...n]);
       r.board = h;
       for (let u = 0; u < l; u++) n.shift();
     } else {
@@ -5243,7 +5254,7 @@ const Ne = it(
     else break;
   }
   return [i, r];
-}, Fa = (s) => {
+}, Ua = (s) => {
   const t = "doras", e = "round", n = "front", i = "sticks", r = "reach", o = "dead";
   let a = {}, c = 0;
   for (; c < s.length; c++) {
@@ -5261,7 +5272,7 @@ const Ne = it(
     } else break;
   }
   return [a, c];
-}, Ua = (s) => {
+}, Fa = (s) => {
   const t = s.board.front, e = qa(t), n = (a) => s[a].discard.replace(/\r?\n/g, ""), i = {
     front: new nt(n(e.front)).tiles(),
     right: new nt(n(e.right)).tiles(),
@@ -5274,7 +5285,7 @@ const Ne = it(
     left: new nt(s[e.left].hand).parse()
   }, o = {
     round: Ls[s.board.round],
-    frontPlace: Ln[t],
+    frontPlace: Kn[t],
     sticks: s.board.sticks,
     doras: new nt(s.board.doras).tiles(),
     scores: {
@@ -5291,7 +5302,7 @@ const Ne = it(
   opposite: Ht(Ht(s)),
   left: cr(s)
 });
-class nn {
+class sn {
   constructor(t, e = !1) {
     A(this, "data");
     this.data = {
@@ -5333,22 +5344,22 @@ class nn {
     for (let e of Object.values(p))
       for (let n = 1; n < this.getArrayLen(e); n++) {
         let i = this.get(e, n);
-        e != p.Z && n == 5 && this.get(e, 0) > 0 && (i -= this.get(e, 0), t.push(new w(e, 5, [y.RED])));
+        e != p.Z && n == 5 && this.get(e, 0) > 0 && (i -= this.get(e, 0), t.push(new w(e, 5, [g.RED])));
         for (let r = 0; r < i; r++)
           t.push(new w(e, n));
       }
     if (this.drawn != null) {
       const e = this.drawn, n = t.findIndex((i) => i.equals(e));
-      O(
+      k(
         n >= 0,
         `hand has drawn: ${this.drawn} but no tile in hands: ${t.join("")}`
-      ), t[n] = t[n].clone({ add: y.TSUMO });
+      ), t[n] = t[n].clone({ add: g.TSUMO });
     }
     return t;
   }
   toString() {
-    const t = this.called.length > 0 ? `${Dt}${this.called.join(Dt)}` : "", e = this.drawn ? `${Dt}${this.drawn.toString()}` : "", n = this.hands.filter((r) => !r.has(y.TSUMO));
-    return `${new Fn(n).toString()}${e}${t}`;
+    const t = this.called.length > 0 ? `${Dt}${this.called.join(Dt)}` : "", e = this.drawn ? `${Dt}${this.drawn.toString()}` : "", n = this.hands.filter((r) => !r.has(g.TSUMO));
+    return `${new me(n).toString()}${e}${t}`;
   }
   get called() {
     return this.data.called;
@@ -5376,29 +5387,29 @@ class nn {
   inc(t) {
     const e = [];
     for (let n of t) {
-      if (O(!(n.isNum() && n.n == 0), `found 0s/0p/0m ${n.toString()}`), n.t != p.BACK && this.get(n.t, n.n) >= 4 || n.has(y.RED) && this.get(n.t, 0) > 0)
+      if (k(!(n.isNum() && n.n == 0), `found 0s/0p/0m ${n.toString()}`), n.t != p.BACK && this.get(n.t, n.n) >= 4 || n.has(g.RED) && this.get(n.t, 0) > 0)
         throw this.dec(e), new Error(`unable to increase ${n} in ${this.toString()}`);
-      e.push(n), n.t == p.BACK ? this.data[n.t][1] += 1 : (this.data[n.t][n.n] += 1, n.has(y.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(g.RED) && (this.data[n.t][0] += 1));
     }
     return e;
   }
   dec(t) {
     const e = [];
     for (let n of t) {
-      if (O(!(n.isNum() && n.n == 0), `found 0s/0p/0m ${n.toString()}`), this.get(n.t, n.n) < 1 || n.has(y.RED) && this.get(n.t, 0) <= 0)
+      if (k(!(n.isNum() && n.n == 0), `found 0s/0p/0m ${n.toString()}`), this.get(n.t, n.n) < 1 || n.has(g.RED) && this.get(n.t, 0) <= 0)
         throw this.inc(e), new Error(
           `unable to decrease ${n.toString()} in ${this.toString()}`
         );
-      if (e.push(n), n.t == p.BACK ? this.data[n.t][1] -= 1 : (this.data[n.t][n.n] -= 1, n.has(y.RED) && (this.data[n.t][0] -= 1)), z(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(g.RED) && (this.data[n.t][0] -= 1)), z(n) && this.get(n.t, 5) == 0 && this.get(n.t, 0) > 0) {
         this.data[n.t][0] = 0;
-        const i = e.pop().clone({ add: y.RED });
+        const i = e.pop().clone({ add: g.RED });
         e.push(i);
       }
     }
     return e;
   }
   draw(t) {
-    const e = t.clone({ add: y.TSUMO });
+    const e = t.clone({ add: g.TSUMO });
     this.inc([e]), this.data.tsumo = e;
   }
   discard(t) {
@@ -5412,7 +5423,7 @@ class nn {
   call(t) {
     if (!(t instanceof wt || t instanceof ut || t instanceof yt))
       throw new Error(`unexpected input ${t} ${t.type}`);
-    const e = t.tiles.filter((n) => !n.has(y.HORIZONTAL));
+    const e = t.tiles.filter((n) => !n.has(g.HORIZONTAL));
     if (e.length != t.tiles.length - 1)
       throw new Error(`removal: ${e} block: ${t}`);
     this.dec(e), this.data.called = [...this.called, t], this.data.tsumo = null;
@@ -5429,7 +5440,7 @@ class nn {
       );
       if (e == -1) throw new Error(`unable to find ${t.tiles[0]}`);
       let n = t.tiles[0];
-      n = z(n) && this.get(n.t, 0) > 0 ? n.clone({ add: y.RED }) : n.clone({ remove: y.RED }), this.dec([n]), this.data.called = [
+      n = z(n) && this.get(n.t, 0) > 0 ? n.clone({ add: g.RED }) : n.clone({ remove: g.RED }), this.dec([n]), this.data.called = [
         ...this.called.slice(0, e),
         ...this.called.slice(e + 1),
         t
@@ -5439,11 +5450,11 @@ class nn {
     throw new Error(`unexpected input ${t}`);
   }
   clone() {
-    const t = new nn(this.toString());
+    const t = new sn(this.toString());
     return t.data.reached = this.data.reached, t;
   }
 }
-class sn {
+class rn {
   constructor(t) {
     A(this, "hand");
     this.hand = t;
@@ -5469,7 +5480,7 @@ class sn {
     let t = 0, e = 0;
     for (let n of Object.values(p)) {
       if (n == p.BACK) continue;
-      const i = n == p.Z ? _e : gt;
+      const i = n == p.Z ? be : gt;
       for (let r of i)
         this.hand.get(n, r) >= 1 && t++, this.hand.get(n, r) >= 2 && e++;
     }
@@ -5486,10 +5497,10 @@ class sn {
       const l = this.commonByType(p.M), u = this.commonByType(p.P), f = this.commonByType(p.S);
       for (let m of [l.patternA, l.patternB])
         for (let d of [u.patternA, u.patternB])
-          for (let g of [f.patternA, f.patternB]) {
+          for (let y of [f.patternA, f.patternB]) {
             const _ = [this.hand.called.length, 0, 0];
-            for (let k = 0; k < 3; k++)
-              _[k] += m[k] + d[k] + g[k] + i[k] + o[k];
+            for (let T = 0; T < 3; T++)
+              _[T] += m[T] + d[T] + y[T] + i[T] + o[T];
             let x = this.calcCommon(_[0], _[1], _[2], n);
             x < h && (h = x);
           }
@@ -5559,7 +5570,7 @@ class Za {
   }
   markDrawn(t, e) {
     if (t.length == 0) return [];
-    const n = this.hand.drawn != null || e.has(y.TSUMO) ? y.TSUMO : y.RON, i = [];
+    const n = this.hand.drawn != null || e.has(g.TSUMO) ? g.TSUMO : g.RON, i = [];
     for (let o = 0; o < t.length; o++) {
       const a = t[o], c = {};
       for (let h = 0; h < a.length; h++) {
@@ -5604,7 +5615,7 @@ class Za {
     let e = !1;
     for (let n of Object.values(p)) {
       if (n == p.BACK) continue;
-      const i = n == p.Z ? _e : gt;
+      const i = n == p.Z ? be : gt;
       for (let r of i)
         if (this.hand.get(n, r) == 1)
           t.push(new Ks(new w(n, r)));
@@ -5620,7 +5631,7 @@ class Za {
       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 Fn(this.hand.hands)]];
+        return [[new me(this.hand.hands)]];
     }
     return [];
   }
@@ -5695,7 +5706,7 @@ class Za {
     return n;
   }
 }
-const _e = [1, 2, 3, 4, 5, 6, 7], gt = [1, 9], De = (s) => {
+const be = [1, 2, 3, 4, 5, 6, 7], gt = [1, 9], Ce = (s) => {
   var e;
   const t = s.boardContext;
   return {
@@ -5708,7 +5719,7 @@ const _e = [1, 2, 3, 4, 5, 6, 7], gt = [1, 9], De = (s) => {
     }
   };
 };
-class Ts {
+class Os {
   constructor(t, e) {
     A(this, "hand");
     A(this, "cfg");
@@ -5733,13 +5744,13 @@ class Ts {
     if (e.length == 0) return !1;
     let n = [0, 0], i = 0;
     for (let d = 0; d < e.length; d++) {
-      const g = e[d], _ = g.points.reduce(
-        (x, k) => x + k.double,
+      const y = e[d], _ = y.points.reduce(
+        (x, T) => x + T.double,
         0
       );
-      (_ > n[0] || _ == n[0] && g.fu > n[1]) && (i = d, n[0] = _, n[1] = g.fu);
+      (_ > n[0] || _ == n[0] && y.fu > n[1]) && (i = d, n[0] = _, n[1] = y.fu);
     }
-    const r = (d, g = 100) => Math.ceil(d / g) * g, o = n[1] != 25 ? r(n[1], 10) : 25, a = n[0];
+    const r = (d, y = 100) => Math.ceil(d / y) * y, o = n[1] != 25 ? r(n[1], 10) : 25, a = n[0];
     let c = Math.min(o * 2 ** (a + 2), 2e3);
     switch (a) {
       case 26:
@@ -5767,18 +5778,18 @@ class Ts {
     }
     a > 13 && a < 26 && (c = 8e3);
     const h = e[i].hand.some(
-      (d) => d.tiles.some((g) => g.has(y.TSUMO))
+      (d) => d.tiles.some((y) => y.has(g.TSUMO))
     ), l = this.cfg.orig.myWind, u = l == v.E, f = G(0);
     if (h) {
       const d = this.cfg.sticks.dead * 100;
       if (u) {
-        const g = r(c * 2);
-        f[v.E] += g * 3 + d * 3, f[v.S] -= g + d, f[v.W] -= g + d, f[v.N] -= g + d;
+        const y = r(c * 2);
+        f[v.E] += y * 3 + d * 3, f[v.S] -= y + d, f[v.W] -= y + d, f[v.N] -= y + d;
       } else
-        for (let g of Object.values(v)) {
-          if (g == l) continue;
-          const _ = g == v.E ? 2 : 1, x = r(c * _) + d;
-          f[g] -= x, f[l] += x;
+        for (let y of Object.values(v)) {
+          if (y == l) continue;
+          const _ = y == v.E ? 2 : 1, x = r(c * _) + d;
+          f[y] -= x, f[l] += x;
         }
     } else {
       const d = this.cfg.sticks.dead * 300;
@@ -5864,12 +5875,12 @@ class Ts {
     return this.cfg.reached == 1 ? [{ name: "立直", double: 1 }] : this.cfg.reached == 2 ? [{ name: "ダブル立直", double: 2 }] : [];
   }
   dB1(t) {
-    return this.minus() != 0 ? [] : (this.hand.drawn == null, t.some((n) => n.tiles.some((i) => i.has(y.TSUMO))) ? [{ name: "門前清自摸和", double: 1 }] : []);
+    return this.minus() != 0 ? [] : (this.hand.drawn == null, t.some((n) => n.tiles.some((i) => i.has(g.TSUMO))) ? [{ name: "門前清自摸和", double: 1 }] : []);
   }
   dC1(t) {
     if (this.minus() != 0) return [];
     const e = "平和", n = this.calcFu(t);
-    return n == 20 ? [{ name: e, double: 1 }] : !t.some((i) => i.tiles.some((r) => r.has(y.TSUMO))) && n == 30 ? [{ name: e, double: 1 }] : [];
+    return n == 20 ? [{ name: e, double: 1 }] : !t.some((i) => i.tiles.some((r) => r.has(g.TSUMO))) && n == 30 ? [{ name: e, double: 1 }] : [];
   }
   dD1(t) {
     return t.some(
@@ -5877,7 +5888,7 @@ class Ts {
     ) ? [] : [{ name: "断么九", double: 1 }];
   }
   dE1(t) {
-    return this.minus() != 0 ? [] : Os(t) == 1 ? [{ name: "一盃口", double: 1 }] : [];
+    return this.minus() != 0 ? [] : ks(t) == 1 ? [{ name: "一盃口", double: 1 }] : [];
   }
   dF1(t) {
     const e = [];
@@ -5908,7 +5919,7 @@ class Ts {
       for (let a of o.tiles) {
         for (let c of this.cfg.doras) a.equals(c) && e++;
         for (let c of this.cfg.blindDoras) a.equals(c) && i++;
-        a.has(y.RED) && n++;
+        a.has(g.RED) && n++;
       }
     const r = [];
     return e > 0 && r.push({ name: "ドラ", double: e }), n > 0 && r.push({ name: "赤ドラ", double: n }), this.hand.reached && i > 0 && r.push({ name: "裏ドラ", double: i }), r;
@@ -5920,14 +5931,14 @@ class Ts {
     const e = (n) => n instanceof Ct || n instanceof ut;
     for (let n of t) {
       if (!e(n)) continue;
-      const i = kt(n);
+      const i = Tt(n);
       if (i.t == p.Z) continue;
       const r = [p.M, p.P, p.S].filter((c) => c != i.t), o = t.some((c) => {
         const h = new w(r[0], i.n);
-        return e(c) && h.equals(kt(c));
+        return e(c) && h.equals(Tt(c));
       }), a = t.some((c) => {
         const h = new w(r[1], i.n);
-        return e(c) && h.equals(kt(c));
+        return e(c) && h.equals(Tt(c));
       });
       if (o && a)
         return [{ name: "三色同順", double: 2 - this.minus() }];
@@ -5940,7 +5951,7 @@ class Ts {
     ) ? [{ name: "対々和", double: 2 }] : [];
   }
   dD2(t) {
-    return this.minus() != 0 ? [] : t.filter((n) => (n instanceof Z || n instanceof ht) && !n.tiles.some((i) => i.has(y.RON))).length >= 3 ? [{ name: "三暗刻", double: 2 }] : [];
+    return this.minus() != 0 ? [] : t.filter((n) => (n instanceof Z || n instanceof ht) && !n.tiles.some((i) => i.has(g.RON))).length >= 3 ? [{ name: "三暗刻", double: 2 }] : [];
   }
   dE2(t) {
     return t.filter(
@@ -5951,14 +5962,14 @@ class Ts {
     const e = (n) => n instanceof Z || n instanceof lt || n instanceof yt || n instanceof ht || n instanceof wt;
     for (let n of t) {
       if (!e(n)) continue;
-      const i = kt(n);
+      const i = Tt(n);
       if (i.t == p.Z) continue;
       const r = [p.M, p.P, p.S].filter((c) => c != i.t), o = t.some((c) => {
         const h = new w(r[0], i.n);
-        return e(c) && h.equals(kt(c));
+        return e(c) && h.equals(Tt(c));
       }), a = t.some((c) => {
         const h = new w(r[1], i.n);
-        return e(c) && h.equals(kt(c));
+        return e(c) && h.equals(Tt(c));
       });
       if (o && a) return [{ name: "三色同刻", double: 2 }];
     }
@@ -5972,13 +5983,13 @@ class Ts {
   }
   dH2(t) {
     return t.every((n) => {
-      const i = n.tiles[0].t == p.Z ? _e : gt;
+      const i = n.tiles[0].t == p.Z ? be : gt;
       return n.tiles.every((r) => i.includes(r.n));
     }) ? [{ name: "混老頭", double: 2 }] : [];
   }
   dI2(t) {
     return t.length == 7 ? [] : t.some((n) => n instanceof Ct || n instanceof ut) ? t.some((n) => n.tiles[0].t == p.Z) ? t.every((n) => {
-      const i = n.tiles[0].t == p.Z ? _e : gt;
+      const i = n.tiles[0].t == p.Z ? be : gt;
       return n.tiles.some((r) => i.includes(r.n));
     }) ? [{ name: "混全帯么九", double: 2 - this.minus() }] : [] : [] : [];
   }
@@ -5991,7 +6002,7 @@ class Ts {
       [p.P]: [0, 0, 0]
     };
     for (let n of t) {
-      const i = kt(n);
+      const i = Tt(n);
       i.t != p.BACK && i.t != p.Z && (n instanceof Ct || n instanceof ut) && (i.n == 1 && e[i.t][0]++, i.n == 4 && e[i.t][1]++, i.n == 7 && e[i.t][2]++);
     }
     for (let n of Object.values(e))
@@ -6009,7 +6020,7 @@ class Ts {
     return t.length == 7 ? [] : t.some((n) => n instanceof Ct || n instanceof ut) ? t.some((n) => n.tiles[0].t == p.Z) ? [] : t.every((n) => n.tiles.some((i) => gt.includes(i.n))) ? [{ name: "純全帯么九色", double: 3 - this.minus() }] : [] : [];
   }
   dC3(t) {
-    return this.minus() != 0 ? [] : Os(t) == 2 ? [{ name: "ニ盃口", double: 3 }] : [];
+    return this.minus() != 0 ? [] : ks(t) == 2 ? [{ name: "ニ盃口", double: 3 }] : [];
   }
   dA6(t) {
     if (t.some((e) => e.tiles[0].t == p.Z)) return [];
@@ -6021,7 +6032,7 @@ class Ts {
   }
   dA13(t) {
     return t.length != 13 ? [] : t.some(
-      (n) => n instanceof V && n.tiles.some((i) => i.has(y.TSUMO) || i.has(y.RON))
+      (n) => n instanceof V && n.tiles.some((i) => i.has(g.TSUMO) || i.has(g.RON))
     ) ? [{ name: "国士無双13面待ち", double: 26 }] : [{ name: "国士無双", double: 13 }];
   }
   dB13(t) {
@@ -6029,9 +6040,9 @@ class Ts {
   }
   dC13(t) {
     return t.length == 7 ? [] : t.every(
-      (i) => i instanceof Z || i instanceof ht && !i.tiles.some((r) => r.has(y.RON)) || i instanceof V
+      (i) => i instanceof Z || i instanceof ht && !i.tiles.some((r) => r.has(g.RON)) || i instanceof V
     ) ? t.some(
-      (i) => i instanceof V && i.tiles.every((r) => r.has(y.TSUMO) || r.has(y.RON))
+      (i) => i instanceof V && i.tiles.every((r) => r.has(g.TSUMO) || r.has(g.RON))
     ) ? [{ name: "四暗刻単騎待ち", double: 26 }] : [{ name: "四暗刻", double: 13 }] : [];
   }
   dD13(t) {
@@ -6076,16 +6087,16 @@ class Ts {
     const i = this.cfg.myWind.n, r = this.cfg.roundWind.n;
     if (t.length == 7) return 25;
     const o = t.find(
-      (d) => d.tiles.some((g) => g.has(y.TSUMO) || g.has(y.RON))
-    ), a = this.minus() == 1, c = o.tiles.some((d) => d.has(y.TSUMO)), h = (d, g) => {
+      (d) => d.tiles.some((y) => y.has(g.TSUMO) || y.has(g.RON))
+    ), a = this.minus() == 1, c = o.tiles.some((d) => d.has(g.TSUMO)), h = (d, y) => {
       const _ = d.tiles[0];
-      return _.t == p.Z && [5, 6, 7].includes(_.n) || _.t == p.Z && [i, r].includes(_.n) || gt.includes(_.n) ? g * 2 : g;
+      return _.t == p.Z && [5, 6, 7].includes(_.n) || _.t == p.Z && [i, r].includes(_.n) || gt.includes(_.n) ? y * 2 : y;
     };
     for (let d of t)
       switch (!0) {
         case d instanceof ht:
-          let g = d.tiles.some((_) => _.has(y.RON)) ? 2 : 4;
-          n += h(d, g);
+          let y = d.tiles.some((_) => _.has(g.RON)) ? 2 : 4;
+          n += h(d, y);
           break;
         case d instanceof wt:
           n += h(d, 2);
@@ -6100,10 +6111,10 @@ class Ts {
     n += ((d) => {
       if (d instanceof ht) return 0;
       if (d instanceof V) return 2;
-      const g = d.tiles, _ = g.findIndex(
-        (x) => x.has(y.TSUMO) || x.has(y.RON)
+      const y = d.tiles, _ = y.findIndex(
+        (x) => x.has(g.TSUMO) || x.has(g.RON)
       );
-      return _ == 1 || _ == 0 && g[2].n == 9 || _ == 2 && g[0].n == 1 ? 2 : 0;
+      return _ == 1 || _ == 0 && y[2].n == 9 || _ == 2 && y[0].n == 1 ? 2 : 0;
     })(o);
     let f = t.find((d) => d instanceof V).tiles[0];
     f.t == p.Z && ([5, 6, 7].includes(f.n) && (n += 2), f.n == r && (n += 2), f.n == i && (n += 2));
@@ -6111,7 +6122,7 @@ class Ts {
     return !a && n == 20 && (m = !0), c && !m && (n += 2), !c && !a && (n += 10), !c && !a && n == 30 && (m = !0), a && n == 20 && (n = 30), n;
   }
 }
-const xi = (s) => s.tiles.reduce((t, e) => `${t}${e.n}${e.t}`, ""), Os = (s) => {
+const xi = (s) => s.tiles.reduce((t, e) => `${t}${e.n}${e.t}`, ""), ks = (s) => {
   let t = {};
   for (let n of s) {
     if (!(n instanceof Ct)) continue;
@@ -6122,7 +6133,7 @@ const xi = (s) => s.tiles.reduce((t, e) => `${t}${e.n}${e.t}`, ""), Os = (s) =>
   for (let n in t)
     t[n] >= 2 && e++;
   return e;
-}, kt = (s) => [...s.tiles].sort(Je)[0], Is = (s) => {
+}, Tt = (s) => [...s.tiles].sort(Ve)[0], Is = (s) => {
   let t = s.n, e = s.t;
   return new w(e, t % 9 + 1);
 };
@@ -6130,13 +6141,13 @@ class ee {
   // ツモった後の14枚の手配から、牌効率に従って捨てるべき牌を返す。
   // choices は、通常なら hand.hand を指定する。ただし、リーチしている場合は捨てる牌が限られているので choices で制限する。
   static calcCandidates(t, e, n) {
-    O(e.length > 0, "choices to discard is zero");
+    k(e.length > 0, "choices to discard is zero");
     const i = /* @__PURE__ */ new Map();
     let r = Number.POSITIVE_INFINITY;
     for (let o of e) {
       const a = t.dec([o]), c = ee.candidateTiles(t, n);
       t.inc(a);
-      const h = n != null && n.arrangeRed && o.has(y.RED) ? o.clone({ removeAll: !0 }) : o.has(y.RED) ? o.clone({ removeAll: !0, add: y.RED }) : o.clone({ removeAll: !0 });
+      const h = n != null && n.arrangeRed && o.has(g.RED) ? o.clone({ removeAll: !0 }) : o.has(g.RED) ? o.clone({ removeAll: !0, add: g.RED }) : o.clone({ removeAll: !0 });
       c.shanten < r ? (i.clear(), i.set(h.toString(), {
         shanten: c.shanten,
         candidates: c.candidates,
@@ -6152,7 +6163,7 @@ class ee {
   // 積もる前の13枚の手配から、有効牌の一覧を返す
   static candidateTiles(t, e) {
     let n = Number.POSITIVE_INFINITY, i = [];
-    const r = new sn(t);
+    const r = new rn(t);
     for (let o of Object.values(p))
       if (o != p.BACK)
         for (let a = 1; a < t.getArrayLen(o); a++) {
@@ -6167,11 +6178,11 @@ class ee {
   }
   // allow a partial input such as 23456s11z => 1,4,7s
   static partialCandidateTiles(t, e) {
-    const n = new nn(t, !0);
+    const n = new sn(t, !0);
     return Array(13 - (n.hands.length + n.called.length * 3)).fill(void 0).map(() => n.inc([new w(p.BACK, 0)])), ee.candidateTiles(n, e);
   }
 }
-const Rn = () => {
+const Hn = () => {
   const s = /* @__PURE__ */ new Set();
   return {
     on(t) {
@@ -6193,7 +6204,7 @@ function Ga(s) {
   const t = ["RON", "DAI_KAN", "PON", "CHI"], e = s.map((o) => o.choices), i = Ei(e, t).map((o) => s[o]);
   return {
     events: i,
-    type: ki(t, (r = i[0]) == null ? void 0 : r.choices)
+    type: Ti(t, (r = i[0]) == null ? void 0 : r.choices)
   };
 }
 function Ya(s) {
@@ -6208,7 +6219,7 @@ function Ya(s) {
   ], e = s.map((o) => o.choices), i = Ei(e, t).map((o) => s[o]);
   return {
     events: i,
-    type: ki(t, (r = i[0]) == null ? void 0 : r.choices)
+    type: Ti(t, (r = i[0]) == null ? void 0 : r.choices)
   };
 }
 function Ei(s, t) {
@@ -6232,14 +6243,14 @@ function Ja(s, t) {
   }
   return Number.POSITIVE_INFINITY;
 }
-function ki(s, t) {
+function Ti(s, t) {
   if (t == null) return !1;
   for (const e of s)
     if (t[e]) return e;
   return !1;
 }
-const Ce = () => {
-  const s = Rn(), t = Rn(), e = {
+const Me = () => {
+  const s = Hn(), t = Hn(), e = {
     emit: s.emit,
     on: (i) => t.on(i)
   }, n = {
@@ -6248,7 +6259,7 @@ const Ce = () => {
   };
   return [e, n];
 }, Va = () => {
-  const s = Rn();
+  const s = Hn();
   return {
     emit: (n) => {
       s.emit(n);
@@ -6258,7 +6269,7 @@ const Ce = () => {
     }
   };
 };
-class Ue {
+class qe {
   constructor(t) {
     A(this, "reachValue", 1e3);
     A(this, "m");
@@ -6283,7 +6294,7 @@ class Ue {
     }
   }
 }
-class qe {
+class Ze {
   constructor(t, e) {
     A(this, "pToW", {});
     A(this, "wToP", G(""));
@@ -6305,11 +6316,11 @@ class qe {
     this.sticks.reach++;
   }
   nextRound() {
-    const t = $e(this.round);
+    const t = We(this.round);
     this.round = t, this.update();
   }
   decrementReachStick() {
-    this.sticks.reach--, O(this.sticks.reach >= 0);
+    this.sticks.reach--, k(this.sticks.reach >= 0);
   }
   resetDeadStick() {
     this.sticks.dead = 0;
@@ -6330,7 +6341,7 @@ class qe {
     return structuredClone(this.pToW);
   }
 }
-function Ti(s) {
+function Oi(s) {
   for (let t = s.length - 1; t > 0; t--) {
     const e = Math.floor(Math.random() * (t + 1));
     [s[t], s[e]] = [s[e], s[t]];
@@ -6360,7 +6371,7 @@ class Qa {
             throw new Error(
               `[counter] cannot decrease ${e.toString()} due to zero`
             );
-          this.c[e.t][e.n] -= 1, e.has(y.RED) && (this.c[e.t][0] -= 1);
+          this.c[e.t][e.n] -= 1, e.has(g.RED) && (this.c[e.t][0] -= 1);
         }
     }
   }
@@ -6382,7 +6393,7 @@ class Qa {
     };
   }
 }
-class Oi {
+class ki {
   constructor() {
     A(this, "m", []);
   }
@@ -6394,7 +6405,7 @@ class Oi {
   }
   get lastTile() {
     const t = this.m.at(-1);
-    return O(
+    return k(
       t != null,
       `lastTile is null(${t}). river: ${JSON.stringify(this.m, null, 2)}`
     ), t;
@@ -6461,13 +6472,13 @@ class Ns {
     this._last = null;
   }
 }
-const Ii = ".", sc = "", Ni = "", ic = "#", rc = "*", Di = "xstate.init", Hn = "xstate.stop";
+const Ii = ".", sc = "", Ni = "", ic = "#", rc = "*", Di = "xstate.init", $n = "xstate.stop";
 function oc(s, t) {
   return {
     type: `xstate.after.${s}.${t}`
   };
 }
-function $n(s, t) {
+function Wn(s, t) {
   return {
     type: `xstate.done.state.${s}`,
     output: t
@@ -6556,7 +6567,7 @@ function Ri(s) {
 function vt(s) {
   return s === void 0 ? [] : Ri(s);
 }
-function Wn(s, t, e, n) {
+function Bn(s, t, e, n) {
   return typeof s == "function" ? s({
     context: t,
     event: e,
@@ -6578,7 +6589,7 @@ function $i(s) {
   if (!(s === void 0 || s === sc))
     return vt(s);
 }
-function Bn(s, t, e) {
+function Pn(s, t, e) {
   var r, o, a;
   const n = typeof s == "object", i = n ? s : void 0;
   return {
@@ -6606,24 +6617,24 @@ function dc(s, t) {
     clock: a,
     logger: c
   } = t, h = {
-    schedule: (f, m, d, g, _ = Math.random().toString(36).slice(2)) => {
+    schedule: (f, m, d, y, _ = Math.random().toString(36).slice(2)) => {
       const x = {
         source: f,
         target: m,
         event: d,
-        delay: g,
+        delay: y,
         id: _,
         startedAt: Date.now()
-      }, k = Rs(f, _);
-      u._snapshot._scheduledEvents[k] = x;
+      }, T = Rs(f, _);
+      u._snapshot._scheduledEvents[T] = x;
       const R = a.setTimeout(() => {
-        delete o[k], delete u._snapshot._scheduledEvents[k], u._relay(f, m, d);
-      }, g);
-      o[k] = R;
+        delete o[T], delete u._snapshot._scheduledEvents[T], u._relay(f, m, d);
+      }, y);
+      o[T] = R;
     },
     cancel: (f, m) => {
-      const d = Rs(f, m), g = o[d];
-      delete o[d], delete u._snapshot._scheduledEvents[d], g !== void 0 && a.clearTimeout(g);
+      const d = Rs(f, m), y = o[d];
+      delete o[d], delete u._snapshot._scheduledEvents[d], y !== void 0 && a.clearTimeout(y);
     },
     cancelAll: (f) => {
       for (const m in u._snapshot._scheduledEvents) {
@@ -6639,8 +6650,8 @@ function dc(s, t) {
       rootId: s.sessionId
     };
     r.forEach((d) => {
-      var g;
-      return (g = d.next) == null ? void 0 : g.call(d, m);
+      var y;
+      return (y = d.next) == null ? void 0 : y.call(d, m);
     });
   }, u = {
     _snapshot: {
@@ -6661,7 +6672,7 @@ function dc(s, t) {
       n.set(f, m), i.set(m, f);
     },
     inspect: (f) => {
-      const m = Bn(f);
+      const m = Pn(f);
       return r.add(m), {
         unsubscribe() {
           r.delete(m);
@@ -6689,12 +6700,12 @@ function dc(s, t) {
       for (const m in f) {
         const {
           source: d,
-          target: g,
+          target: y,
           event: _,
           delay: x,
-          id: k
+          id: T
         } = f[m];
-        h.schedule(d, g, _, x, k);
+        h.schedule(d, y, _, x, T);
       }
     },
     _clock: a,
@@ -6739,7 +6750,7 @@ class mc {
     this.system = o ? o.system : dc(this, {
       clock: i,
       logger: r
-    }), l && !o && this.system.inspect(Bn(l)), this.sessionId = this.system._bookId(), this.id = c ?? this.sessionId, this.logger = (e == null ? void 0 : e.logger) ?? this.system._logger, this.clock = (e == null ? void 0 : e.clock) ?? this.system._clock, this._parent = o, this._syncSnapshot = a, this.options = n, this.src = n.src ?? t, this.ref = this, this._actorScope = {
+    }), l && !o && this.system.inspect(Pn(l)), this.sessionId = this.system._bookId(), this.id = c ?? this.sessionId, this.logger = (e == null ? void 0 : e.logger) ?? this.system._logger, this.clock = (e == null ? void 0 : e.clock) ?? this.system._clock, this._parent = o, this._syncSnapshot = a, this.options = n, this.src = n.src ?? t, this.ref = this, this._actorScope = {
       self: this,
       id: this.id,
       sessionId: this.sessionId,
@@ -6758,8 +6769,8 @@ class mc {
         if (!f && !m)
           return;
         const d = /* @__PURE__ */ new Set([...f ? f.values() : [], ...m ? m.values() : []]);
-        for (const g of Array.from(d))
-          g(u);
+        for (const y of Array.from(d))
+          y(u);
       }
     }, this.send = this.send.bind(this), this.system._sendInspectionEvent({
       type: "@xstate.actor",
@@ -6882,7 +6893,7 @@ class mc {
    */
   subscribe(t, e, n) {
     var r;
-    const i = Bn(t, e, n);
+    const i = Pn(t, e, n);
     if (this._processingStatus !== q.Stopped)
       this.observers.add(i);
     else
@@ -6981,11 +6992,11 @@ class mc {
       }, this._error(i);
       return;
     }
-    this.update(e, t), t.type === Hn && (this._stopProcedure(), this._complete());
+    this.update(e, t), t.type === $n && (this._stopProcedure(), this._complete());
   }
   _stop() {
     return this._processingStatus === q.Stopped ? this : (this.mailbox.clear(), this._processingStatus === q.NotStarted ? (this._processingStatus = q.Stopped, this) : (this.mailbox.enqueue({
-      type: Hn
+      type: $n
     }), this));
   }
   /** Stops the Actor and unsubscribe all listeners. */
@@ -7213,7 +7224,7 @@ const ls = (s) => s.type === "atomic" || s.type === "final";
 function se(s) {
   return Object.values(s.states).filter((t) => t.type !== "history");
 }
-function Oe(s, t) {
+function Ie(s, t) {
   const e = [];
   if (t === s)
     return e;
@@ -7222,7 +7233,7 @@ function Oe(s, t) {
     e.push(n), n = n.parent;
   return e;
 }
-function Ze(s) {
+function Ge(s) {
   const t = new Set(s), e = Pi(t);
   for (const n of t)
     if (n.type === "compound" && (!e.get(n) || !e.get(n).length))
@@ -7266,13 +7277,13 @@ function Pi(s) {
   return t;
 }
 function ji(s, t) {
-  const e = Ze(t);
+  const e = Ge(t);
   return Bi(s, Pi(e));
 }
 function us(s, t) {
   return t.type === "compound" ? se(t).some((e) => e.type === "final" && s.has(e)) : t.type === "parallel" ? se(t).every((e) => us(s, e)) : t.type === "final";
 }
-const rn = (s) => s[0] === ic;
+const on = (s) => s[0] === ic;
 function xc(s, t) {
   return s.transitions.get(t) || [...s.transitions.keys()].filter((n) => {
     if (n === rc)
@@ -7321,7 +7332,7 @@ function Ec(s) {
   });
 }
 function Nt(s, t, e) {
-  const n = $i(e.target), i = e.reenter ?? !1, r = Oc(s, n), o = {
+  const n = $i(e.target), i = e.reenter ?? !1, r = kc(s, n), o = {
     ...e,
     actions: vt(e.actions),
     guard: e.guard,
@@ -7337,7 +7348,7 @@ function Nt(s, t, e) {
   };
   return o;
 }
-function kc(s) {
+function Tc(s) {
   const t = /* @__PURE__ */ new Map();
   if (s.config.on)
     for (const e of Object.keys(s.config.on)) {
@@ -7370,7 +7381,7 @@ function kc(s) {
   }
   return t;
 }
-function Tc(s, t) {
+function Oc(s, t) {
   const e = typeof t == "string" ? s.states[t] : t ? s.states[t.target] : void 0;
   if (!e && t)
     throw new Error(`Initial state node "${t}" not found on parent state node #${s.id}`);
@@ -7388,20 +7399,20 @@ function Tc(s, t) {
   };
   return n;
 }
-function Oc(s, t) {
+function kc(s, t) {
   if (t !== void 0)
     return t.map((e) => {
       if (typeof e != "string")
         return e;
-      if (rn(e))
+      if (on(e))
         return s.machine.getStateNodeById(e);
       const n = e[0] === Ii;
       if (n && !s.parent)
-        return Ge(s, e.slice(1));
+        return Ye(s, e.slice(1));
       const i = n ? s.key + e : e;
       if (s.parent)
         try {
-          return Ge(s.parent, i);
+          return Ye(s.parent, i);
         } catch (r) {
           throw new Error(`Invalid transition definition for state node '${s.id}':
 ${r.message}`);
@@ -7413,7 +7424,7 @@ ${r.message}`);
 function zi(s) {
   const t = $i(s.config.target);
   return t ? {
-    target: t.map((e) => typeof e == "string" ? Ge(s.parent, e) : e)
+    target: t.map((e) => typeof e == "string" ? Ye(s.parent, e) : e)
   } : s.parent.initial;
 }
 function Mt(s) {
@@ -7422,7 +7433,7 @@ function Mt(s) {
 function Hs(s) {
   const t = Li(s);
   for (const e of t)
-    for (const n of Oe(e, s))
+    for (const n of Ie(e, s))
       t.add(n);
   return t;
 }
@@ -7440,7 +7451,7 @@ function Li(s) {
   return e(s), t;
 }
 function ie(s, t) {
-  if (rn(t))
+  if (on(t))
     return s.machine.getStateNodeById(t);
   if (!s.states)
     throw new Error(`Unable to retrieve child state '${t}' from '${s.id}'; no child states exist.`);
@@ -7449,8 +7460,8 @@ function ie(s, t) {
     throw new Error(`Child state '${t}' does not exist on '${s.id}'`);
   return e;
 }
-function Ge(s, t) {
-  if (typeof t == "string" && rn(t))
+function Ye(s, t) {
+  if (typeof t == "string" && on(t))
     try {
       return s.machine.getStateNodeById(t);
     } catch {
@@ -7465,7 +7476,7 @@ function Ge(s, t) {
   }
   return n;
 }
-function Ye(s, t) {
+function Xe(s, t) {
   if (typeof t == "string") {
     const i = s.states[t];
     if (!i)
@@ -7477,7 +7488,7 @@ function Ye(s, t) {
     const o = ie(s, r);
     if (!o)
       return i;
-    const a = Ye(o, t[r]);
+    const a = Xe(o, t[r]);
     return i.concat(a);
   }, []));
 }
@@ -7528,7 +7539,7 @@ function Ki(s, t, e) {
     let r = !1;
     const o = /* @__PURE__ */ new Set();
     for (const a of n)
-      if (Mc(Pn([i], t, e), Pn([a], t, e)))
+      if (Mc(jn([i], t, e), jn([a], t, e)))
         if (xt(i.source, a.source))
           o.add(a);
         else {
@@ -7545,7 +7556,7 @@ function Ki(s, t, e) {
 }
 function Rc(s) {
   const [t, ...e] = s;
-  for (const n of Oe(t, void 0))
+  for (const n of Ie(t, void 0))
     if (e.every((i) => xt(i, n)))
       return n;
 }
@@ -7565,7 +7576,7 @@ function ds(s, t) {
       e.add(n);
   return [...e];
 }
-function Fi(s, t) {
+function Ui(s, t) {
   const e = ds(s, t);
   if (!e)
     return;
@@ -7577,12 +7588,12 @@ function Fi(s, t) {
   if (!s.reenter)
     return s.source.machine.root;
 }
-function Pn(s, t, e) {
+function jn(s, t, e) {
   var i;
   const n = /* @__PURE__ */ new Set();
   for (const r of s)
     if ((i = r.target) != null && i.length) {
-      const o = Fi(r, e);
+      const o = Ui(r, e);
       r.reenter && r.source === o && n.add(o);
       for (const a of t)
         xt(a, o) && n.add(a);
@@ -7597,7 +7608,7 @@ function Hc(s, t) {
       return !1;
   return !0;
 }
-function jn(s, t, e, n, i, r) {
+function zn(s, t, e, n, i, r) {
   if (!s.length)
     return t;
   const o = new Set(t._nodes);
@@ -7619,8 +7630,8 @@ function jn(s, t, e, n, i, r) {
 function $c(s, t, e, n, i) {
   if (n.output === void 0)
     return;
-  const r = $n(i.id, i.output !== void 0 && i.parent ? Wn(i.output, s.context, t, e.self) : void 0);
-  return Wn(n.output, s.context, r, e.self);
+  const r = Wn(i.id, i.output !== void 0 && i.parent ? Bn(i.output, s.context, t, e.self) : void 0);
+  return Bn(n.output, s.context, r, e.self);
 }
 function Wc(s, t, e, n, i, r, o, a) {
   let c = s;
@@ -7642,10 +7653,10 @@ function Wc(s, t, e, n, i, r, o, a) {
     }
     if (c = re(c, t, e, m, r, f.invoke.map((d) => d.id)), f.type === "final") {
       const d = f.parent;
-      let g = (d == null ? void 0 : d.type) === "parallel" ? d : d == null ? void 0 : d.parent, _ = g || f;
-      for ((d == null ? void 0 : d.type) === "compound" && r.push($n(d.id, f.output !== void 0 ? Wn(f.output, c.context, t, e.self) : void 0)); (g == null ? void 0 : g.type) === "parallel" && !u.has(g) && us(i, g); )
-        u.add(g), r.push($n(g.id)), _ = g, g = g.parent;
-      if (g)
+      let y = (d == null ? void 0 : d.type) === "parallel" ? d : d == null ? void 0 : d.parent, _ = y || f;
+      for ((d == null ? void 0 : d.type) === "compound" && r.push(Wn(d.id, f.output !== void 0 ? Bn(f.output, c.context, t, e.self) : void 0)); (y == null ? void 0 : y.type) === "parallel" && !u.has(y) && us(i, y); )
+        u.add(y), r.push(Wn(y.id)), _ = y, y = y.parent;
+      if (y)
         continue;
       c = jt(c, {
         status: "done",
@@ -7657,7 +7668,7 @@ function Wc(s, t, e, n, i, r, o, a) {
 }
 function Bc(s, t, e, n) {
   for (const i of s) {
-    const r = Fi(i, t);
+    const r = Ui(i, t);
     for (const a of i.target || [])
       !Mt(a) && // if the target is different than the source then it will *definitely* be entered
       (i.source !== a || // we know that the domain can't lie within the source
@@ -7666,8 +7677,8 @@ function Bc(s, t, e, n) {
       i.reenter) && (n.add(a), e.add(a)), Yt(a, t, e, n);
     const o = ds(i, t);
     for (const a of o) {
-      const c = Oe(a, r);
-      (r == null ? void 0 : r.type) === "parallel" && c.push(r), Ui(n, t, e, c, !i.source.parent && i.reenter ? void 0 : r);
+      const c = Ie(a, r);
+      (r == null ? void 0 : r.type) === "parallel" && c.push(r), Fi(n, t, e, c, !i.source.parent && i.reenter ? void 0 : r);
     }
   }
 }
@@ -7679,33 +7690,33 @@ function Yt(s, t, e, n) {
       for (const o of r)
         n.add(o), Yt(o, t, e, n);
       for (const o of r)
-        yn(o, s.parent, n, t, e);
+        wn(o, s.parent, n, t, e);
     } else {
       const r = zi(s);
       for (const o of r.target)
         n.add(o), r === ((i = s.parent) == null ? void 0 : i.initial) && e.add(s.parent), Yt(o, t, e, n);
       for (const o of r.target)
-        yn(o, s.parent, n, t, e);
+        wn(o, s.parent, n, t, e);
     }
   else if (s.type === "compound") {
     const [r] = s.initial.target;
-    Mt(r) || (n.add(r), e.add(r)), Yt(r, t, e, n), yn(r, s, n, t, e);
+    Mt(r) || (n.add(r), e.add(r)), Yt(r, t, e, n), wn(r, s, n, t, e);
   } else if (s.type === "parallel")
     for (const r of se(s).filter((o) => !Mt(o)))
       [...n].some((o) => xt(o, r)) || (Mt(r) || (n.add(r), e.add(r)), Yt(r, t, e, n));
 }
-function Ui(s, t, e, n, i) {
+function Fi(s, t, e, n, i) {
   for (const r of n)
     if ((!i || xt(r, i)) && s.add(r), r.type === "parallel")
       for (const o of se(r).filter((a) => !Mt(a)))
         [...s].some((a) => xt(a, o)) || (s.add(o), Yt(o, t, e, s));
 }
-function yn(s, t, e, n, i) {
-  Ui(e, n, i, Oe(s, t));
+function wn(s, t, e, n, i) {
+  Fi(e, n, i, Ie(s, t));
 }
 function Pc(s, t, e, n, i, r, o) {
   let a = s;
-  const c = Pn(n, i, r);
+  const c = jn(n, i, r);
   c.sort((l, u) => u.order - l.order);
   let h;
   for (const l of c)
@@ -7764,7 +7775,7 @@ function qi(s, t, e, n, i, r) {
       });
       continue;
     }
-    const d = l, [g, _, x] = d.resolve(
+    const d = l, [y, _, x] = d.resolve(
       e,
       a,
       u,
@@ -7773,7 +7784,7 @@ function qi(s, t, e, n, i, r) {
       // this holds all params
       i
     );
-    a = g, "retryResolve" in d && (r == null || r.push([d, _])), "execute" in d && (e.self._processingStatus === q.Running ? d.execute(e, _) : e.defer(d.execute.bind(null, e, _))), x && (a = qi(a, t, e, x, i, r));
+    a = y, "retryResolve" in d && (r == null || r.push([d, _])), "execute" in d && (e.self._processingStatus === q.Running ? d.execute(e, _) : e.defer(d.execute.bind(null, e, _))), x && (a = qi(a, t, e, x, i, r));
   }
   return a;
 }
@@ -7786,7 +7797,7 @@ function re(s, t, e, n, i, r) {
     c.retryResolve(e, a, h);
   }), a;
 }
-function wn(s, t, e, n = []) {
+function _n(s, t, e, n = []) {
   let i = s;
   const r = [];
   function o(h, l, u) {
@@ -7798,7 +7809,7 @@ function wn(s, t, e, n = []) {
       _transitions: u
     }), r.push(h);
   }
-  if (t.type === Hn)
+  if (t.type === $n)
     return i = jt(Ws(i, t, e), {
       status: "stopped"
     }), o(i, t, []), {
@@ -7816,7 +7827,7 @@ function wn(s, t, e, n = []) {
         snapshot: i,
         microstates: r
       };
-    i = jn(
+    i = zn(
       u,
       s,
       e,
@@ -7835,7 +7846,7 @@ function wn(s, t, e, n = []) {
         break;
       a = n.shift(), h = Bs(a, i);
     }
-    i = jn(h, i, e, a, !1, n), c = i !== l, o(i, a, h);
+    i = zn(h, i, e, a, !1, n), c = i !== l, o(i, a, h);
   }
   return i.status !== "active" && Ws(i, a, e), {
     snapshot: i,
@@ -7851,7 +7862,7 @@ function Bs(s, t) {
 function jc(s, t) {
   const e = /* @__PURE__ */ new Set(), n = s._nodes.filter(ls);
   for (const i of n)
-    t: for (const r of [i].concat(Oe(i, void 0)))
+    t: for (const r of [i].concat(Ie(i, void 0)))
       if (r.always) {
         for (const o of r.always)
           if (o.guard === void 0 || hs(o.guard, s.context, t, s)) {
@@ -7862,7 +7873,7 @@ function jc(s, t) {
   return Ki(Array.from(e), new Set(s._nodes), s.historyValue);
 }
 function zc(s, t) {
-  const e = Ze(Ye(s, t));
+  const e = Ge(Xe(s, t));
   return ji(s, [...e]);
 }
 function Lc(s) {
@@ -7870,9 +7881,9 @@ function Lc(s) {
 }
 const Kc = function(t) {
   return Mi(t, this.value);
-}, Fc = function(t) {
-  return this.tags.has(t);
 }, Uc = function(t) {
+  return this.tags.has(t);
+}, Fc = function(t) {
   const e = this.machine.getTransitionData(this, t);
   return !!(e != null && e.length) && // Check that at least one transition is not forbidden
   e.some((n) => n.target !== void 0 || n.actions.length);
@@ -7895,7 +7906,7 @@ const Kc = function(t) {
 }, Zc = function() {
   return this._nodes.reduce((t, e) => (e.meta !== void 0 && (t[e.id] = e.meta), t), {});
 };
-function We(s, t) {
+function Be(s, t) {
   return {
     status: s.status,
     output: s.output,
@@ -7908,14 +7919,14 @@ function We(s, t) {
     children: s.children,
     historyValue: s.historyValue || {},
     matches: Kc,
-    hasTag: Fc,
-    can: Uc,
+    hasTag: Uc,
+    can: Fc,
     getMeta: Zc,
     toJSON: qc
   };
 }
 function jt(s, t = {}) {
-  return We({
+  return Be({
     ...s,
     ...t
   }, s.machine);
@@ -7934,9 +7945,9 @@ function Gc(s, t) {
     toJSON: u,
     ...f
   } = s, m = {};
-  for (const g in r) {
-    const _ = r[g];
-    m[g] = {
+  for (const y in r) {
+    const _ = r[y];
+    m[y] = {
       snapshot: _.getPersistedSnapshot(t),
       src: _.src,
       systemId: _._systemId,
@@ -8090,7 +8101,7 @@ function th(s) {
   return t.type = "xstate.assign", t.assignment = s, t.resolve = Qc, t;
 }
 const Ps = /* @__PURE__ */ new WeakMap();
-function Ut(s, t, e) {
+function Ft(s, t, e) {
   let n = Ps.get(s);
   return n ? t in n || (n[t] = e()) : (n = {
     [t]: e()
@@ -8115,7 +8126,7 @@ class ps {
   }
   /** @internal */
   _initialize() {
-    this.transitions = kc(this), this.config.always && (this.always = qt(this.config.always).map((t) => Nt(this, Ni, t))), Object.keys(this.states).forEach((t) => {
+    this.transitions = Tc(this), this.config.always && (this.always = qt(this.config.always).map((t) => Nt(this, Ni, t))), Object.keys(this.states).forEach((t) => {
       this.states[t]._initialize();
     });
   }
@@ -8162,7 +8173,7 @@ class ps {
   }
   /** The logic invoked as actors by this state node. */
   get invoke() {
-    return Ut(this, "invoke", () => vt(this.config.invoke).map((t, e) => {
+    return Ft(this, "invoke", () => vt(this.config.invoke).map((t, e) => {
       const {
         src: n,
         systemId: i
@@ -8190,19 +8201,19 @@ class ps {
   }
   /** The mapping of events to transitions. */
   get on() {
-    return Ut(this, "on", () => [...this.transitions].flatMap(([e, n]) => n.map((i) => [e, i])).reduce((e, [n, i]) => (e[n] = e[n] || [], e[n].push(i), e), {}));
+    return Ft(this, "on", () => [...this.transitions].flatMap(([e, n]) => n.map((i) => [e, i])).reduce((e, [n, i]) => (e[n] = e[n] || [], e[n].push(i), e), {}));
   }
   get after() {
-    return Ut(this, "delayedTransitions", () => Ec(this));
+    return Ft(this, "delayedTransitions", () => Ec(this));
   }
   get initial() {
-    return Ut(this, "initial", () => Tc(this, this.config.initial));
+    return Ft(this, "initial", () => Oc(this, this.config.initial));
   }
   /** @internal */
   next(t, e) {
     const n = e.type, i = [];
     let r;
-    const o = Ut(this, `candidates-${n}`, () => xc(this, n));
+    const o = Ft(this, `candidates-${n}`, () => xc(this, n));
     for (const a of o) {
       const {
         guard: c
@@ -8224,7 +8235,7 @@ ${u.message}`);
   }
   /** All the event types accepted by this state node and its descendants. */
   get events() {
-    return Ut(this, "events", () => {
+    return Ft(this, "events", () => {
       const {
         states: t
       } = this, e = new Set(this.ownEvents);
@@ -8296,8 +8307,8 @@ class ms {
     });
   }
   resolveState(t) {
-    const e = zc(this.root, t.value), n = Ze(Ye(this.root, e));
-    return We({
+    const e = zc(this.root, t.value), n = Ge(Xe(this.root, e));
+    return Be({
       _nodes: [...n],
       context: t.context || {},
       children: {},
@@ -8315,7 +8326,7 @@ class ms {
    * @param event The received event
    */
   transition(t, e, n) {
-    return wn(t, e, n).snapshot;
+    return _n(t, e, n).snapshot;
   }
   /**
    * Determines the next state given the current `state` and `event`. Calculates
@@ -8325,7 +8336,7 @@ class ms {
    * @param event The received event
    */
   microstep(t, e, n) {
-    return wn(t, e, n).microstates;
+    return _n(t, e, n).microstates;
   }
   getTransitionData(t, e) {
     return fs(this.root, t.value, t, e) || [];
@@ -8337,7 +8348,7 @@ class ms {
   getPreInitialState(t, e, n) {
     const {
       context: i
-    } = this.config, r = We({
+    } = this.config, r = Be({
       context: typeof i != "function" && i ? i : {},
       _nodes: [this.root],
       children: {},
@@ -8358,7 +8369,7 @@ class ms {
    * `ActorRef`.
    */
   getInitialSnapshot(t, e) {
-    const n = Ci(e), i = [], r = this.getPreInitialState(t, n, i), o = jn([{
+    const n = Ci(e), i = [], r = this.getPreInitialState(t, n, i), o = zn([{
       target: [...Li(this.root)],
       source: this.root,
       reenter: !0,
@@ -8368,7 +8379,7 @@ class ms {
       // TODO: fix
     }], r, t, n, !0, i), {
       snapshot: a
-    } = wn(o, n, t, i);
+    } = _n(o, n, t, i);
     return a;
   }
   start(t) {
@@ -8377,10 +8388,10 @@ class ms {
     });
   }
   getStateNodeById(t) {
-    const e = os(t), n = e.slice(1), i = rn(e[0]) ? e[0].slice(nh.length) : e[0], r = this.idMap.get(i);
+    const e = os(t), n = e.slice(1), i = on(e[0]) ? e[0].slice(nh.length) : e[0], r = this.idMap.get(i);
     if (!r)
       throw new Error(`Child state node '#${i}' does not exist on machine '${this.id}'`);
-    return Ge(r, n);
+    return Ye(r, n);
   }
   get definition() {
     return this.root.definition;
@@ -8407,10 +8418,10 @@ class ms {
       });
       n[c] = m;
     });
-    const r = We({
+    const r = Be({
       ...t,
       children: n,
-      _nodes: Array.from(Ze(Ye(this.root, t.value)))
+      _nodes: Array.from(Ge(Xe(this.root, t.value)))
     }, this);
     let o = /* @__PURE__ */ new Set();
     function a(c, h) {
@@ -8434,11 +8445,11 @@ class ms {
 function sh(s, t) {
   return new ms(s, t);
 }
-const Me = (s) => s === !1 ? !1 : s.map((t) => t.serialize()), ih = (s) => s === !1 ? !1 : s.serialize(), rh = (s) => s === !1 ? !1 : s.map((t) => ({
+const Re = (s) => s === !1 ? !1 : s.map((t) => t.serialize()), ih = (s) => s === !1 ? !1 : s.serialize(), rh = (s) => s === !1 ? !1 : s.map((t) => ({
   tile: t.tile.toString(),
   candidates: t.candidates.map((e) => e.toString()),
   shanten: t.shanten
-})), zn = (s) => JSON.parse(JSON.stringify(s)), Re = (s) => s === !1 ? !1 : zn(s), js = (s) => sh(
+})), Ln = (s) => JSON.parse(JSON.stringify(s)), He = (s) => s === !1 ? !1 : Ln(s), js = (s) => sh(
   {
     id: "Untitled",
     initial: "distribute",
@@ -8789,15 +8800,15 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
           wind: i,
           drawerInfo: { wind: i, tile: r.toString() },
           choices: {
-            TSUMO: Re(
+            TSUMO: He(
               t.controller.doWin(i, r, {
                 oneShot: t.oneShotMap[i],
                 replacementWin: n == null ? void 0 : n.replacementWin
               })
             ),
             REACH: rh(t.controller.doReach(i)),
-            AN_KAN: Me(t.controller.doAnKan(i)),
-            SHO_KAN: Me(t.controller.doShoKan(i)),
+            AN_KAN: Re(t.controller.doAnKan(i)),
+            SHO_KAN: Re(t.controller.doShoKan(i)),
             DISCARD: t.controller.doDiscard(i).map((c) => c.toString()),
             DRAWN_GAME_BY_NINE_ORPHANS: t.controller.canDrawnGame(i)
           }
@@ -8805,7 +8816,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.controller.emit(a), t.controller.pollReplies(o, [i]);
       },
       notify_choice_after_discarded: ({ context: t, event: e }) => {
-        const n = t.genEventID(), i = t.controller.river.lastTile, r = i.t.clone({ add: y.HORIZONTAL });
+        const n = t.genEventID(), i = t.controller.river.lastTile, r = i.t.clone({ add: g.HORIZONTAL });
         for (let o of Object.values(v)) {
           const a = {
             id: n,
@@ -8816,17 +8827,17 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
               tile: i.t.toString()
             },
             choices: {
-              RON: Re(
+              RON: He(
                 t.controller.doWin(o, r, {
                   discardedBy: i.w,
                   oneShot: t.oneShotMap[o],
                   missingRon: t.missingMap[o]
                 })
               ),
-              PON: Me(
+              PON: Re(
                 t.controller.doPon(o, i.w, r)
               ),
-              CHI: Me(
+              CHI: Re(
                 t.controller.doChi(o, i.w, r)
               ),
               DAI_KAN: ih(
@@ -8854,7 +8865,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.controller.emit(c), t.controller.pollReplies(i, [r]);
       },
       notify_choice_for_reach_acceptance: ({ context: t, event: e }) => {
-        const n = t.genEventID(), i = t.controller.river.lastTile, r = i.t.clone({ add: y.HORIZONTAL });
+        const n = t.genEventID(), i = t.controller.river.lastTile, r = i.t.clone({ add: g.HORIZONTAL });
         for (let o of Object.values(v)) {
           const a = {
             id: n,
@@ -8862,7 +8873,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
             wind: o,
             reacherInfo: { wind: i.w, tile: r.toString() },
             choices: {
-              RON: Re(
+              RON: He(
                 t.controller.doWin(o, r, {
                   discardedBy: i.w,
                   oneShot: t.oneShotMap[o],
@@ -8876,15 +8887,15 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.controller.pollReplies(n, Object.values(v));
       },
       notify_choice_for_chankan: ({ context: t, event: e }) => {
-        O(
+        k(
           e.type == "SHO_KAN" || e.type == "AN_KAN",
           `unexpected event ${e.type}`
         );
-        const n = t.genEventID(), i = e.block.tiles[0].clone({ remove: y.HORIZONTAL });
+        const n = t.genEventID(), i = e.block.tiles[0].clone({ remove: g.HORIZONTAL });
         for (let r of Object.values(v)) {
           const o = t.controller.doWin(
             r,
-            e.block.tiles[0].clone({ remove: y.HORIZONTAL }),
+            e.block.tiles[0].clone({ remove: g.HORIZONTAL }),
             {
               discardedBy: e.iam,
               quadWin: !0,
@@ -8897,7 +8908,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
             wind: r,
             callerInfo: { wind: e.iam, tile: i.toString() },
             choices: {
-              RON: e.type == "SHO_KAN" ? Re(o) : !1
+              RON: e.type == "SHO_KAN" ? He(o) : !1
             }
           };
           a.choices.RON && (t.missingMap[r] = !0), t.controller.emit(a);
@@ -8905,7 +8916,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.controller.pollReplies(n, Object.values(v));
       },
       notify_call: ({ context: t, event: e }) => {
-        O(
+        k(
           e.type == "CHI" || e.type == "PON" || e.type == "DAI_KAN" || e.type == "AN_KAN" || e.type == "SHO_KAN",
           `unexpected event ${e.type}`
         );
@@ -8924,7 +8935,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.controller.next();
       },
       notify_discard: ({ context: t, event: e }) => {
-        O(e.type == "DISCARD", `unexpected event ${e.type}`);
+        k(e.type == "DISCARD", `unexpected event ${e.type}`);
         const n = t.genEventID(), i = t.currentWind, r = e.tile;
         for (let o of Object.values(v)) {
           const a = {
@@ -8945,7 +8956,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         const a = t.currentWind;
         t.controller.hand(a).reached || (t.missingMap[a] = !1);
         for (let c of Object.values(v)) {
-          let h = new w(p.BACK, 0, [y.TSUMO]);
+          let h = new w(p.BACK, 0, [g.TSUMO]);
           c == a && (h = o);
           const l = {
             id: i,
@@ -8960,7 +8971,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         t.controller.next();
       },
       notify_ron: ({ context: t, event: e }) => {
-        O(e.type == "RON");
+        k(e.type == "RON");
         const n = t.genEventID(), i = e.iam;
         for (let r of Object.values(v)) {
           const o = {
@@ -8972,13 +8983,13 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
               wind: e.targetInfo.wind,
               tile: e.targetInfo.tile.toString()
             },
-            ret: zn(e.ret)
+            ret: Ln(e.ret)
           };
           t.controller.emit(o);
         }
       },
       notify_tsumo: ({ context: t, event: e }) => {
-        O(e.type == "TSUMO", `unexpected event ${e.type}`);
+        k(e.type == "TSUMO", `unexpected event ${e.type}`);
         const n = t.genEventID(), i = t.currentWind;
         for (let r of Object.values(v)) {
           const o = {
@@ -8987,14 +8998,14 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
             iam: i,
             wind: r,
             lastTile: t.controller.hand(i).drawn.toString(),
-            ret: zn(e.ret)
+            ret: Ln(e.ret)
           };
           t.controller.emit(o);
         }
       },
       notify_reach: ({ context: t, event: e }) => {
-        O(e.type == "REACH", `unexpected event ${e.type}`);
-        const n = t.genEventID(), i = e.iam, r = e.tile.clone({ add: y.HORIZONTAL });
+        k(e.type == "REACH", `unexpected event ${e.type}`);
+        const n = t.genEventID(), i = e.iam, r = e.tile.clone({ add: g.HORIZONTAL });
         t.oneShotMap[i] = !0;
         for (let o of Object.values(v)) {
           const a = {
@@ -9008,7 +9019,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
         }
       },
       notify_reach_accepted: ({ context: t, event: e }) => {
-        O(e.type == "REACH_ACCEPT");
+        k(e.type == "REACH_ACCEPT");
         const n = t.genEventID();
         for (let i of Object.values(v)) {
           const r = {
@@ -9107,7 +9118,7 @@ CHI/PON の場合は鳴ける組み合わせの一覧`
             const r = [];
             for (let h of Object.values(v)) {
               const l = t.controller.hand(h);
-              new sn(l).calc() == 0 && (r.push(h), i[h] = l.toString());
+              new rn(l).calc() == 0 && (r.push(h), i[h] = l.toString());
             }
             const o = r.length == 0 || r.length == 4, a = G(0);
             for (let h of Object.values(v))
@@ -9214,10 +9225,10 @@ class Xt {
         for (let i = 0; i < 4; i++)
           for (let r of n) {
             let o = new w(e, r);
-            e != p.Z && i == 3 && r == 5 && (o = o.clone({ add: y.RED })), this.walls.drawable.push(o.toString());
+            e != p.Z && i == 3 && r == 5 && (o = o.clone({ add: g.RED })), this.walls.drawable.push(o.toString());
           }
       }
-      Ti(this.walls.drawable);
+      Oi(this.walls.drawable);
     }
     for (let e = 0; e < 14; e++)
       this.walls.dead.push(this.walls.drawable.pop());
@@ -9241,7 +9252,7 @@ class Xt {
     };
   }
 }
-class on {
+class an {
   constructor(t, e) {
     A(this, "wall", new Xt());
     A(this, "playerIDs");
@@ -9261,9 +9272,9 @@ class on {
       // bind
     );
     const i = Object.fromEntries(this.playerIDs.map((o) => [o, 25e3]));
-    this.observer.scoreManager = new Ue(i);
-    const r = (e == null ? void 0 : e.shuffle) == !1 ? this.playerIDs : Ti([...this.playerIDs]);
-    this.observer.placeManager = new qe({
+    this.observer.scoreManager = new qe(i);
+    const r = (e == null ? void 0 : e.shuffle) == !1 ? this.playerIDs : Oi([...this.playerIDs]);
+    this.observer.placeManager = new Ze({
       [r[0]]: v.E,
       [r[1]]: v.S,
       [r[2]]: v.W,
@@ -9274,7 +9285,7 @@ class on {
     let n = this.hand(t).reached ? 1 : void 0;
     if (n) {
       const i = this.river.discards(t);
-      n = i.length == 0 || i.length == 1 && i[0].t.has(y.HORIZONTAL) ? 2 : 1;
+      n = i.length == 0 || i.length == 1 && i[0].t.has(g.HORIZONTAL) ? 2 : 1;
     }
     return {
       doraMarkers: this.observer.doraMarkers,
@@ -9335,10 +9346,10 @@ class on {
       const o = r.events[0];
       switch (r.type) {
         case "RON":
-          O(o.choices.RON, "ron choice is none"), this.actor.send({
+          k(o.choices.RON, "ron choice is none"), this.actor.send({
             type: r.type,
             iam: o.wind,
-            ret: De(o.choices.RON),
+            ret: Ce(o.choices.RON),
             targetInfo: {
               wind: o.discarterInfo.wind,
               tile: w.from(o.discarterInfo.tile)
@@ -9346,7 +9357,7 @@ class on {
           });
           break;
         case "DAI_KAN":
-          O(o.choices.DAI_KAN, "daikan choice is none"), this.actor.send({
+          k(o.choices.DAI_KAN, "daikan choice is none"), this.actor.send({
             type: r.type,
             iam: o.wind,
             block: yt.from(o.choices.DAI_KAN.tiles)
@@ -9355,7 +9366,7 @@ class on {
         case "CHI":
         case "PON":
           const a = o.choices[r.type];
-          O(a, `${r.type} choice is none`), O(
+          k(a, `${r.type} choice is none`), k(
             r.events.length == 1,
             `found more than one selected: ${JSON.stringify(r, null, 2)}`
           );
@@ -9368,23 +9379,23 @@ class on {
       }
     } else if (i.type == "CHOICE_AFTER_DRAWN") {
       const r = Ya(n);
-      O(
+      k(
         r.events.length == 1,
         `found more than one selected: ${JSON.stringify(r, null, 2)}`
       );
       const o = r.events[0], a = o.wind;
       switch (r.type) {
         case "TSUMO":
-          O(o.choices.TSUMO, "tsumo choice is none"), this.actor.send({
+          k(o.choices.TSUMO, "tsumo choice is none"), this.actor.send({
             type: r.type,
-            ret: De(o.choices.TSUMO),
+            ret: Ce(o.choices.TSUMO),
             lastTile: w.from(o.drawerInfo.tile),
             iam: a
           });
           break;
         case "REACH":
           const c = o.choices[r.type];
-          O(c, `${r.type} candidates is none`), this.actor.send({
+          k(c, `${r.type} candidates is none`), this.actor.send({
             type: "REACH",
             tile: w.from(c[0].tile),
             iam: a
@@ -9392,15 +9403,15 @@ class on {
           break;
         case "DISCARD":
           const h = o.choices[r.type];
-          O(h, `${r.type} choice is none`), this.actor.send({
+          k(h, `${r.type} choice is none`), this.actor.send({
             type: r.type,
-            tile: w.from(h[0]).clone({ remove: y.TSUMO }),
+            tile: w.from(h[0]).clone({ remove: g.TSUMO }),
             iam: a
           });
           break;
         case "AN_KAN": {
           const l = o.choices[r.type];
-          O(l, `${r.type} choice is none`), this.actor.send({
+          k(l, `${r.type} choice is none`), this.actor.send({
             type: r.type,
             block: Z.from(l[0].tiles),
             iam: a
@@ -9409,7 +9420,7 @@ class on {
         }
         case "SHO_KAN": {
           const l = o.choices[r.type];
-          O(l, `${r.type} choice is none`), this.actor.send({
+          k(l, `${r.type} choice is none`), this.actor.send({
             type: r.type,
             block: lt.from(l[0].tiles),
             iam: a
@@ -9421,7 +9432,7 @@ class on {
           break;
       }
     } else if (i.type == "CHOICE_AFTER_CALLED") {
-      O(
+      k(
         i.choices.DISCARD,
         `discard candidate tile is none: ${JSON.stringify(
           i,
@@ -9432,7 +9443,7 @@ class on {
       const r = i.wind, o = w.from(i.choices.DISCARD[0]);
       this.actor.send({ type: "DISCARD", tile: o, iam: r });
     } else if (i.type == "CHOICE_FOR_REACH_ACCEPTANCE") {
-      const r = n.filter((a) => (O(a.type == "CHOICE_FOR_REACH_ACCEPTANCE"), a.choices.RON !== !1));
+      const r = n.filter((a) => (k(a.type == "CHOICE_FOR_REACH_ACCEPTANCE"), a.choices.RON !== !1));
       if (r.length == 0) {
         this.actor.send({
           type: "REACH_ACCEPT",
@@ -9447,7 +9458,7 @@ class on {
       this.actor.send({
         type: "RON",
         iam: o.wind,
-        ret: De(o.choices.RON),
+        ret: Ce(o.choices.RON),
         targetInfo: {
           wind: o.reacherInfo.wind,
           tile: w.from(o.reacherInfo.tile)
@@ -9461,10 +9472,10 @@ class on {
         return;
       }
       const o = r[0];
-      O(o.choices.RON, "ron choice is none"), this.actor.send({
+      k(o.choices.RON, "ron choice is none"), this.actor.send({
         type: "RON",
         iam: o.wind,
-        ret: De(o.choices.RON),
+        ret: Ce(o.choices.RON),
         quadWin: !0,
         targetInfo: {
           wind: o.callerInfo.wind,
@@ -9484,11 +9495,11 @@ class on {
       },
       on: (a) => {
       }
-    }, r = n.map((a) => ({ id: a, handler: i })), o = new on(r);
-    return o.playerIDs = n, o.mailBox = e, o.observer.placeManager = new qe(t.players, {
+    }, r = n.map((a) => ({ id: a, handler: i })), o = new an(r);
+    return o.playerIDs = n, o.mailBox = e, o.observer.placeManager = new Ze(t.players, {
       round: structuredClone(t.round),
       sticks: structuredClone(t.sticks)
-    }), o.observer.scoreManager = new Ue(t.scores), o.wall = new Xt(t.wall), o;
+    }), o.observer.scoreManager = new qe(t.scores), o.wall = new Xt(t.wall), o;
   }
   start() {
     this.actor.subscribe((e) => {
@@ -9509,12 +9520,12 @@ class on {
       ;
   }
   finalResult(t, e) {
-    const n = this.hand(e), i = n.reached ? this.wall.blindDoraMarkers : void 0, r = new Ts(n, {
+    const n = this.hand(e), i = n.reached ? this.wall.blindDoraMarkers : void 0, r = new Os(n, {
       ...t.boardContext,
       sticks: this.placeManager.sticks,
       blindDoraMarkers: i
     }).calc([t.hand]);
-    return O(r), r;
+    return k(r), r;
   }
   doWin(t, e, n) {
     if (e == null) return !1;
@@ -9527,7 +9538,7 @@ class on {
     } else
       r.finalWallWin = !this.wall.canDraw, r.replacementWin = n == null ? void 0 : n.replacementWin;
     r.oneShotWin = n == null ? void 0 : n.oneShot;
-    const o = new Za(i), a = new Ts(i, r), c = o.calc(e), h = a.calc(c);
+    const o = new Za(i), a = new Os(i, r), c = o.calc(e), h = a.calc(c);
     if (!h || h.points.length == 0) return !1;
     if (i.draw == null) {
       const l = ee.candidateTiles(this.hand(t)).candidates;
@@ -9542,21 +9553,21 @@ class on {
     let r = n.clone({ removeAll: !0 });
     if (i.get(n.t, r.n) < 2) return !1;
     const o = _s(t, e, b.PON), a = [], c = new wt([r, r, r]).clone({
-      replace: { idx: o, tile: n.clone({ add: y.HORIZONTAL }) }
+      replace: { idx: o, tile: n.clone({ add: g.HORIZONTAL }) }
     });
     let h = c;
-    z(n) && n.has(y.RED) && (h = c.clone({
+    z(n) && n.has(g.RED) && (h = c.clone({
       replace: {
         idx: o,
         tile: new w(r.t, r.n, [
-          y.RED,
-          y.HORIZONTAL
+          g.RED,
+          g.HORIZONTAL
         ])
       }
     }));
     const l = o % 2 + 1;
     if (z(n) && i.get(n.t, 0) > 0 && (h = c.clone({
-      replace: { idx: l, tile: r.clone({ add: y.RED }) }
+      replace: { idx: l, tile: r.clone({ add: g.RED }) }
     })), a.push(h), z(r) && i.get(r.t, 5) == 3) {
       const u = c.clone({
         replace: { idx: l, tile: r }
@@ -9569,7 +9580,7 @@ class on {
     if (n == null || !n.isNum() || Ht(e) != t) return !1;
     const i = this.hand(t);
     if (i.reached || i.hands.length < 3) return !1;
-    let r = n.has(y.RED) ? new w(n.t, n.n, [y.HORIZONTAL, y.RED]) : n.clone({ removeAll: !0, add: y.HORIZONTAL });
+    let r = n.has(g.RED) ? new w(n.t, n.n, [g.HORIZONTAL, g.RED]) : n.clone({ removeAll: !0, add: g.HORIZONTAL });
     const o = [];
     r.n - 2 >= 1 && i.get(n.t, r.n - 2) > 0 && i.get(n.t, r.n - 1) > 0 && o.push(
       new ut([
@@ -9591,13 +9602,13 @@ class on {
       ])
     );
     for (let f = 0; f < o.length; f++) {
-      const m = o[f], d = this.cannotDiscardTile(m), g = [];
-      for (let k of d) {
-        const R = i.get(k.t, k.n);
-        for (let U = 0; U < R; U++)
-          g.push(k.clone({ remove: y.RED }));
+      const m = o[f], d = this.cannotDiscardTile(m), y = [];
+      for (let T of d) {
+        const R = i.get(T.t, T.n);
+        for (let F = 0; F < R; F++)
+          y.push(T.clone({ remove: g.RED }));
       }
-      const _ = i.dec([...g, m.tiles[1], m.tiles[2]]), x = i.hands.length == 0;
+      const _ = i.dec([...y, m.tiles[1], m.tiles[2]]), x = i.hands.length == 0;
       i.inc(_), x && o.splice(f, 1);
     }
     if (o.length == 0) return !1;
@@ -9609,17 +9620,17 @@ class on {
       (n) => z(n.tiles[1]) || z(n.tiles[2])
     ).map((n) => {
       if (z(n.tiles[1])) {
-        const i = n.tiles[1].clone({ add: y.RED });
+        const i = n.tiles[1].clone({ add: g.RED });
         return n.clone({ replace: { idx: 1, tile: i } });
       } else if (z(n.tiles[2])) {
-        const i = n.tiles[2].clone({ add: y.RED });
+        const i = n.tiles[2].clone({ add: g.RED });
         return n.clone({ replace: { idx: 2, tile: i } });
       }
     }).filter((n) => n != null);
   }
   doReach(t) {
     const e = this.hand(t);
-    return e.reached || !e.menzen || new sn(e).calc() > 0 ? !1 : ee.calcCandidates(e, e.hands);
+    return e.reached || !e.menzen || new rn(e).calc() > 0 ? !1 : ee.calcCandidates(e, e.hands);
   }
   doDiscard(t, e) {
     if (this.hand(t).reached) return [this.hand(t).drawn];
@@ -9628,7 +9639,7 @@ class on {
     if (e instanceof wt)
       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 O(
+    return k(
       r.length > 0,
       `no tiles to discard. hand: ${this.hand(
         t
@@ -9647,12 +9658,12 @@ class on {
       for (let r = 1; r < e.getArrayLen(i); r++)
         if (e.get(i, r) == 4) {
           const o = new w(i, r), a = [o, o, o, o];
-          z(o) && (a[1] = o.clone({ add: y.RED })), n.push(new Z(a));
+          z(o) && (a[1] = o.clone({ add: g.RED })), n.push(new Z(a));
         }
     if (n.length == 0) return !1;
     for (let i of n)
-      O(
-        i.tiles.filter((r) => r.has(y.HORIZONTAL)).length == 0,
+      k(
+        i.tiles.filter((r) => r.has(g.HORIZONTAL)).length == 0,
         `h op ${i.toString()}`
       );
     return n;
@@ -9666,17 +9677,17 @@ class on {
     for (let r of n) {
       const o = r.tiles[0].clone({
         removeAll: !0,
-        add: y.HORIZONTAL
+        add: g.HORIZONTAL
       });
       if (e.get(o.t, o.n) == 1) {
-        const a = z(o) && e.get(o.t, 0) > 0 ? o.clone({ add: y.RED }) : o;
+        const a = z(o) && e.get(o.t, 0) > 0 ? o.clone({ add: g.RED }) : o;
         i.push(new lt([...r.tiles, a]));
       }
     }
     if (i.length == 0) return !1;
     for (let r of i)
-      O(
-        r.tiles.filter((o) => o.has(y.HORIZONTAL)).length == 2,
+      k(
+        r.tiles.filter((o) => o.has(g.HORIZONTAL)).length == 2,
         `h op ${r.toString()}`
       );
     return i;
@@ -9688,30 +9699,30 @@ class on {
     if (i.get(r.t, r.n) != 3) return !1;
     const o = _s(t, e, b.DAI_KAN);
     let a = new yt([r, r, r, r]).clone({
-      replace: { idx: o, tile: r.clone({ add: y.HORIZONTAL }) }
+      replace: { idx: o, tile: r.clone({ add: g.HORIZONTAL }) }
     });
-    if (z(n) && n.has(y.RED))
+    if (z(n) && n.has(g.RED))
       a = a.clone({
         replace: {
           idx: o,
           tile: new w(r.t, r.n, [
-            y.HORIZONTAL,
-            y.RED
+            g.HORIZONTAL,
+            g.RED
           ])
         }
       });
-    else if (z(n) && !n.has(y.RED)) {
-      O(
+    else if (z(n) && !n.has(g.RED)) {
+      k(
         i.get(n.t, 0) > 0,
         `hand does not have red tile: ${i.toString()}`
       );
       const c = o % 3 + 1;
       a = a.clone({
-        replace: { idx: c, tile: r.clone({ add: y.RED }) }
+        replace: { idx: c, tile: r.clone({ add: g.RED }) }
       });
     }
-    return O(
-      a.tiles.filter((c) => c.has(y.HORIZONTAL)).length == 1,
+    return k(
+      a.tiles.filter((c) => c.has(g.HORIZONTAL)).length == 1,
       `h op ${a.toString()}`
     ), a;
   }
@@ -9721,7 +9732,7 @@ class on {
     let n = 0;
     for (let i of Object.values(p)) {
       if (i == p.BACK) continue;
-      const r = i == p.Z ? _e : gt;
+      const r = i == p.Z ? be : gt;
       for (let o of r)
         e.get(i, o) > 0 && n++;
     }
@@ -9731,7 +9742,7 @@ class on {
     return this.wall.initialHands();
   }
 }
-class oe extends nn {
+class oe extends sn {
   isBackHand() {
     for (let t of Object.values(p))
       if (t != p.BACK && this.sum(t) > 0)
@@ -9749,10 +9760,10 @@ class oe extends nn {
 class Gi {
   constructor(t, e) {
     A(this, "id");
-    A(this, "river", new Oi());
-    A(this, "placeManager", new qe({}));
+    A(this, "river", new ki());
+    A(this, "placeManager", new Ze({}));
     // empty for init
-    A(this, "scoreManager", new Ue({}));
+    A(this, "scoreManager", new qe({}));
     // empty for init
     A(this, "hands", G(new oe("")));
     // empty for init
@@ -9777,10 +9788,10 @@ class Gi {
       case "DISTRIBUTE":
         this.counter.reset();
         const e = w.from(t.doraMarker);
-        this.setHands(t), this.placeManager = new qe(structuredClone(t.places), {
+        this.setHands(t), this.placeManager = new Ze(structuredClone(t.places), {
           round: structuredClone(t.round),
           sticks: structuredClone(t.sticks)
-        }), this.scoreManager = new Ue(structuredClone(t.scores)), this.doraMarkers = [e], this.counter.dec(e);
+        }), this.scoreManager = new qe(structuredClone(t.scores)), this.doraMarkers = [e], this.counter.dec(e);
         for (let i of Object.values(v))
           i == t.wind && this.counter.dec(...this.hand(i).hands);
         break;
@@ -9803,21 +9814,21 @@ class Gi {
       case "DAI_KAN": {
         const i = P.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(y.HORIZONTAL))
+          ...i.tiles.filter((r) => !r.has(g.HORIZONTAL))
         );
         break;
       }
       case "SHO_KAN": {
         const i = lt.from(t.block.tiles);
         this.hands[t.iam].kan(i), t.iam != t.wind && this.counter.dec(
-          i.tiles.filter((r) => r.has(y.HORIZONTAL))[0]
+          i.tiles.filter((r) => r.has(g.HORIZONTAL))[0]
         );
         break;
       }
       case "AN_KAN": {
         const i = Z.from(t.block.tiles);
         this.hands[t.iam].kan(i), t.iam != t.wind && this.counter.dec(
-          ...i.tiles.filter((r) => !r.has(y.HORIZONTAL))
+          ...i.tiles.filter((r) => !r.has(g.HORIZONTAL))
         );
         break;
       }
@@ -9953,10 +9964,10 @@ class ah extends Gi {
     }
   }
 }
-class He extends Gi {
+class $e extends Gi {
   constructor(e, n) {
     super(e, n);
-    A(this, "river", new Oi());
+    A(this, "river", new ki());
     A(this, "doras", []);
     this.eventHandler.on((i) => this.handleEvent(i));
   }
@@ -9968,11 +9979,11 @@ class He extends Gi {
       this.hands[n] = new oe(e.hands[n]);
   }
   handleDiscard(e) {
-    const n = Object.values(v).filter((l) => l == this.myWind ? !1 : this.hand(l).reached), i = new sn(this.hand(this.myWind)).calc();
+    const n = Object.values(v).filter((l) => l == this.myWind ? !1 : this.hand(l).reached), i = new rn(this.hand(this.myWind)).calc();
     if (n.length > 0 && i >= 2)
       return pe.selectTile(this.counter, n, e);
-    const r = ee.calcCandidates(this.hand(this.myWind), e), a = Xe.calcPlayerCandidates(this.counter, r).sort((l, u) => u.sum - l.sum), c = a.filter((l) => l.sum == a[0].sum);
-    return Xe.selectMinPriority(
+    const r = ee.calcCandidates(this.hand(this.myWind), e), a = Je.calcPlayerCandidates(this.counter, r).sort((l, u) => u.sum - l.sum), c = a.filter((l) => l.sum == a[0].sum);
+    return Je.selectMinPriority(
       this.counter,
       c,
       this.doras
@@ -10009,13 +10020,13 @@ class yh {
     this.histories = JSON.parse(t);
   }
   next() {
-    O(this.index < this.histories.length), this.index++;
+    k(this.index < this.histories.length), this.index++;
   }
   prev() {
-    this.index--, O(this.index < 0);
+    this.index--, k(this.index < 0);
   }
   start() {
-    on.load(this.histories[this.index]).start();
+    an.load(this.histories[this.index]).start();
   }
   auto() {
     for (; this.index < this.histories.length; this.next())
@@ -10023,28 +10034,28 @@ class yh {
   }
 }
 const wh = (s) => {
-  const [t, e] = Ce(), [n, i] = Ce(), [r, o] = Ce(), [a, c] = Ce(), h = ["player-1", "player-2", "player-3", "player-4"], l = s == null ? void 0 : s.playerInjection, u = (l == null ? void 0 : l.p1) ?? He, f = (l == null ? void 0 : l.p2) ?? He, m = (l == null ? void 0 : l.p3) ?? He, d = (l == null ? void 0 : l.p4) ?? He, g = new u(h[0], e), _ = new f(h[1], i), x = new m(h[2], o), k = new d(h[3], c), R = [
+  const [t, e] = Me(), [n, i] = Me(), [r, o] = Me(), [a, c] = Me(), h = ["player-1", "player-2", "player-3", "player-4"], l = s == null ? void 0 : s.playerInjection, u = (l == null ? void 0 : l.p1) ?? $e, f = (l == null ? void 0 : l.p2) ?? $e, m = (l == null ? void 0 : l.p3) ?? $e, d = (l == null ? void 0 : l.p4) ?? $e, y = new u(h[0], e), _ = new f(h[1], i), x = new m(h[2], o), T = new d(h[3], c), R = [
     { handler: t, id: h[0] },
     { handler: n, id: h[1] },
     { handler: r, id: h[2] },
     { handler: a, id: h[3] }
   ];
   return {
-    c: new on(R, {
+    c: new an(R, {
       debug: s == null ? void 0 : s.debug,
       shuffle: s == null ? void 0 : s.shuffle
     }),
-    p1: g,
+    p1: y,
     p2: _,
     p3: x,
-    p4: k
+    p4: T
   };
-}, Tt = (s, t) => {
+}, Ot = (s, t) => {
   let n = 1;
   for (let i of t) i.equals(s) && (n *= 2);
   return n;
 };
-class Xe {
+class Je {
   static calcPlayerCandidates(t, e) {
     let n = [];
     for (let i of e) {
@@ -10064,10 +10075,10 @@ class Xe {
     return n;
   }
   static selectMinPriority(t, e, n) {
-    O(e.length > 0);
+    k(e.length > 0);
     let i = 0, r = 0;
     for (let o = 0; o < e.length; o++) {
-      const a = Xe.calcPriority(t, e[o], n);
+      const a = Je.calcPriority(t, e[o], n);
       a < i && (i = a, r = o);
     }
     return e[r];
@@ -10076,18 +10087,18 @@ class Xe {
     const i = e.tile;
     let r = 0;
     if (i.t == p.Z)
-      return r = t.get(i), (i.n == 5 || i.n == 6 || i.n == 7) && (r *= 2), r * Tt(i, n);
+      return r = t.get(i), (i.n == 5 || i.n == 6 || i.n == 7) && (r *= 2), r * Ot(i, n);
     {
       const o = t.get(i);
-      r += o * Tt(i, n);
-      const a = t.get(new w(i.t, i.n + 1)), c = t.get(new w(i.t, i.n + 2)), h = t.get(new w(i.t, i.n - 1)), l = t.get(new w(i.t, i.n - 2)), u = i.n - 2 > 0 ? Math.min(h, l) : 0, f = i.n + 2 <= 9 ? Math.min(a, c) : 0, m = i.n - 1 >= 1 && i.n + 1 <= 9 ? Math.min(a, h) : 0, d = Math.max(u, m), g = Math.max(m, f);
-      return r += o * Tt(i, n), r += u * Tt(new w(i.t, i.n - 2), n), r += f * Tt(new w(i.t, i.n + 2), n), r += d * Tt(new w(i.t, i.n - 1), n), r += g * Tt(new w(i.t, i.n + 1), n), i.n == 0, r;
+      r += o * Ot(i, n);
+      const a = t.get(new w(i.t, i.n + 1)), c = t.get(new w(i.t, i.n + 2)), h = t.get(new w(i.t, i.n - 1)), l = t.get(new w(i.t, i.n - 2)), u = i.n - 2 > 0 ? Math.min(h, l) : 0, f = i.n + 2 <= 9 ? Math.min(a, c) : 0, m = i.n - 1 >= 1 && i.n + 1 <= 9 ? Math.min(a, h) : 0, d = Math.max(u, m), y = Math.max(m, f);
+      return r += o * Ot(i, n), r += u * Ot(new w(i.t, i.n - 2), n), r += f * Ot(new w(i.t, i.n + 2), n), r += d * Ot(new w(i.t, i.n - 1), n), r += y * Ot(new w(i.t, i.n + 1), n), i.n == 0, r;
     }
   }
 }
 class pe {
   static selectTile(t, e, n) {
-    O(e.length > 0 && n.length > 0);
+    k(e.length > 0 && n.length > 0);
     let i = n[0], r = Number.POSITIVE_INFINITY;
     for (let o of n) {
       const a = pe.rank(t, e, o);
@@ -10132,60 +10143,60 @@ export {
   Za as BlockCalculator,
   ut as BlockChi,
   yt as BlockDaiKan,
-  Fn as BlockHand,
+  me as BlockHand,
   Ks as BlockIsolated,
-  Fs as BlockOther,
+  Us as BlockOther,
   V as BlockPair,
   wt as BlockPon,
   Ct as BlockRun,
   lt as BlockShoKan,
   ht as BlockThree,
-  on as Controller,
+  an as Controller,
   Qa as Counter,
-  Ts as DoubleCalculator,
+  Os as DoubleCalculator,
   ee as Efficiency,
   zs as FONT_FAMILY,
-  nn as Hand,
+  sn as Hand,
   Dt as INPUT_SEPARATOR,
   Ai as ImageHelper,
   lh as MeasureText,
   gt as N19,
-  _e as NZ,
-  y as OPERATOR,
+  be as NZ,
+  g as OPERATOR,
   ah as Observer,
   nt as Parser,
-  qe as PlaceManager,
-  He as Player,
-  Xe as PlayerEfficiency,
+  Ze as PlaceManager,
+  $e as Player,
+  Je as PlayerEfficiency,
   j as ROUND,
   Ls as ROUND_MAP,
   yh as Replayer,
   pe as RiskRank,
-  Oi as River,
-  Ue as ScoreManager,
-  sn as ShantenCalculator,
+  ki as River,
+  qe as ScoreManager,
+  rn as ShantenCalculator,
   tr as TABLE_CONTEXT,
   Rt as TILE_CONTEXT,
   p as TYPE,
   w as Tile,
   v as WIND,
-  Ln as WIND_MAP,
+  Kn as WIND_MAP,
   Xt as Wall,
   _s as callBlockIndex,
-  Ua as convertInput,
+  Fa as convertInput,
   js as createControllerMachine,
   Va as createEventEmitter,
-  Ce as createEventPipe,
+  Me as createEventPipe,
   de as createHand,
   wh as createLocalGame,
   Ia as createTable,
   G as createWindMap,
-  De as deserializeWinResult,
+  Ce as deserializeWinResult,
   ph as drawBlocks,
   gh as drawTable,
   oh as incrementalIDGenerator,
   z as isNum5,
-  $e as nextRound,
+  We as nextRound,
   Ht as nextWind,
   mh as optimizeSVG,
   ja as parse,
@@ -10194,7 +10205,7 @@ export {
   cr as prevWind,
   Ga as prioritizeDiscardedEvents,
   Ya as prioritizeDrawnEvents,
-  Ti as shuffle,
+  Oi as shuffle,
   sr as sortCalledTiles,
-  Je as tileSortFunc
+  Ve as tileSortFunc
 };