xmmath 1.0.5 → 1.0.7

package/dist/xmmath.es.js

@@ -1,97 +1,97 @@
-function s0(n) {
+function h0(n) {
   return n && n.__esModule && Object.prototype.hasOwnProperty.call(n, "default") ? n.default : n;
 }
 var B0 = { exports: {} };
 (function(n) {
   function l() {
-    var t = 0, r = 1, i = 2, B = 3, a = 4, F = 5, s = 6, b = 7, E = 8, v = 9, g = 10, M = 11, S = 12, z = 13, k = 14, P = 15, $ = 16, L = 17, _ = 0, G = 1, R = 2, J = 3, W = 4;
-    function U(x, C) {
-      return 55296 <= x.charCodeAt(C) && x.charCodeAt(C) <= 56319 && 56320 <= x.charCodeAt(C + 1) && x.charCodeAt(C + 1) <= 57343;
+    var t = 0, r = 1, C = 2, B = 3, a = 4, p = 5, F = 6, h = 7, b = 8, v = 9, i = 10, s = 11, f = 12, u = 13, D = 14, m = 15, O = 16, $ = 17, z = 0, U = 1, X = 2, A0 = 3, F0 = 4;
+    function p0(x, g) {
+      return 55296 <= x.charCodeAt(g) && x.charCodeAt(g) <= 56319 && 56320 <= x.charCodeAt(g + 1) && x.charCodeAt(g + 1) <= 57343;
     }
-    function K(x, C) {
-      C === void 0 && (C = 0);
-      var A = x.charCodeAt(C);
-      if (55296 <= A && A <= 56319 && C < x.length - 1) {
-        var u = A, m = x.charCodeAt(C + 1);
-        return 56320 <= m && m <= 57343 ? (u - 55296) * 1024 + (m - 56320) + 65536 : u;
+    function o(x, g) {
+      g === void 0 && (g = 0);
+      var q = x.charCodeAt(g);
+      if (55296 <= q && q <= 56319 && g < x.length - 1) {
+        var y = q, k = x.charCodeAt(g + 1);
+        return 56320 <= k && k <= 57343 ? (y - 55296) * 1024 + (k - 56320) + 65536 : y;
       }
-      if (56320 <= A && A <= 57343 && C >= 1) {
-        var u = x.charCodeAt(C - 1), m = A;
-        return 55296 <= u && u <= 56319 ? (u - 55296) * 1024 + (m - 56320) + 65536 : m;
+      if (56320 <= q && q <= 57343 && g >= 1) {
+        var y = x.charCodeAt(g - 1), k = q;
+        return 55296 <= y && y <= 56319 ? (y - 55296) * 1024 + (k - 56320) + 65536 : k;
       }
-      return A;
+      return q;
     }
-    function f(x, C, A) {
-      var u = [x].concat(C).concat([A]), m = u[u.length - 2], y = A, x0 = u.lastIndexOf(k);
-      if (x0 > 1 && u.slice(1, x0).every(function(j) {
-        return j == B;
-      }) && [B, z, L].indexOf(x) == -1)
-        return R;
-      var n0 = u.lastIndexOf(a);
-      if (n0 > 0 && u.slice(1, n0).every(function(j) {
-        return j == a;
-      }) && [S, a].indexOf(m) == -1)
-        return u.filter(function(j) {
-          return j == a;
-        }).length % 2 == 1 ? J : W;
-      if (m == t && y == r)
-        return _;
-      if (m == i || m == t || m == r)
-        return y == k && C.every(function(j) {
-          return j == B;
-        }) ? R : G;
-      if (y == i || y == t || y == r)
-        return G;
-      if (m == s && (y == s || y == b || y == v || y == g))
-        return _;
-      if ((m == v || m == b) && (y == b || y == E))
-        return _;
-      if ((m == g || m == E) && y == E)
-        return _;
-      if (y == B || y == P)
-        return _;
-      if (y == F)
-        return _;
-      if (m == S)
-        return _;
-      var l0 = u.indexOf(B) != -1 ? u.lastIndexOf(B) - 1 : u.length - 2;
-      return [z, L].indexOf(u[l0]) != -1 && u.slice(l0 + 1, -1).every(function(j) {
-        return j == B;
-      }) && y == k || m == P && [$, L].indexOf(y) != -1 ? _ : C.indexOf(a) != -1 ? R : m == a && y == a ? _ : G;
+    function f0(x, g, q) {
+      var y = [x].concat(g).concat([q]), k = y[y.length - 2], w = q, c = y.lastIndexOf(D);
+      if (c > 1 && y.slice(1, c).every(function(M) {
+        return M == B;
+      }) && [B, u, $].indexOf(x) == -1)
+        return X;
+      var x0 = y.lastIndexOf(a);
+      if (x0 > 0 && y.slice(1, x0).every(function(M) {
+        return M == a;
+      }) && [f, a].indexOf(k) == -1)
+        return y.filter(function(M) {
+          return M == a;
+        }).length % 2 == 1 ? A0 : F0;
+      if (k == t && w == r)
+        return z;
+      if (k == C || k == t || k == r)
+        return w == D && g.every(function(M) {
+          return M == B;
+        }) ? X : U;
+      if (w == C || w == t || w == r)
+        return U;
+      if (k == F && (w == F || w == h || w == v || w == i))
+        return z;
+      if ((k == v || k == h) && (w == h || w == b))
+        return z;
+      if ((k == i || k == b) && w == b)
+        return z;
+      if (w == B || w == m)
+        return z;
+      if (w == p)
+        return z;
+      if (k == f)
+        return z;
+      var n0 = y.indexOf(B) != -1 ? y.lastIndexOf(B) - 1 : y.length - 2;
+      return [u, $].indexOf(y[n0]) != -1 && y.slice(n0 + 1, -1).every(function(M) {
+        return M == B;
+      }) && w == D || k == m && [O, $].indexOf(w) != -1 ? z : g.indexOf(a) != -1 ? X : k == a && w == a ? z : U;
     }
-    this.nextBreak = function(x, C) {
-      if (C === void 0 && (C = 0), C < 0)
+    this.nextBreak = function(x, g) {
+      if (g === void 0 && (g = 0), g < 0)
         return 0;
-      if (C >= x.length - 1)
+      if (g >= x.length - 1)
         return x.length;
-      for (var A = p(K(x, C)), u = [], m = C + 1; m < x.length; m++)
-        if (!U(x, m - 1)) {
-          var y = p(K(x, m));
-          if (f(A, u, y))
-            return m;
-          u.push(y);
+      for (var q = d(o(x, g)), y = [], k = g + 1; k < x.length; k++)
+        if (!p0(x, k - 1)) {
+          var w = d(o(x, k));
+          if (f0(q, y, w))
+            return k;
+          y.push(w);
         }
       return x.length;
     }, this.splitGraphemes = function(x) {
-      for (var C = [], A = 0, u; (u = this.nextBreak(x, A)) < x.length; )
-        C.push(x.slice(A, u)), A = u;
-      return A < x.length && C.push(x.slice(A)), C;
+      for (var g = [], q = 0, y; (y = this.nextBreak(x, q)) < x.length; )
+        g.push(x.slice(q, y)), q = y;
+      return q < x.length && g.push(x.slice(q)), g;
     }, this.iterateGraphemes = function(x) {
-      var C = 0, A = {
+      var g = 0, q = {
         next: function() {
-          var u, m;
-          return (m = this.nextBreak(x, C)) < x.length ? (u = x.slice(C, m), C = m, { value: u, done: !1 }) : C < x.length ? (u = x.slice(C), C = x.length, { value: u, done: !1 }) : { value: void 0, done: !0 };
+          var y, k;
+          return (k = this.nextBreak(x, g)) < x.length ? (y = x.slice(g, k), g = k, { value: y, done: !1 }) : g < x.length ? (y = x.slice(g), g = x.length, { value: y, done: !1 }) : { value: void 0, done: !0 };
         }.bind(this)
       };
-      return typeof Symbol < "u" && Symbol.iterator && (A[Symbol.iterator] = function() {
-        return A;
-      }), A;
+      return typeof Symbol < "u" && Symbol.iterator && (q[Symbol.iterator] = function() {
+        return q;
+      }), q;
     }, this.countGraphemes = function(x) {
-      for (var C = 0, A = 0, u; (u = this.nextBreak(x, A)) < x.length; )
-        A = u, C++;
-      return A < x.length && C++, C;
+      for (var g = 0, q = 0, y; (y = this.nextBreak(x, q)) < x.length; )
+        q = y, g++;
+      return q < x.length && g++, g;
     };
-    function p(x) {
+    function d(x) {
       return 1536 <= x && x <= 1541 || // Cf   [6] ARABIC NUMBER SIGN..ARABIC NUMBER MARK ABOVE
       x == 1757 || // Cf       ARABIC END OF AYAH
       x == 1807 || // Cf       SYRIAC ABBREVIATION MARK
@@ -101,7 +101,7 @@ var B0 = { exports: {} };
       70082 <= x && x <= 70083 || // Lo   [2] SHARADA SIGN JIHVAMULIYA..SHARADA SIGN UPADHMANIYA
       x == 72250 || // Lo       ZANABAZAR SQUARE CLUSTER-INITIAL LETTER RA
       72326 <= x && x <= 72329 || // Lo   [4] SOYOMBO CLUSTER-INITIAL LETTER RA..SOYOMBO CLUSTER-INITIAL LETTER SA
-      x == 73030 ? S : x == 13 ? t : x == 10 ? r : 0 <= x && x <= 9 || // Cc  [10] <control-0000>..<control-0009>
+      x == 73030 ? f : x == 13 ? t : x == 10 ? r : 0 <= x && x <= 9 || // Cc  [10] <control-0000>..<control-0009>
       11 <= x && x <= 12 || // Cc   [2] <control-000B>..<control-000C>
       14 <= x && x <= 31 || // Cc  [18] <control-000E>..<control-001F>
       127 <= x && x <= 159 || // Cc  [33] <control-007F>..<control-009F>
@@ -126,7 +126,7 @@ var B0 = { exports: {} };
       x == 917505 || // Cf       LANGUAGE TAG
       917506 <= x && x <= 917535 || // Cn  [30] <reserved-E0002>..<reserved-E001F>
       917632 <= x && x <= 917759 || // Cn [128] <reserved-E0080>..<reserved-E00FF>
-      918e3 <= x && x <= 921599 ? i : 768 <= x && x <= 879 || // Mn [112] COMBINING GRAVE ACCENT..COMBINING LATIN SMALL LETTER X
+      918e3 <= x && x <= 921599 ? C : 768 <= x && x <= 879 || // Mn [112] COMBINING GRAVE ACCENT..COMBINING LATIN SMALL LETTER X
       1155 <= x && x <= 1159 || // Mn   [5] COMBINING CYRILLIC TITLO..COMBINING CYRILLIC POKRYTIE
       1160 <= x && x <= 1161 || // Me   [2] COMBINING CYRILLIC HUNDRED THOUSANDS SIGN..COMBINING CYRILLIC MILLIONS SIGN
       1425 <= x && x <= 1469 || // Mn  [45] HEBREW ACCENT ETNAHTA..HEBREW POINT METEG
@@ -598,10 +598,10 @@ var B0 = { exports: {} };
       x == 72884 || // Mc       MARCHEN VOWEL SIGN O
       94033 <= x && x <= 94078 || // Mc  [46] MIAO SIGN ASPIRATION..MIAO VOWEL SIGN NG
       x == 119142 || // Mc       MUSICAL SYMBOL COMBINING SPRECHGESANG STEM
-      x == 119149 ? F : 4352 <= x && x <= 4447 || // Lo  [96] HANGUL CHOSEONG KIYEOK..HANGUL CHOSEONG FILLER
-      43360 <= x && x <= 43388 ? s : 4448 <= x && x <= 4519 || // Lo  [72] HANGUL JUNGSEONG FILLER..HANGUL JUNGSEONG O-YAE
-      55216 <= x && x <= 55238 ? b : 4520 <= x && x <= 4607 || // Lo  [88] HANGUL JONGSEONG KIYEOK..HANGUL JONGSEONG SSANGNIEUN
-      55243 <= x && x <= 55291 ? E : x == 44032 || // Lo       HANGUL SYLLABLE GA
+      x == 119149 ? p : 4352 <= x && x <= 4447 || // Lo  [96] HANGUL CHOSEONG KIYEOK..HANGUL CHOSEONG FILLER
+      43360 <= x && x <= 43388 ? F : 4448 <= x && x <= 4519 || // Lo  [72] HANGUL JUNGSEONG FILLER..HANGUL JUNGSEONG O-YAE
+      55216 <= x && x <= 55238 ? h : 4520 <= x && x <= 4607 || // Lo  [88] HANGUL JONGSEONG KIYEOK..HANGUL JONGSEONG SSANGNIEUN
+      55243 <= x && x <= 55291 ? b : x == 44032 || // Lo       HANGUL SYLLABLE GA
       x == 44060 || // Lo       HANGUL SYLLABLE GAE
       x == 44088 || // Lo       HANGUL SYLLABLE GYA
       x == 44116 || // Lo       HANGUL SYLLABLE GYAE
@@ -1397,7 +1397,7 @@ var B0 = { exports: {} };
       55093 <= x && x <= 55119 || // Lo  [27] HANGUL SYLLABLE HYUG..HANGUL SYLLABLE HYUH
       55121 <= x && x <= 55147 || // Lo  [27] HANGUL SYLLABLE HEUG..HANGUL SYLLABLE HEUH
       55149 <= x && x <= 55175 || // Lo  [27] HANGUL SYLLABLE HYIG..HANGUL SYLLABLE HYIH
-      55177 <= x && x <= 55203 ? g : x == 9757 || // So       WHITE UP POINTING INDEX
+      55177 <= x && x <= 55203 ? i : x == 9757 || // So       WHITE UP POINTING INDEX
       x == 9977 || // So       PERSON WITH BALL
       9994 <= x && x <= 9997 || // So   [4] RAISED FIST..WRITING HAND
       x == 127877 || // So       FATHER CHRISTMAS
@@ -1427,7 +1427,7 @@ var B0 = { exports: {} };
       x == 129318 || // So       FACE PALM
       129328 <= x && x <= 129337 || // So  [10] PREGNANT WOMAN..JUGGLING
       129341 <= x && x <= 129342 || // So   [2] WATER POLO..HANDBALL
-      129489 <= x && x <= 129501 ? z : 127995 <= x && x <= 127999 ? k : x == 8205 ? P : x == 9792 || // So       FEMALE SIGN
+      129489 <= x && x <= 129501 ? u : 127995 <= x && x <= 127999 ? D : x == 8205 ? m : x == 9792 || // So       FEMALE SIGN
       x == 9794 || // So       MALE SIGN
       9877 <= x && x <= 9878 || // So   [2] STAFF OF AESCULAPIUS..SCALES
       x == 9992 || // So       AIRPLANE
@@ -1446,14 +1446,14 @@ var B0 = { exports: {} };
       x == 128300 || // So       MICROSCOPE
       x == 128488 || // So       LEFT SPEECH BUBBLE
       x == 128640 || // So       ROCKET
-      x == 128658 ? $ : 128102 <= x && x <= 128105 ? L : M;
+      x == 128658 ? O : 128102 <= x && x <= 128105 ? $ : s;
     }
     return this;
   }
   n.exports && (n.exports = l);
 })(B0);
-var F0 = B0.exports;
-const p0 = /* @__PURE__ */ s0(F0), f0 = `{
+var b0 = B0.exports;
+const E0 = /* @__PURE__ */ h0(b0), m0 = `{
     "wj": "⁠",
     "zwj": "‍",
     "zwnj": "‌",
@@ -1640,6 +1640,7 @@ const p0 = /* @__PURE__ */ s0(F0), f0 = `{
             "dot": "⋗",
             "double": "≫",
             "eq": "≥",
+            "eq.slant": "⩾",
             "eq.lt": "⋛",
             "eq.not": "≱",
             "eqq": "≧",
@@ -1666,6 +1667,7 @@ const p0 = /* @__PURE__ */ s0(F0), f0 = `{
             "dot": "⋖",
             "double": "≪",
             "eq": "≤",
+            "eq.slant": "⩽",
             "eq.gt": "⋚",
             "eq.not": "≰",
             "eqq": "≦",
@@ -2226,87 +2228,87 @@ const p0 = /* @__PURE__ */ s0(F0), f0 = `{
     "dotless": [{ "i": "𝚤", "j": "𝚥" }]
 }
 `;
-function D(n, l, t) {
+function A(n, l, t) {
   let r = document.createElementNS("http://www.w3.org/1998/Math/MathML", n);
   if (l && (r.textContent = l), t)
-    for (let i in t)
-      r.setAttribute(i, t[i]);
+    for (let C in t)
+      r.setAttribute(C, t[C]);
   return r;
 }
-const I = "mathvariant";
-var b0 = new p0();
-function E0(n) {
-  let l = /[a-zA-Z]/, t = /[\(\)]/, r = /[ \t\n\r]+/, i = "", B = [], a = [], F = B, s = "";
+const Z = "mathvariant";
+var v0 = new E0();
+function g0(n) {
+  let l = /[a-zA-Z]/, t = /[\(\)]/, r = /[ \t\n\r]+/, C = "", B = [], a = [], p = B, F = "";
   n = n.replace(/(\\u\{[\dA-Fa-f]+\})/g, (v) => {
-    const g = parseInt(v.slice(3, -1), 16);
-    return String.fromCodePoint(g);
+    const i = parseInt(v.slice(3, -1), 16);
+    return String.fromCodePoint(i);
   });
-  let b = [];
+  let h = [];
   for (let v = 0; v < n.length; v++) {
-    const g = n[v];
-    if (g == '"' && n[v - 1] != "\\") {
-      i != "str" ? i = "str" : i = "";
+    const i = n[v];
+    if (i == '"' && n[v - 1] != "\\") {
+      C != "str" ? C = "str" : C = "";
       continue;
     }
-    i != "str" && (g == "(" && b.push(v), g == ")" && (b.length == 0 || n[v - 1] != "\\" && b.pop()));
+    C != "str" && (i == "(" && h.push(v), i == ")" && (h.length == 0 || n[v - 1] != "\\" && h.pop()));
   }
-  let E = b0.splitGraphemes(n);
-  for (let v = 0; v < E.length; v++) {
-    const g = E[v];
-    if (g == '"' && E[v - 1] != "\\") {
-      i != "str" ? i = "str" : (F.push({ type: i, value: s }), i = "", s = "");
+  let b = e.emoji ? v0.splitGraphemes(n) : [...n];
+  for (let v = 0; v < b.length; v++) {
+    const i = b[v];
+    if (i == '"' && b[v - 1] != "\\") {
+      C != "str" ? C = "str" : (p.push({ type: C, value: F }), C = "", F = "");
       continue;
     }
-    if (i == "str") {
-      s += g;
+    if (C == "str") {
+      F += i;
       continue;
     }
-    if (g.match(r) && (i = "blank"), i == "blank" && !g.match(r) && (F.push({ type: i, value: "" }), i = ""), i == "" && (!E[v - 1] || !E[v - 1].match(l)) && (!E[v + 1] || !E[v + 1].match(l)) && !g.match(t)) {
-      F.push({ type: "v", value: g });
+    if (i.match(r) && (C = "blank"), C == "blank" && !i.match(r) && (p.push({ type: C, value: "" }), C = ""), C == "" && (!b[v - 1] || !b[v - 1].match(l)) && (!b[v + 1] || !b[v + 1].match(l)) && !i.match(t)) {
+      p.push({ type: "v", value: i });
       continue;
     }
-    if (i == "" && !g.match(l) && !g.match(t)) {
-      F.push({ type: "v", value: g });
+    if (C == "" && !i.match(l) && !i.match(t)) {
+      p.push({ type: "v", value: i });
       continue;
     }
-    if ((E[v - 1] && E[v - 1].match(l) || E[v + 1] && E[v + 1].match(l)) && g.match(l) && (i = "f"), i == "f" && (s += g), i == "f" && (!E[v + 1] || !E[v + 1].match(l)) && (F.push({ type: i, value: s }), i = "", s = ""), g == "(")
-      if (b.includes(v) || E[v - 1] == "\\")
-        F.push({ type: "v", value: g });
+    if ((b[v - 1] && b[v - 1].match(l) || b[v + 1] && b[v + 1].match(l)) && i.match(l) && (C = "f"), C == "f" && (F += i), C == "f" && (!b[v + 1] || !b[v + 1].match(l)) && (p.push({ type: C, value: F }), C = "", F = ""), i == "(")
+      if (h.includes(v) || b[v - 1] == "\\")
+        p.push({ type: "v", value: i });
       else {
-        a.push({ tree: F, close: !1 }), F.push({ type: "group", value: s, children: [] }), F = F.at(-1).children, s = "";
+        a.push({ tree: p, close: !1 }), p.push({ type: "group", value: F, children: [] }), p = p.at(-1).children, F = "";
         continue;
       }
-    if (g == ")")
+    if (i == ")")
       if (a.at(-1)) {
         if (a.at(-1).close == !1) {
-          a.at(-1).close = !0, F = a.at(-1).tree, a.pop();
+          a.at(-1).close = !0, p = a.at(-1).tree, a.pop();
           continue;
         }
       } else
-        F.push({ type: "v", value: g });
+        p.push({ type: "v", value: i });
   }
   return B;
 }
-let X = JSON.parse(f0), w = {};
-for (let n in X)
-  if (typeof X[n] == "string")
-    w[n] = X[n];
+let K = JSON.parse(m0), _ = {};
+for (let n in K)
+  if (typeof K[n] == "string")
+    _[n] = K[n];
   else
-    for (let l of X[n])
+    for (let l of K[n])
       if (typeof l == "string")
-        w[n] = l;
+        _[n] = l;
       else {
-        w[n] || (w[n] = l[Object.keys(l)[0]]);
+        _[n] || (_[n] = l[Object.keys(l)[0]]);
         for (let t in l) {
-          w[`${n}.${t}`] = l[t];
+          _[`${n}.${t}`] = l[t];
           let r = t.split(".");
-          for (let i = 1; i < r.length; i++) {
-            let B = r.slice(0, i).join(".");
-            l[B] || (w[`${n}.${B}`] = l[t]);
+          for (let C = 1; C < r.length; C++) {
+            let B = r.slice(0, C).join(".");
+            l[B] || (_[`${n}.${B}`] = l[t]);
           }
         }
       }
-let o = {
+let W = {
   "->": "arrow.r",
   "|->": "arrow.r.bar",
   "=>": "arrow.r.double",
@@ -2349,200 +2351,200 @@ let o = {
   "-": "minus",
   "'": "prime",
   "~": "space.nobreak"
-}, d = 0;
-for (let n in o)
-  n.length > d && (d = n.length);
-let O = {
+}, Q = 0;
+for (let n in W)
+  n.length > Q && (Q = n.length);
+let j = {
   accent: (n, l) => {
-    let t = D("mrow");
-    t.append(h(n[0]));
-    let r = D("mrow");
-    r.append(h(n[1]));
-    let i = D("mover");
-    return i.setAttribute("accent", "true"), i.append(t, r), i;
+    let t = A("mrow");
+    t.append(E(n[0]));
+    let r = A("mrow");
+    r.append(E(n[1]));
+    let C = A("mover");
+    return C.setAttribute("accent", "true"), C.append(t, r), C;
   },
   attach: (n, l) => {
-    let t = D("mrow");
-    t.append(h(n[0]));
-    let r, i = D("mrow");
-    l.tl && i.append(h(l.tl));
-    let B = D("mrow");
-    l.bl && B.append(h(l.bl));
-    let a = D("mrow");
-    l.tr && a.append(h(l.tr));
-    let F = D("mrow");
-    if (l.br && F.append(h(l.br)), (l.tl || l.bl || l.tr || l.br) && (l.tl || l.bl ? (r = D("mmultiscripts"), r.append(t, F, a, D("mprescripts"), B, i)) : l.tr && l.br ? (r = D("msubsup"), r.append(t, F, a)) : l.tr ? (r = D("msup"), r.append(t, a)) : (r = D("msub"), r.append(t, F))), l.t || l.b) {
-      let s = D("munderover");
-      r ? s.append(r) : s.append(t);
-      let b = D("mrow");
-      l.t && b.append(h(l.t));
-      let E = D("mrow");
-      l.b && E.append(h(l.b)), s.append(E, b), r = s;
+    let t = A("mrow");
+    t.append(E(n[0]));
+    let r, C = A("mrow");
+    l.tl && C.append(E(l.tl));
+    let B = A("mrow");
+    l.bl && B.append(E(l.bl));
+    let a = A("mrow");
+    l.tr && a.append(E(l.tr));
+    let p = A("mrow");
+    if (l.br && p.append(E(l.br)), (l.tl || l.bl || l.tr || l.br) && (l.tl || l.bl ? (r = A("mmultiscripts"), r.append(t, p, a, A("mprescripts"), B, C)) : l.tr && l.br ? (r = A("msubsup"), r.append(t, p, a)) : l.tr ? (r = A("msup"), r.append(t, a)) : (r = A("msub"), r.append(t, p))), l.t || l.b) {
+      let F = A("munderover");
+      r ? F.append(r) : F.append(t);
+      let h = A("mrow");
+      l.t && h.append(E(l.t));
+      let b = A("mrow");
+      l.b && b.append(E(l.b)), F.append(b, h), r = F;
     }
     return r;
   },
-  scripts: (n, l) => h(n[0]),
-  limits: (n, l) => h(n[0]),
+  scripts: (n, l) => E(n[0]),
+  limits: (n, l) => E(n[0]),
   binom: (n, l) => {
-    let t = D("mrow"), r = D("mrow");
-    r.append(h(n[0]));
-    let i = D("mrow");
-    i.append(h(n[1]));
-    let B = D("mfrac", null, { linethickness: "0" });
-    B.append(r, i);
-    let a = D("mo", "("), F = D("mo", ")");
-    return t.append(a, B, F), t;
+    let t = A("mrow"), r = A("mrow");
+    r.append(E(n[0]));
+    let C = A("mrow");
+    C.append(E(n[1]));
+    let B = A("mfrac", null, { linethickness: "0" });
+    B.append(r, C);
+    let a = A("mo", "("), p = A("mo", ")");
+    return t.append(a, B, p), t;
   },
   cancel: (n, l) => {
-    let t = D("mrow");
+    let t = A("mrow");
     const r = (B) => `linear-gradient(to ${B ? "left" : "right"} top, transparent 47.75%, currentColor 49.5%, currentColor 50.5%, transparent 52.25%)`;
-    let i = "";
-    return r0(l.cross) ? i = r(!0) + "," + r(!1) : r0(l.inverted) ? i = r(!1) : i = r(!0), t.style.backgroundImage = i, t.append(h(n[0])), t;
+    let C = "";
+    return r0(l.cross) ? C = r(!0) + "," + r(!1) : r0(l.inverted) ? C = r(!1) : C = r(!0), t.style.backgroundImage = C, t.append(E(n[0])), t;
   },
   cases: (n, l) => {
     var B, a;
-    let t = D("mrow"), r = D("mo", ((a = (B = l == null ? void 0 : l.delim) == null ? void 0 : B[0]) == null ? void 0 : a.value) || "{"), i = O.x_table(n, { cases: [] });
-    return t.append(r, i), t;
+    let t = A("mrow"), r = A("mo", ((a = (B = l == null ? void 0 : l.delim) == null ? void 0 : B[0]) == null ? void 0 : a.value) || "{"), C = j.x_table(n, { cases: [] });
+    return t.append(r, C), t;
   },
   frac: (n, l) => {
     console.log(n);
-    let t = D("mrow");
-    t.append(h(n[0]));
-    let r = D("mrow");
-    r.append(h(n[1]));
-    let i = D("mfrac");
-    return i.append(t, r), i;
+    let t = A("mrow");
+    t.append(E(n[0]));
+    let r = A("mrow");
+    r.append(E(n[1]));
+    let C = A("mfrac");
+    return C.append(t, r), C;
   },
   lr: (n, l) => {
-    let t = n[0], r, i;
-    for (let b = 0; b < t.length; b++) {
-      const E = t[b];
-      if (E.type != "blank") {
-        r = { c: [E], n: b };
+    let t = n[0], r, C;
+    for (let h = 0; h < t.length; h++) {
+      const b = t[h];
+      if (b.type != "blank") {
+        r = { c: [b], n: h };
         break;
       }
     }
-    for (let b = t.length - 1; b >= 0; b--) {
-      const E = t[b];
-      if (E.type != "blank") {
-        i = { c: [E], n: b };
+    for (let h = t.length - 1; h >= 0; h--) {
+      const b = t[h];
+      if (b.type != "blank") {
+        C = { c: [b], n: h };
         break;
       }
     }
     let B = document.createDocumentFragment();
-    B.append(h(r.c));
+    B.append(E(r.c));
     let a = document.createDocumentFragment();
-    a.append(h(i.c));
-    let F = document.createDocumentFragment();
-    F.append(h(t.slice(r.n + 1, i.n)));
-    let s = D("mrow");
-    return s.append(B, F, a), s;
+    a.append(E(C.c));
+    let p = document.createDocumentFragment();
+    p.append(E(t.slice(r.n + 1, C.n)));
+    let F = A("mrow");
+    return F.append(B, p, a), F;
   },
   mat: (n, l, t) => {
-    var b, E;
-    let r = ((E = (b = l == null ? void 0 : l.delim) == null ? void 0 : b[0]) == null ? void 0 : E.value) || "(", i = { "(": ["(", ")"], "[": ["[", "]"], "{": ["{", "}"], "|": ["|", "|"], "||": ["‖", "‖"] }, B = D("mrow"), a = D("mo", i[r][0]), F = D("mo", i[r][1]), s = D("mtable");
+    var h, b;
+    let r = ((b = (h = l == null ? void 0 : l.delim) == null ? void 0 : h[0]) == null ? void 0 : b.value) || "(", C = { "(": ["(", ")"], "[": ["[", "]"], "{": ["{", "}"], "|": ["|", "|"], "||": ["‖", "‖"] }, B = A("mrow"), a = A("mo", C[r][0]), p = A("mo", C[r][1]), F = A("mtable");
     for (let v of t) {
-      let g = D("mtr");
-      for (let M of v) {
-        let S = D("mtd");
-        S.append(h(M)), g.append(S);
+      let i = A("mtr");
+      for (let s of v) {
+        let f = A("mtd");
+        f.append(E(s)), i.append(f);
       }
-      s.append(g);
+      F.append(i);
     }
-    return B.append(a, s, F), B;
+    return B.append(a, F, p), B;
   },
   root: (n, l) => {
-    let t = D("mrow");
-    t.append(h(n[0]));
-    let r = D("mrow");
-    r.append(h(n[1]));
-    let i = D("mroot");
-    return i.append(r, t), i;
+    let t = A("mrow");
+    t.append(E(n[0]));
+    let r = A("mrow");
+    r.append(E(n[1]));
+    let C = A("mroot");
+    return C.append(r, t), C;
   },
-  sqrt: (n, l) => O.root([[], n[0]], null),
+  sqrt: (n, l) => j.root([[], n[0]], null),
   display: (n, l) => {
-    let t = D("mrow", null, { displaystyle: "true" });
-    return t.append(h(n[0])), t;
+    let t = A("mrow", null, { displaystyle: "true" });
+    return t.append(E(n[0])), t;
   },
   inline: (n, l) => {
-    let t = D("mrow", null, { displaystyle: "false", scriptlevel: "0" });
-    return t.append(h(n[0])), t;
+    let t = A("mrow", null, { displaystyle: "false", scriptlevel: "0" });
+    return t.append(E(n[0])), t;
   },
   script: (n, l) => {
-    let t = D("mrow", null, { displaystyle: "false", scriptlevel: "1" });
-    return t.append(h(n[0])), t;
+    let t = A("mrow", null, { displaystyle: "false", scriptlevel: "1" });
+    return t.append(E(n[0])), t;
   },
   sscript: (n, l) => {
-    let t = D("mrow", null, { displaystyle: "false", scriptlevel: "2" });
-    return t.append(h(n[0])), t;
+    let t = A("mrow", null, { displaystyle: "false", scriptlevel: "2" });
+    return t.append(E(n[0])), t;
   },
   upright: (n, l) => {
-    let t = D("mrow");
-    return t.append(h(n[0])), t.querySelectorAll("mi").forEach((r) => {
-      r.getAttribute(I) || r.setAttribute(I, "normal");
+    let t = A("mrow");
+    return t.append(E(n[0])), t.querySelectorAll("mi").forEach((r) => {
+      r.getAttribute(Z) || r.setAttribute(Z, "normal");
     }), t.querySelectorAll("ms").forEach((r) => {
-      r.getAttribute(I) || r.setAttribute(I, "normal");
+      r.getAttribute(Z) || r.setAttribute(Z, "normal");
     }), t;
   },
   italic: (n, l) => {
-    let t = D("mrow");
+    let t = A("mrow");
     return t.querySelectorAll("mi").forEach((r) => {
-      r.getAttribute(I) || r.setAttribute(I, "italic");
+      r.getAttribute(Z) || r.setAttribute(Z, "italic");
     }), t.querySelectorAll("ms").forEach((r) => {
-      r.getAttribute(I) || r.setAttribute(I, "italic");
-    }), t.append(h(n[0])), t;
+      r.getAttribute(Z) || r.setAttribute(Z, "italic");
+    }), t.append(E(n[0])), t;
   },
   bold: (n, l) => {
-    let t = D("mrow");
-    return t.style.fontWeight = "bold", t.append(h(n[0])), t;
+    let t = A("mrow");
+    return t.style.fontWeight = "bold", t.append(E(n[0])), t;
   },
   op: (n, l, t, r) => {
-    let i = D("mrow"), B = D("ms", c(n[0][0].value, r));
-    return i.append(B), i;
+    let C = A("mrow"), B = A("ms", Y(n[0][0].value, r));
+    return C.append(B), C;
   },
-  underline: (n, l) => T("under", n[0], "_", n == null ? void 0 : n[1]),
-  overline: (n, l) => T("over", n[0], "‾", n == null ? void 0 : n[1]),
-  underbrace: (n, l) => T("under", n[0], "⏟", n == null ? void 0 : n[1]),
-  overbrace: (n, l) => T("over", n[0], "⏞", n == null ? void 0 : n[1]),
-  underbracket: (n, l) => T("under", n[0], "⎵", n == null ? void 0 : n[1]),
-  overbracket: (n, l) => T("over", n[0], "⎴", n == null ? void 0 : n[1]),
-  serif: (n, l) => h(n[0], "serif"),
-  sans: (n, l) => h(n[0], "sans"),
-  frak: (n, l) => h(n[0], "frak"),
-  mono: (n, l) => h(n[0], "mono"),
-  bb: (n, l) => h(n[0], "bb"),
-  cal: (n, l) => h(n[0], "cal"),
+  underline: (n, l) => R("under", n[0], "_", n == null ? void 0 : n[1]),
+  overline: (n, l) => R("over", n[0], "‾", n == null ? void 0 : n[1]),
+  underbrace: (n, l) => R("under", n[0], "⏟", n == null ? void 0 : n[1]),
+  overbrace: (n, l) => R("over", n[0], "⏞", n == null ? void 0 : n[1]),
+  underbracket: (n, l) => R("under", n[0], "⎵", n == null ? void 0 : n[1]),
+  overbracket: (n, l) => R("over", n[0], "⎴", n == null ? void 0 : n[1]),
+  serif: (n, l) => E(n[0], "serif"),
+  sans: (n, l) => E(n[0], "sans"),
+  frak: (n, l) => E(n[0], "frak"),
+  mono: (n, l) => E(n[0], "mono"),
+  bb: (n, l) => E(n[0], "bb"),
+  cal: (n, l) => E(n[0], "cal"),
   vec: (n, l) => {
-    var s, b;
-    let t = ((b = (s = l == null ? void 0 : l.delim) == null ? void 0 : s[0]) == null ? void 0 : b.value) || "(", r = { "(": ["(", ")"], "[": ["[", "]"], "{": ["{", "}"], "|": ["|", "|"], "||": ["‖", "‖"] }, i = D("mrow"), B = D("mo", r[t][0]), a = D("mo", r[t][1]), F = D("mtable");
-    for (let E of n) {
-      let v = D("mtr");
-      v.append(h(E)), F.append(v);
+    var F, h;
+    let t = ((h = (F = l == null ? void 0 : l.delim) == null ? void 0 : F[0]) == null ? void 0 : h.value) || "(", r = { "(": ["(", ")"], "[": ["[", "]"], "{": ["{", "}"], "|": ["|", "|"], "||": ["‖", "‖"] }, C = A("mrow"), B = A("mo", r[t][0]), a = A("mo", r[t][1]), p = A("mtable");
+    for (let b of n) {
+      let v = A("mtr");
+      v.append(E(b)), p.append(v);
     }
-    return i.append(B, F, a), i;
+    return C.append(B, p, a), C;
   },
   // 额外
   //
   x_table: (n, l) => {
-    let t = 0, r = D("mtable");
+    let t = 0, r = A("mtable");
     for (let B of n) {
-      let a = D("mtr"), F = [], s = [];
-      for (let b = 0; b < B.length; b++)
-        !B[b].esc && B[b].value == "&" ? s.length > 0 && (F.push(s), s = []) : s.push(B[b]);
-      s.length > 0 && F.push(s), F.length > t && (t = F.length);
-      for (let b of F) {
-        let E = D("mtd");
-        a.append(E), E.append(h(b));
+      let a = A("mtr"), p = [], F = [];
+      for (let h = 0; h < B.length; h++)
+        !B[h].esc && B[h].value == "&" ? F.length > 0 && (p.push(F), F = []) : F.push(B[h]);
+      F.length > 0 && p.push(F), p.length > t && (t = p.length);
+      for (let h of p) {
+        let b = A("mtd");
+        a.append(b), b.append(E(h));
       }
       r.append(a);
     }
-    let i = [];
+    let C = [];
     if (l.cases)
-      i.push("left");
+      C.push("left");
     else
       for (let B = 0; B < t; B++)
-        B % 2 == 0 ? i.push("right") : i.push("left");
-    return r.setAttribute("columnalign", i.join(" ")), r;
+        B % 2 == 0 ? C.push("right") : C.push("left");
+    return r.setAttribute("columnalign", C.join(" ")), r;
   }
 }, i0 = [
   { id: "arccos" },
@@ -2582,10 +2584,10 @@ let O = {
   { id: "liminf", str: "lim inf", limits: !0 },
   { id: "limsup", str: "lim sup", limits: !0 }
 ];
-function h0() {
+function y0() {
   for (let n of i0)
-    O[n.id] = (l, t, r, i) => {
-      let B = O.op([[{ type: "str", value: n.str || n.id }]], {}, null, i);
+    j[n.id] = (l, t, r, C) => {
+      let B = j.op([[{ type: "str", value: n.str || n.id }]], {}, null, C);
       if (l) {
         let a = document.createDocumentFragment();
         return a.append(B, D0(l[0])), a;
@@ -2593,12 +2595,12 @@ function h0() {
         return B;
     };
 }
-h0();
+y0();
 let a0 = [], u0 = ["∏", "∐", "∑", "⋀", "⋁", "⋂", "⋃", "⨀", "⨁", "⨂", "⨃", "⨄", "⨅", "⨆"];
-for (let n in w)
+for (let n in _)
   for (let l of u0)
-    w[n] == l && a0.push(n);
-function m0() {
+    _[n] == l && a0.push(n);
+function k0() {
   const n = [
     "grave",
     "acute",
@@ -2617,53 +2619,59 @@ function m0() {
     "arrow.l"
   ];
   for (let l of n)
-    O[l] = (t) => O.accent([t[0], [{ type: "f", value: l }]], {});
+    j[l] = (t) => j.accent([t[0], [{ type: "f", value: l }]], {});
 }
-m0();
-function v0() {
+k0();
+function q0() {
   let n = [
-    { name: "abs", l: N("|"), r: N("|") },
-    { name: "norm", l: N("‖"), r: N("‖") },
-    { name: "floor", l: N("⌊"), r: N("⌋") },
-    { name: "ceil", l: N("⌈"), r: N("⌉") },
-    { name: "round", l: N("⌊"), r: N("⌉") }
+    { name: "abs", l: S("|"), r: S("|") },
+    { name: "norm", l: S("‖"), r: S("‖") },
+    { name: "floor", l: S("⌊"), r: S("⌋") },
+    { name: "ceil", l: S("⌈"), r: S("⌉") },
+    { name: "round", l: S("⌊"), r: S("⌉") }
   ];
   for (let l of n)
-    O[l.name] = (t) => O.lr([[l.l, ...t[0], l.r]], {});
+    j[l.name] = (t) => j.lr([[l.l, ...t[0], l.r]], {});
 }
-v0();
-function T(n, l, t, r) {
-  let i = n == "under" ? D("munder", null, { accentunder: "true" }) : D("mover", null, { accent: "true" }), B = D("mrow");
-  if (B.append(h(l)), r) {
-    let a = D("mrow");
-    a.append(h(r));
-    let F = n == "under" ? D("munder") : D("mover"), s = D("mo", t);
-    F.append(s, a), i.append(B, F);
+q0();
+function R(n, l, t, r) {
+  let C = n == "under" ? A("munder", null, { accentunder: "true" }) : A("mover", null, { accent: "true" }), B = A("mrow");
+  if (B.append(E(l)), r) {
+    let a = A("mrow");
+    a.append(E(r));
+    let p = n == "under" ? A("munder") : A("mover"), F = A("mo", t);
+    p.append(F, a), C.append(B, p);
   } else {
-    let a = D("mo", t);
-    i.append(B, a);
+    let a = A("mo", t);
+    C.append(B, a);
   }
-  return i;
+  return C;
 }
 function D0(n) {
-  let l = D("mrow"), t = D("mo");
+  let l = A("mrow"), t = A("mo");
   t.textContent = "(";
-  let r = h(n), i = D("mo");
-  return i.textContent = ")", l.append(t, r, i), l;
+  let r = E(n), C = A("mo");
+  return C.textContent = ")", l.append(t, r, C), l;
 }
-function q(n) {
+function N(n) {
   return n.type == "group" ? n.children : [n];
 }
-function g0(n) {
+function w0(n) {
   return [{ type: "group", value: "", children: n }];
 }
-function V(n) {
-  return n ? n.value == "/" && !n.esc : !1;
+function I(n) {
+  return n && n.type == "v" && n.value == "^" && !n.esc;
 }
-function t0(n) {
-  return n ? n.value == "br" && n.esc : !1;
+function L(n) {
+  return n && n.type == "v" && n.value == "_" && !n.esc;
+}
+function P(n) {
+  return n && n.type == "v" && n.value == "/" && !n.esc;
+}
+function l0(n) {
+  return n && n.value == "br" && n.esc;
 }
-function Q(n) {
+function V(n) {
   if (n.length == 1) {
     let l = n[0];
     if (l.type == "f") {
@@ -2675,10 +2683,10 @@ function Q(n) {
       if (l.value == "scripts")
         return !1;
       if (l.value == "op") {
-        let { dic: t } = A0(l), r = "";
+        let { dic: t } = s0(l), r = "";
         if (t.limits)
-          for (let i of t.limits)
-            r += i.value;
+          for (let C of t.limits)
+            r += C.value;
         return r == "#true";
       }
     }
@@ -2687,23 +2695,29 @@ function Q(n) {
   } else
     return !1;
 }
-function H(n, l) {
+function T(n, l) {
   return n.value == l && n.type == "v" && !n.esc;
 }
-function Y(n) {
+function H(n) {
   return n && n.type == "v" && n.value == ".";
 }
-let Z = { type: "v", value: "," };
-function N(n) {
+function t0(n) {
+  return n && (n.type == "f" || n.type == "v" && n.value.match(/[a-z]/));
+}
+function _0(n) {
+  return n && n.type == "v" && n.value == "!" && !n.esc;
+}
+let G = { type: "v", value: "," };
+function S(n) {
   return { type: "v", value: n };
 }
-function e(n) {
+function J(n) {
   let l = [];
   for (let t in n) {
     l.push({ type: "f", value: t }), l.push({ type: "v", value: ":" });
     for (let r of n[t])
       r.type == "v" && r.value == "," && (r.esc = !0);
-    l.push(...n[t]), Number(t) + 1 != Object.keys(n).length && l.push(Z);
+    l.push(...n[t]), Number(t) + 1 != Object.keys(n).length && l.push(G);
   }
   return l;
 }
@@ -2712,211 +2726,222 @@ function r0(n) {
   return !!(n && (n[0].type == "blank" && l++, n[l] && n[l].type == "v" && n[l].value == "#" && n[l + 1] && n[l + 1].type == "f" && n[l + 1].value == "true"));
 }
 function C0(n) {
-  var l, t, r, i, B, a, F, s, b, E, v, g, M, S, z, k, P, $, L, _, G, R, J, W, U, K;
+  var l, t, r, C, B, a, p, F, h, b, v;
   {
-    let f = [], p = /[0-9]/, x = "";
-    for (let C = 0; C < n.length; C++) {
-      let A = n[C];
-      A.value.match(p) || (l = n[C - 1]) != null && l.value.match(p) && Y(A) && ((t = n[C + 1]) != null && t.value.match(p)) ? x += A.value : f.push(A), A.value.match(p) && (!n[C + 1] || !n[C + 1].value.match(p)) && !(Y(n[C + 1]) && ((r = n[C + 2]) != null && r.value.match(p))) && (f.push({ type: "v", value: x }), x = "");
+    let i = [], s = /[0-9]/, f = "";
+    for (let u = 0; u < n.length; u++) {
+      let D = n[u];
+      D.value.match(s) || (l = n[u - 1]) != null && l.value.match(s) && H(D) && ((t = n[u + 1]) != null && t.value.match(s)) ? f += D.value : i.push(D), D.value.match(s) && (!n[u + 1] || !n[u + 1].value.match(s)) && !(H(n[u + 1]) && ((r = n[u + 2]) != null && r.value.match(s))) && (i.push({ type: "v", value: f }), f = "");
     }
-    n = f;
+    n = i;
   }
   {
-    let f = [];
-    for (let p = 0; p < n.length; p++) {
-      let x = n[p];
-      if (((i = n == null ? void 0 : n[p - 1]) == null ? void 0 : i.value) != "\\")
-        if (x.type == "v") {
-          let C = p, A = x.value, u = [];
-          for (o[A] && u.push(A); ((B = n == null ? void 0 : n[C + 1]) == null ? void 0 : B.type) == "v" && A.length <= d; )
-            A += n[C + 1].value, o[A] && u.push(A), C++;
-          if (u.length) {
-            let m = { type: "f", value: o[u.at(-1)] };
-            f.push(m), p += u.at(-1).length - 1;
+    let i = [];
+    for (let s = 0; s < n.length; s++) {
+      let f = n[s];
+      if (((C = n == null ? void 0 : n[s - 1]) == null ? void 0 : C.value) != "\\")
+        if (f.type == "v") {
+          let u = s, D = f.value, m = [];
+          for (W[D] && m.push(D); ((B = n == null ? void 0 : n[u + 1]) == null ? void 0 : B.type) == "v" && D.length <= Q; )
+            D += n[u + 1].value, W[D] && m.push(D), u++;
+          if (m.length) {
+            let O = { type: "f", value: W[m.at(-1)] };
+            i.push(O), s += m.at(-1).length - 1;
           } else
-            f.push(x);
+            i.push(f);
         } else
-          f.push(x);
+          i.push(f);
       else
-        f.push(x);
+        i.push(f);
     }
-    n = f;
+    n = i;
   }
   {
-    let f = [];
-    for (let p = 0; p < n.length; p++) {
-      let x = n[p];
-      if (x.value == "\\" && x.type == "v") {
-        if (n != null && n[p + 1]) {
-          let C = n[p + 1];
-          if (C.value == "\\" && C.type == "v")
-            f.push({ type: "v", value: "\\" }), p++;
-          else if (C.type == "blank")
-            f.push({ type: "v", value: "br", esc: !0 }), p++;
-          else if (C.type == "f") {
-            let A = C.value;
-            f.push({ type: "v", value: A[0] }), f.push({ type: A.length == 2 ? "v" : "f", value: A.slice(1) }), p++;
+    let i = [];
+    for (let s = 0; s < n.length; s++) {
+      let f = n[s];
+      if (f.value == "\\" && f.type == "v") {
+        if (n != null && n[s + 1]) {
+          let u = n[s + 1];
+          if (u.value == "\\" && u.type == "v")
+            i.push({ type: "v", value: "\\" }), s++;
+          else if (u.type == "blank")
+            i.push({ type: "v", value: "br", esc: !0 }), s++;
+          else if (u.type == "f") {
+            let D = u.value;
+            i.push({ type: "v", value: D[0] }), i.push({ type: D.length == 2 ? "v" : "f", value: D.slice(1) }), s++;
           } else {
-            let A = C;
-            A.esc = !0, f.push(A), p++;
+            let D = u;
+            D.esc = !0, i.push(D), s++;
           }
         }
       } else
-        f.push(x);
+        i.push(f);
     }
-    n = f;
+    n = i;
   }
   {
-    let f = [];
-    for (let p = 0; p < n.length; p++) {
-      let x = n[p];
-      x.type == "v" && ((a = n == null ? void 0 : n[p + 1]) == null ? void 0 : a.type) == "blank" && ((F = n == null ? void 0 : n[p + 2]) == null ? void 0 : F.type) == "str" ? (f.push(x), f.push({ type: "f", value: "space" })) : x.type == "str" && ((s = n == null ? void 0 : n[p + 1]) == null ? void 0 : s.type) == "blank" && ((b = n == null ? void 0 : n[p + 2]) == null ? void 0 : b.type) == "v" ? (f.push(x), f.push({ type: "f", value: "space" })) : f.push(x);
+    let i = [];
+    for (let s = 0; s < n.length; s++) {
+      let f = n[s];
+      f.type == "v" && ((a = n == null ? void 0 : n[s + 1]) == null ? void 0 : a.type) == "blank" && ((p = n == null ? void 0 : n[s + 2]) == null ? void 0 : p.type) == "str" ? (i.push(f), i.push({ type: "f", value: "space" })) : f.type == "str" && ((F = n == null ? void 0 : n[s + 1]) == null ? void 0 : F.type) == "blank" && ((h = n == null ? void 0 : n[s + 2]) == null ? void 0 : h.type) == "v" ? (i.push(f), i.push({ type: "f", value: "space" })) : i.push(f);
     }
-    n = f;
+    n = i;
   }
   {
-    let f = [], p = "";
-    for (let x = 0; x < n.length; x++) {
-      let C = n[x];
-      if (C.type == "f" && Y(n[x + 1])) {
-        p += C.value + ".", x++;
-        continue;
-      } else
-        p && C.type == "f" ? (p += C.value, Y(n[x + 1]) || (f.push({ type: "f", value: p }), p = "")) : f.push(C);
+    let i = [], s = [];
+    for (let f = 0; f < n.length; f++) {
+      let u = n[f];
+      _0(n == null ? void 0 : n[f + 1]) && !I(u) && !L(u) && !P(u) ? s.push(u) : s.length ? (s.push(u), i.push({ type: "group1", value: "", children: s }), s = []) : i.push(u);
     }
-    n = f;
+    n = i;
   }
   {
-    let f = [];
-    for (let p = 0; p < n.length; p++) {
-      let x = n[p];
-      if (x.type == "f" && n[p + 1] && n[p + 1].type == "group") {
-        x.children = n[p + 1].children;
-        for (let C in x.children)
-          x.children[C].value == "\\" && x.children[C].type == "v" && x.children[Number(C) + 1] && (x.children[Number(C) + 1].esc = !0);
-        f.push(x), p++;
+    let i = [], s = "";
+    for (let f = 0; f < n.length; f++) {
+      let u = n[f];
+      if (t0(u) && H(n[f + 1]))
+        if (s || !s && u.type == "f") {
+          s += u.value + ".", f++;
+          continue;
+        } else
+          i.push(u);
+      else
+        s && t0(u) ? (s += u.value, H(n[f + 1]) || (i.push({ type: "f", value: s }), s = "")) : i.push(u);
+    }
+    n = i;
+  }
+  {
+    let i = [];
+    for (let s = 0; s < n.length; s++) {
+      let f = n[s];
+      if (f.type == "f" && n[s + 1] && n[s + 1].type == "group") {
+        f.children = n[s + 1].children;
+        for (let u in f.children)
+          f.children[u].value == "\\" && f.children[u].type == "v" && f.children[Number(u) + 1] && (f.children[Number(u) + 1].esc = !0);
+        i.push(f), s++;
         continue;
       } else
-        f.push(x);
+        i.push(f);
     }
-    n = f;
+    n = i;
   }
   {
-    let f = [];
-    for (let p of n)
-      p.type != "blank" && f.push(p);
-    n = f;
+    let i = [];
+    for (let s of n)
+      s.type != "blank" && i.push(s);
+    n = i;
   }
   {
-    let f = [], p = NaN;
-    for (let C = 0; C < n.length; C++) {
-      const A = n[C];
-      A.value != "^" && A.value != "_" && ((((E = n[C + 1]) == null ? void 0 : E.value) == "^" || ((v = n[C + 1]) == null ? void 0 : v.value) == "_") && !(((g = n[C - 1]) == null ? void 0 : g.value) == "^" || ((M = n[C - 1]) == null ? void 0 : M.value) == "_") && (p || (p = C)), (((S = n[C - 1]) == null ? void 0 : S.value) == "^" || ((z = n[C - 1]) == null ? void 0 : z.value) == "_") && !(((k = n[C + 1]) == null ? void 0 : k.value) == "^" || ((P = n[C + 1]) == null ? void 0 : P.value) == "_") && (f.push([p, C]), p = NaN));
+    let i = [], s = NaN;
+    for (let u = 0; u < n.length; u++) {
+      const D = n[u];
+      !I(D) && !L(D) && ((I(n[u + 1]) || L(n[u + 1])) && !(I(n[u - 1]) || L(n[u - 1])) && (s || (s = u)), (I(n[u - 1]) || L(n[u - 1])) && !(I(n[u + 1]) || L(n[u + 1])) && (i.push([s, u]), s = NaN));
     }
-    let x = [];
-    for (let C = 0; C < n.length; C++) {
-      if (C == (($ = f == null ? void 0 : f[0]) == null ? void 0 : $[0])) {
+    let f = [];
+    for (let u = 0; u < n.length; u++) {
+      if (u == ((b = i == null ? void 0 : i[0]) == null ? void 0 : b[0])) {
         {
-          let A = n[f[0][1]];
-          for (let u = f[0][1]; u >= f[0][0]; u--) {
-            if (((L = n[u - 1]) == null ? void 0 : L.value) == "^" && ((_ = n[u - 3]) == null ? void 0 : _.value) == "_") {
-              let m = Q([n[u - 4]]) ? { t: q(A), b: q(n[u - 2]) } : { tr: q(A), br: q(n[u - 2]) };
-              A = {
+          let D = n[i[0][1]];
+          for (let m = i[0][1]; m >= i[0][0]; m--) {
+            if (I(n[m - 1]) && L(n[m - 3])) {
+              let O = V([n[m - 4]]) ? { t: N(D), b: N(n[m - 2]) } : { tr: N(D), br: N(n[m - 2]) };
+              D = {
                 type: "f",
                 value: "attach",
-                children: [n[u - 4], Z, ...e(m)]
-              }, u -= 4 - 1;
+                children: [n[m - 4], G, ...J(O)]
+              }, m -= 4 - 1;
               continue;
             }
-            if (((G = n[u - 1]) == null ? void 0 : G.value) == "_" && ((R = n[u - 3]) == null ? void 0 : R.value) == "^") {
-              let m = Q([n[u - 4]]) ? { t: q(n[u - 2]), b: q(A) } : { tr: q(n[u - 2]), br: q(A) };
-              A = {
+            if (L(n[m - 1]) && I(n[m - 3])) {
+              let O = V([n[m - 4]]) ? { t: N(n[m - 2]), b: N(D) } : { tr: N(n[m - 2]), br: N(D) };
+              D = {
                 type: "f",
                 value: "attach",
-                children: [n[u - 4], Z, ...e(m)]
-              }, u -= 4 - 1;
+                children: [n[m - 4], G, ...J(O)]
+              }, m -= 4 - 1;
               continue;
             }
-            if (((J = n[u - 1]) == null ? void 0 : J.value) == "^") {
-              let m = Q([n[u - 2]]) ? { t: q(A) } : { tr: q(A) };
-              A = {
+            if (I(n[m - 1])) {
+              let O = V([n[m - 2]]) ? { t: N(D) } : { tr: N(D) };
+              D = {
                 type: "f",
                 value: "attach",
-                children: [n[u - 2], Z, ...e(m)]
-              }, u -= 2 - 1;
+                children: [n[m - 2], G, ...J(O)]
+              }, m -= 2 - 1;
               continue;
             }
-            if (((W = n[u - 1]) == null ? void 0 : W.value) == "_") {
-              let m = Q([n[u - 2]]) ? { b: q(A) } : { br: q(A) };
-              A = {
+            if (L(n[m - 1])) {
+              let O = V([n[m - 2]]) ? { b: N(D) } : { br: N(D) };
+              D = {
                 type: "f",
                 value: "attach",
-                children: [n[u - 2], Z, ...e(m)]
-              }, u -= 2 - 1;
+                children: [n[m - 2], G, ...J(O)]
+              }, m -= 2 - 1;
               continue;
             }
           }
-          x.push(A);
+          f.push(D);
         }
-        C += f[0][1] - f[0][0], f = f.slice(1);
+        u += i[0][1] - i[0][0], i = i.slice(1);
         continue;
       }
-      x.push(n[C]);
+      f.push(n[u]);
     }
-    n = x;
+    n = f;
   }
   {
-    let f = [], p = NaN;
-    for (let C = 0; C < n.length; C++) {
-      const A = n[C];
-      V(A) || (V(n[C + 1]) && !V(n[C - 1]) && (p || (p = C)), V(n[C - 1]) && !V(n[C + 1]) && (f.push([p, C]), p = NaN));
+    let i = [], s = NaN;
+    for (let u = 0; u < n.length; u++) {
+      const D = n[u];
+      P(D) || (P(n[u + 1]) && !P(n[u - 1]) && (s || (s = u)), P(n[u - 1]) && !P(n[u + 1]) && (i.push([s, u]), s = NaN));
     }
-    let x = [];
-    for (let C = 0; C < n.length; C++) {
-      if (C == ((U = f == null ? void 0 : f[0]) == null ? void 0 : U[0])) {
+    let f = [];
+    for (let u = 0; u < n.length; u++) {
+      if (u == ((v = i == null ? void 0 : i[0]) == null ? void 0 : v[0])) {
         {
-          let A = n[f[0][0]];
-          for (let u = f[0][0]; u <= f[0][1]; u++)
-            if (((K = n[u + 1]) == null ? void 0 : K.value) == "/") {
-              A = {
+          let D = n[i[0][0]];
+          for (let m = i[0][0]; m <= i[0][1]; m++)
+            if (P(n[m + 1])) {
+              D = {
                 type: "f",
                 value: "frac",
-                children: [...q(A), Z, ...q(n[u + 2])]
-              }, u += 2 - 1;
+                children: [...N(D), G, ...N(n[m + 2])]
+              }, m += 2 - 1;
               continue;
             }
-          console.log(1, A), x.push(A);
+          console.log(1, D), f.push(D);
         }
-        C += f[0][1] - f[0][0], f.splice(0, 1);
+        u += i[0][1] - i[0][0], i.splice(0, 1);
         continue;
       }
-      x.push(n[C]);
+      f.push(n[u]);
     }
-    n = x;
+    n = f;
   }
   return n;
 }
-function A0(n) {
-  let l = "array", t = [], r = [], i = [], B = [];
-  for (let F in n.children) {
-    const s = n.children[F];
-    if (Number(F) + 1 == n.children.length) {
-      if (s.type == "blank" && n.children[Number(F) - 1].value.match(/[,;]/))
+function s0(n) {
+  let l = "array", t = [], r = [], C = [], B = [];
+  for (let p in n.children) {
+    const F = n.children[p];
+    if (Number(p) + 1 == n.children.length) {
+      if (F.type == "blank" && n.children[Number(p) - 1].value.match(/[,;]/))
         break;
-      !H(s, ",") && !H(s, ";") && B.push(s), l == "dic" ? (r.push(B), B = []) : t.push(B), i.length && (i.push(t), t = []), B = [];
+      !T(F, ",") && !T(F, ";") && B.push(F), l == "dic" ? (r.push(B), B = []) : t.push(B), C.length && (C.push(t), t = []), B = [];
     } else
-      H(s, ",") ? (l == "dic" ? (r.push(B), l = "array") : t.push(B), B = []) : H(s, ";") ? (t.push(B), B = [], i.push(t), t = []) : (B.push(s), H(s, ":") && (l = "dic"));
+      T(F, ",") ? (l == "dic" ? (r.push(B), l = "array") : t.push(B), B = []) : T(F, ";") ? (t.push(B), B = [], C.push(t), t = []) : (B.push(F), T(F, ":") && (l = "dic"));
   }
   let a = {};
-  for (let F of r) {
-    let s = "", b = [];
-    for (let E of F)
-      s ? E.value != ":" && b.push(E) : s = E.value;
-    a[s] = b;
+  for (let p of r) {
+    let F = "", h = [];
+    for (let b of p)
+      F ? b.value != ":" && h.push(b) : F = b.value;
+    a[F] = h;
   }
-  return { attr: t, dic: a, array: i };
+  return { attr: t, dic: a, array: C };
 }
-function c(n, l = "serif") {
+function Y(n, l = "serif") {
   function t(r) {
     return "abcdefghijklmnopqrstuvwxyz".indexOf(r.toLowerCase());
   }
@@ -2924,47 +2949,47 @@ function c(n, l = "serif") {
     case "serif":
       return n;
     case "sans":
-      const r = [..."𝟢𝟣𝟤𝟥𝟦𝟧𝟨𝟩𝟪𝟫"], i = [..."𝖺𝖻𝖼𝖽𝖾𝖿𝗀𝗁𝗂𝗃𝗄𝗅𝗆𝗇𝗈𝗉𝗊𝗋𝗌𝗍𝗎𝗏𝗐𝗑𝗒𝗓"], B = [..."𝖠𝖡𝖢𝖣𝖤𝖥𝖦𝖧𝖨𝖩𝖪𝖫𝖬𝖭𝖮𝖯𝖰𝖱𝖲𝖳𝖴𝖵𝖶𝖷𝖸𝖹"];
-      return n = n.replace(/[0-9]+/g, (k) => r[k]), n = n.replace(/[a-z]/g, (k) => i[t(k)]), n = n.replace(/[A-Z]/g, (k) => B[t(k)]), n;
+      const r = [..."𝟢𝟣𝟤𝟥𝟦𝟧𝟨𝟩𝟪𝟫"], C = [..."𝖺𝖻𝖼𝖽𝖾𝖿𝗀𝗁𝗂𝗃𝗄𝗅𝗆𝗇𝗈𝗉𝗊𝗋𝗌𝗍𝗎𝗏𝗐𝗑𝗒𝗓"], B = [..."𝖠𝖡𝖢𝖣𝖤𝖥𝖦𝖧𝖨𝖩𝖪𝖫𝖬𝖭𝖮𝖯𝖰𝖱𝖲𝖳𝖴𝖵𝖶𝖷𝖸𝖹"];
+      return n = n.replace(/[0-9]+/g, (D) => r[D]), n = n.replace(/[a-z]/g, (D) => C[t(D)]), n = n.replace(/[A-Z]/g, (D) => B[t(D)]), n;
     case "frak":
-      const a = [..."𝔞𝔟𝔠𝔡𝔢𝔣𝔤𝔥𝔦𝔧𝔨𝔩𝔪𝔫𝔬𝔭𝔮𝔯𝔰𝔱𝔲𝔳𝔴𝔵𝔶𝔷"], F = [..."𝔄𝔅ℭ𝔇𝔈𝔉𝔊ℌℑ𝔍𝔎𝔏𝔐𝔑𝔒𝔓𝔔ℜ𝔖𝔗𝔘𝔙𝔚𝔛𝔜ℨ"];
-      return n = n.replace(/[a-z]/g, (k) => a[t(k)]), n = n.replace(/[A-Z]/g, (k) => F[t(k)]), n;
+      const a = [..."𝔞𝔟𝔠𝔡𝔢𝔣𝔤𝔥𝔦𝔧𝔨𝔩𝔪𝔫𝔬𝔭𝔮𝔯𝔰𝔱𝔲𝔳𝔴𝔵𝔶𝔷"], p = [..."𝔄𝔅ℭ𝔇𝔈𝔉𝔊ℌℑ𝔍𝔎𝔏𝔐𝔑𝔒𝔓𝔔ℜ𝔖𝔗𝔘𝔙𝔚𝔛𝔜ℨ"];
+      return n = n.replace(/[a-z]/g, (D) => a[t(D)]), n = n.replace(/[A-Z]/g, (D) => p[t(D)]), n;
     case "mono":
-      const s = [..."0𝟷𝟸𝟹𝟺𝟻𝟼𝟽𝟾𝟿"], b = [..."𝚊𝚋𝚌𝚍𝚎𝚏𝚐𝚑𝚒𝚓𝚔𝚕𝚖𝚗𝚘𝚙𝚚𝚛𝚜𝚝𝚞𝚟𝚠𝚡𝚢𝚣"], E = [..."𝙰𝙱𝙲𝙳𝙴𝙵𝙶𝙷𝙸𝙹𝙺𝙻𝙼𝙽𝙾𝙿𝚀𝚁𝚂𝚃𝚄𝚅𝚆𝚇𝚈𝚉"];
-      return n = n.replace(/[0-9]+/g, (k) => s[k]), n = n.replace(/[a-z]/g, (k) => b[t(k)]), n = n.replace(/[A-Z]/g, (k) => E[t(k)]), n;
+      const F = [..."0𝟷𝟸𝟹𝟺𝟻𝟼𝟽𝟾𝟿"], h = [..."𝚊𝚋𝚌𝚍𝚎𝚏𝚐𝚑𝚒𝚓𝚔𝚕𝚖𝚗𝚘𝚙𝚚𝚛𝚜𝚝𝚞𝚟𝚠𝚡𝚢𝚣"], b = [..."𝙰𝙱𝙲𝙳𝙴𝙵𝙶𝙷𝙸𝙹𝙺𝙻𝙼𝙽𝙾𝙿𝚀𝚁𝚂𝚃𝚄𝚅𝚆𝚇𝚈𝚉"];
+      return n = n.replace(/[0-9]+/g, (D) => F[D]), n = n.replace(/[a-z]/g, (D) => h[t(D)]), n = n.replace(/[A-Z]/g, (D) => b[t(D)]), n;
     case "bb":
-      const v = [..."𝟘𝟙𝟚𝟛𝟜𝟝𝟞𝟟𝟠𝟡"], g = [..."𝕒𝕓𝕔𝕕𝕖𝕗𝕘𝕙𝕚𝕛𝕜𝕝𝕞𝕟𝕠𝕡𝕢𝕣𝕤𝕥𝕦𝕧𝕨𝕩𝕪𝕫"], M = [..."𝔸𝔹ℂ𝔻𝔼𝔽𝔾ℍ𝕀𝕁𝕂𝕃𝕄ℕ𝕆ℙℚℝ𝕊𝕋𝕌𝕍𝕎𝕏𝕐ℤ"];
-      return n = n.replace(/[0-9]+/g, (k) => v[k]), n = n.replace(/[a-z]/g, (k) => g[t(k)]), n = n.replace(/[A-Z]/g, (k) => M[t(k)]), n;
+      const v = [..."𝟘𝟙𝟚𝟛𝟜𝟝𝟞𝟟𝟠𝟡"], i = [..."𝕒𝕓𝕔𝕕𝕖𝕗𝕘𝕙𝕚𝕛𝕜𝕝𝕞𝕟𝕠𝕡𝕢𝕣𝕤𝕥𝕦𝕧𝕨𝕩𝕪𝕫"], s = [..."𝔸𝔹ℂ𝔻𝔼𝔽𝔾ℍ𝕀𝕁𝕂𝕃𝕄ℕ𝕆ℙℚℝ𝕊𝕋𝕌𝕍𝕎𝕏𝕐ℤ"];
+      return n = n.replace(/[0-9]+/g, (D) => v[D]), n = n.replace(/[a-z]/g, (D) => i[t(D)]), n = n.replace(/[A-Z]/g, (D) => s[t(D)]), n;
     case "cal":
-      const S = [..."𝒶𝒷𝒸𝒹ℯ𝒻ℊ𝒽𝒾𝒿𝓀𝓁𝓂𝓃ℴ𝓅𝓆𝓇𝓈𝓉𝓊𝓋𝓌𝓍𝓎𝓏"], z = [..."𝒜ℬ𝒞𝒟ℰℱ𝒢ℋℐ𝒥𝒦ℒℳ𝒩𝒪𝒫𝒬ℛ𝒮𝒯𝒰𝒱𝒲𝒳𝒴𝒵"];
-      return n = n.replace(/[a-z]/g, (k) => S[t(k)]), n = n.replace(/[A-Z]/g, (k) => z[t(k)]), n;
+      const f = [..."𝒶𝒷𝒸𝒹ℯ𝒻ℊ𝒽𝒾𝒿𝓀𝓁𝓂𝓃ℴ𝓅𝓆𝓇𝓈𝓉𝓊𝓋𝓌𝓍𝓎𝓏"], u = [..."𝒜ℬ𝒞𝒟ℰℱ𝒢ℋℐ𝒥𝒦ℒℳ𝒩𝒪𝒫𝒬ℛ𝒮𝒯𝒰𝒱𝒲𝒳𝒴𝒵"];
+      return n = n.replace(/[a-z]/g, (D) => f[t(D)]), n = n.replace(/[A-Z]/g, (D) => u[t(D)]), n;
   }
 }
-function h(n, l) {
+function E(n, l) {
   let t = document.createDocumentFragment();
   n = C0(n);
   {
-    let r = !1, i = (B) => {
+    let r = !1, C = (B) => {
       for (let a of B) {
-        if (t0(a)) {
+        if (l0(a)) {
           r = !0;
           return;
         }
-        a.type == "group" && i(a.children);
+        a.type == "group" && C(a.children);
       }
     };
-    if (i(n), r) {
+    if (C(n), r) {
       {
         let a = [];
-        for (let F in n) {
-          let s = n[F];
-          s.type == "group" ? (a.push(N("(")), a.push(...C0(s.children)), a.push(N(")"))) : a.push(s);
+        for (let p in n) {
+          let F = n[p];
+          F.type == "group" ? (a.push(S("(")), a.push(...C0(F.children)), a.push(S(")"))) : a.push(F);
         }
         n = a;
       }
       for (let a = 0; a < n.length; a++) {
-        const F = n[a];
-        t0(F) && (n[a] = Z);
+        const p = n[a];
+        l0(p) && (n[a] = G);
       }
       let B = [];
       B.push({ type: "f", value: "x_table", children: n }), n = B;
@@ -2975,23 +3000,29 @@ function h(n, l) {
       n = B;
     }
   }
+  {
+    let r = [];
+    for (let C of n)
+      C.type == "group1" ? r.push(...C.children) : r.push(C);
+    n = r;
+  }
   for (let r in n) {
-    let i = Number(r), B = n[i];
+    let C = Number(r), B = n[C];
     if (B.type == "f" && B.children) {
-      let { attr: a, dic: F, array: s } = A0(B);
-      if (O[B.value]) {
-        console.log(a, F, s);
-        let b = O[B.value](a, F, s, l);
-        t.append(b);
-      } else if (w[B.value]) {
-        let b = D("mo", w[B.value]);
-        t.append(b, h(g0(B.children)));
+      let { attr: a, dic: p, array: F } = s0(B);
+      if (j[B.value]) {
+        console.log(a, p, F);
+        let h = j[B.value](a, p, F, l);
+        t.append(h);
+      } else if (_[B.value]) {
+        let h = A("mo", _[B.value]);
+        t.append(h, E(w0(B.children)));
       }
     }
     if (B.type == "f" && !B.children) {
-      if (w[B.value]) {
-        let a, F = null;
-        const s = {
+      if (_[B.value]) {
+        let a, p = null;
+        const F = {
           " ": "0.36em",
           " ": "0.5em",
           " ": "3.75em",
@@ -3004,41 +3035,49 @@ function h(n, l) {
           " ": "0.2em",
           " ": "0.09em"
         };
-        w[B.value].match(/[a-zA-Z\u0391-\u03C9]/) ? a = "mi" : s[w[B.value]] ? (a = "mspace", F = { width: s[w[B.value]] }) : a = "mo";
-        let b = D(a, w[B.value], F);
-        t.append(b);
-      } else if (O[B.value]) {
-        let a = O[B.value](null, null, null, l);
+        _[B.value].match(/[a-zA-Z\u0391-\u03C9]/) ? a = "mi" : F[_[B.value]] ? (a = "mspace", p = { width: F[_[B.value]] }) : a = "mo";
+        let h = A(a, _[B.value], p);
+        t.append(h);
+      } else if (j[B.value]) {
+        let a = j[B.value](null, null, null, l);
         t.append(a);
       }
     }
     if (B.type == "str") {
-      let a = D("ms", c(B.value, l));
+      let a = A("ms", Y(B.value, l));
       t.append(a);
     }
     if (B.type == "v") {
       let a;
       B.value.match(/[0-9.]+/) ? a = "mn" : B.value.match(/[a-zA-Z\u0391-\u03C9]/) ? a = "mi" : a = "mo";
-      let F = D(a, c(B.value, l));
-      t.append(F);
+      let p = A(a, Y(B.value, l));
+      t.append(p);
     }
     B.type == "group" && t.append(D0(B.children));
   }
   return t;
 }
-function k0(n) {
-  let l = E0(n);
+var e = {
+  emoji: !1
+};
+function O0(n) {
+  for (let l in n)
+    e[l] && (e[l] = n[l]);
+}
+function N0(n) {
+  let l = g0(n);
   console.log(l);
-  let t = D("math");
+  let t = A("math");
   t.setAttribute("display", "block");
-  let r = h(l);
+  let r = E(l);
   return t.append(r), t;
 }
-function y0(n) {
-  return k0(n).outerHTML;
+function S0(n) {
+  return N0(n).outerHTML;
 }
 export {
-  k0 as toMML,
-  y0 as toMMLHTML
+  O0 as init,
+  N0 as toMML,
+  S0 as toMMLHTML
 };
 //# sourceMappingURL=xmmath.es.js.map