xmmath 1.0.5 → 1.0.6

package/dist/xmmath.es.js

@@ -1,7 +1,7 @@
-function s0(n) {
+function F0(n) {
   return n && n.__esModule && Object.prototype.hasOwnProperty.call(n, "default") ? n.default : n;
 }
-var B0 = { exports: {} };
+var i0 = { 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;
@@ -21,14 +21,14 @@ var B0 = { exports: {} };
       }
       return A;
     }
-    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) {
+    function p(x, C, A) {
+      var u = [x].concat(C).concat([A]), m = u[u.length - 2], y = A, n0 = u.lastIndexOf(k);
+      if (n0 > 1 && u.slice(1, n0).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) {
+      var l0 = u.lastIndexOf(a);
+      if (l0 > 0 && u.slice(1, l0).every(function(j) {
         return j == a;
       }) && [S, a].indexOf(m) == -1)
         return u.filter(function(j) {
@@ -54,8 +54,8 @@ var B0 = { exports: {} };
         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) {
+      var t0 = u.indexOf(B) != -1 ? u.lastIndexOf(B) - 1 : u.length - 2;
+      return [z, L].indexOf(u[t0]) != -1 && u.slice(t0 + 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;
     }
@@ -64,10 +64,10 @@ var B0 = { exports: {} };
         return 0;
       if (C >= x.length - 1)
         return x.length;
-      for (var A = p(K(x, C)), u = [], m = C + 1; m < x.length; m++)
+      for (var A = f(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))
+          var y = f(K(x, m));
+          if (p(A, u, y))
             return m;
           u.push(y);
         }
@@ -91,7 +91,7 @@ var B0 = { exports: {} };
         A = u, C++;
       return A < x.length && C++, C;
     };
-    function p(x) {
+    function f(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
@@ -1451,9 +1451,9 @@ var B0 = { exports: {} };
     return this;
   }
   n.exports && (n.exports = l);
-})(B0);
-var F0 = B0.exports;
-const p0 = /* @__PURE__ */ s0(F0), f0 = `{
+})(i0);
+var f0 = i0.exports;
+const p0 = /* @__PURE__ */ F0(f0), b0 = `{
     "wj": "⁠",
     "zwj": "‍",
     "zwnj": "‌",
@@ -2234,8 +2234,8 @@ function D(n, l, t) {
   return r;
 }
 const I = "mathvariant";
-var b0 = new p0();
-function E0(n) {
+var E0 = new p0();
+function h0(n) {
   let l = /[a-zA-Z]/, t = /[\(\)]/, r = /[ \t\n\r]+/, i = "", B = [], a = [], F = B, s = "";
   n = n.replace(/(\\u\{[\dA-Fa-f]+\})/g, (v) => {
     const g = parseInt(v.slice(3, -1), 16);
@@ -2250,7 +2250,7 @@ function E0(n) {
     }
     i != "str" && (g == "(" && b.push(v), g == ")" && (b.length == 0 || n[v - 1] != "\\" && b.pop()));
   }
-  let E = b0.splitGraphemes(n);
+  let E = x0.emoji ? E0.splitGraphemes(n) : [...n];
   for (let v = 0; v < E.length; v++) {
     const g = E[v];
     if (g == '"' && E[v - 1] != "\\") {
@@ -2287,7 +2287,7 @@ function E0(n) {
   }
   return B;
 }
-let X = JSON.parse(f0), w = {};
+let X = JSON.parse(b0), w = {};
 for (let n in X)
   if (typeof X[n] == "string")
     w[n] = X[n];
@@ -2397,7 +2397,7 @@ let O = {
     let t = D("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;
+    return C0(l.cross) ? i = r(!0) + "," + r(!1) : C0(l.inverted) ? i = r(!1) : i = r(!0), t.style.backgroundImage = i, t.append(h(n[0])), t;
   },
   cases: (n, l) => {
     var B, a;
@@ -2544,7 +2544,7 @@ let O = {
         B % 2 == 0 ? i.push("right") : i.push("left");
     return r.setAttribute("columnalign", i.join(" ")), r;
   }
-}, i0 = [
+}, a0 = [
   { id: "arccos" },
   { id: "arcsin" },
   { id: "arctan" },
@@ -2582,23 +2582,23 @@ let O = {
   { id: "liminf", str: "lim inf", limits: !0 },
   { id: "limsup", str: "lim sup", limits: !0 }
 ];
-function h0() {
-  for (let n of i0)
+function m0() {
+  for (let n of a0)
     O[n.id] = (l, t, r, i) => {
       let B = O.op([[{ type: "str", value: n.str || n.id }]], {}, null, i);
       if (l) {
         let a = document.createDocumentFragment();
-        return a.append(B, D0(l[0])), a;
+        return a.append(B, A0(l[0])), a;
       } else
         return B;
     };
 }
-h0();
-let a0 = [], u0 = ["∏", "∐", "∑", "⋀", "⋁", "⋂", "⋃", "⨀", "⨁", "⨂", "⨃", "⨄", "⨅", "⨆"];
+m0();
+let u0 = [], D0 = ["∏", "∐", "∑", "⋀", "⋁", "⋂", "⋃", "⨀", "⨁", "⨂", "⨃", "⨄", "⨅", "⨆"];
 for (let n in w)
-  for (let l of u0)
-    w[n] == l && a0.push(n);
-function m0() {
+  for (let l of D0)
+    w[n] == l && u0.push(n);
+function v0() {
   const n = [
     "grave",
     "acute",
@@ -2619,8 +2619,8 @@ function m0() {
   for (let l of n)
     O[l] = (t) => O.accent([t[0], [{ type: "f", value: l }]], {});
 }
-m0();
-function v0() {
+v0();
+function g0() {
   let n = [
     { name: "abs", l: N("|"), r: N("|") },
     { name: "norm", l: N("‖"), r: N("‖") },
@@ -2631,7 +2631,7 @@ function v0() {
   for (let l of n)
     O[l.name] = (t) => O.lr([[l.l, ...t[0], l.r]], {});
 }
-v0();
+g0();
 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) {
@@ -2645,7 +2645,7 @@ function T(n, l, t, r) {
   }
   return i;
 }
-function D0(n) {
+function A0(n) {
   let l = D("mrow"), t = D("mo");
   t.textContent = "(";
   let r = h(n), i = D("mo");
@@ -2654,35 +2654,35 @@ function D0(n) {
 function q(n) {
   return n.type == "group" ? n.children : [n];
 }
-function g0(n) {
+function k0(n) {
   return [{ type: "group", value: "", children: n }];
 }
 function V(n) {
   return n ? n.value == "/" && !n.esc : !1;
 }
-function t0(n) {
+function r0(n) {
   return n ? n.value == "br" && n.esc : !1;
 }
 function Q(n) {
   if (n.length == 1) {
     let l = n[0];
     if (l.type == "f") {
-      if (a0.includes(l.value))
+      if (u0.includes(l.value))
         return !0;
-      for (let t of i0)
+      for (let t of a0)
         if (t.limits && l.value == t.id)
           return !0;
       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;
         return r == "#true";
       }
     }
-    if (l.type == "v" && u0.includes(l.value))
+    if (l.type == "v" && D0.includes(l.value))
       return !0;
   } else
     return !1;
@@ -2707,118 +2707,118 @@ function e(n) {
   }
   return l;
 }
-function r0(n) {
+function C0(n) {
   let l = 0;
   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) {
+function B0(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;
   {
-    let f = [], p = /[0-9]/, x = "";
+    let p = [], f = /[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 = "");
+      A.value.match(f) || (l = n[C - 1]) != null && l.value.match(f) && Y(A) && ((t = n[C + 1]) != null && t.value.match(f)) ? x += A.value : p.push(A), A.value.match(f) && (!n[C + 1] || !n[C + 1].value.match(f)) && !(Y(n[C + 1]) && ((r = n[C + 2]) != null && r.value.match(f))) && (p.push({ type: "v", value: x }), x = "");
     }
-    n = f;
+    n = p;
   }
   {
-    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) != "\\")
+    let p = [];
+    for (let f = 0; f < n.length; f++) {
+      let x = n[f];
+      if (((i = n == null ? void 0 : n[f - 1]) == null ? void 0 : i.value) != "\\")
         if (x.type == "v") {
-          let C = p, A = x.value, u = [];
+          let C = f, 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;
+            p.push(m), f += u.at(-1).length - 1;
           } else
-            f.push(x);
+            p.push(x);
         } else
-          f.push(x);
+          p.push(x);
       else
-        f.push(x);
+        p.push(x);
     }
-    n = f;
+    n = p;
   }
   {
-    let f = [];
-    for (let p = 0; p < n.length; p++) {
-      let x = n[p];
+    let p = [];
+    for (let f = 0; f < n.length; f++) {
+      let x = n[f];
       if (x.value == "\\" && x.type == "v") {
-        if (n != null && n[p + 1]) {
-          let C = n[p + 1];
+        if (n != null && n[f + 1]) {
+          let C = n[f + 1];
           if (C.value == "\\" && C.type == "v")
-            f.push({ type: "v", value: "\\" }), p++;
+            p.push({ type: "v", value: "\\" }), f++;
           else if (C.type == "blank")
-            f.push({ type: "v", value: "br", esc: !0 }), p++;
+            p.push({ type: "v", value: "br", esc: !0 }), f++;
           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++;
+            p.push({ type: "v", value: A[0] }), p.push({ type: A.length == 2 ? "v" : "f", value: A.slice(1) }), f++;
           } else {
             let A = C;
-            A.esc = !0, f.push(A), p++;
+            A.esc = !0, p.push(A), f++;
           }
         }
       } else
-        f.push(x);
+        p.push(x);
     }
-    n = f;
+    n = p;
   }
   {
-    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 p = [];
+    for (let f = 0; f < n.length; f++) {
+      let x = n[f];
+      x.type == "v" && ((a = n == null ? void 0 : n[f + 1]) == null ? void 0 : a.type) == "blank" && ((F = n == null ? void 0 : n[f + 2]) == null ? void 0 : F.type) == "str" ? (p.push(x), p.push({ type: "f", value: "space" })) : x.type == "str" && ((s = n == null ? void 0 : n[f + 1]) == null ? void 0 : s.type) == "blank" && ((b = n == null ? void 0 : n[f + 2]) == null ? void 0 : b.type) == "v" ? (p.push(x), p.push({ type: "f", value: "space" })) : p.push(x);
     }
-    n = f;
+    n = p;
   }
   {
-    let f = [], p = "";
+    let p = [], f = "";
     for (let x = 0; x < n.length; x++) {
       let C = n[x];
       if (C.type == "f" && Y(n[x + 1])) {
-        p += C.value + ".", x++;
+        f += 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);
+        f && C.type == "f" ? (f += C.value, Y(n[x + 1]) || (p.push({ type: "f", value: f }), f = "")) : p.push(C);
     }
-    n = f;
+    n = p;
   }
   {
-    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;
+    let p = [];
+    for (let f = 0; f < n.length; f++) {
+      let x = n[f];
+      if (x.type == "f" && n[f + 1] && n[f + 1].type == "group") {
+        x.children = n[f + 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++;
+        p.push(x), f++;
         continue;
       } else
-        f.push(x);
+        p.push(x);
     }
-    n = f;
+    n = p;
   }
   {
-    let f = [];
-    for (let p of n)
-      p.type != "blank" && f.push(p);
-    n = f;
+    let p = [];
+    for (let f of n)
+      f.type != "blank" && p.push(f);
+    n = p;
   }
   {
-    let f = [], p = NaN;
+    let p = [], f = 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));
+      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) == "_") && (f || (f = 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) == "_") && (p.push([f, C]), f = NaN));
     }
     let x = [];
     for (let C = 0; C < n.length; C++) {
-      if (C == (($ = f == null ? void 0 : f[0]) == null ? void 0 : $[0])) {
+      if (C == (($ = p == null ? void 0 : p[0]) == null ? void 0 : $[0])) {
         {
-          let A = n[f[0][1]];
-          for (let u = f[0][1]; u >= f[0][0]; u--) {
+          let A = n[p[0][1]];
+          for (let u = p[0][1]; u >= p[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 = {
@@ -2858,7 +2858,7 @@ function C0(n) {
           }
           x.push(A);
         }
-        C += f[0][1] - f[0][0], f = f.slice(1);
+        C += p[0][1] - p[0][0], p = p.slice(1);
         continue;
       }
       x.push(n[C]);
@@ -2866,17 +2866,17 @@ function C0(n) {
     n = x;
   }
   {
-    let f = [], p = NaN;
+    let p = [], f = 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));
+      V(A) || (V(n[C + 1]) && !V(n[C - 1]) && (f || (f = C)), V(n[C - 1]) && !V(n[C + 1]) && (p.push([f, C]), f = 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])) {
+      if (C == ((U = p == null ? void 0 : p[0]) == null ? void 0 : U[0])) {
         {
-          let A = n[f[0][0]];
-          for (let u = f[0][0]; u <= f[0][1]; u++)
+          let A = n[p[0][0]];
+          for (let u = p[0][0]; u <= p[0][1]; u++)
             if (((K = n[u + 1]) == null ? void 0 : K.value) == "/") {
               A = {
                 type: "f",
@@ -2887,7 +2887,7 @@ function C0(n) {
             }
           console.log(1, A), x.push(A);
         }
-        C += f[0][1] - f[0][0], f.splice(0, 1);
+        C += p[0][1] - p[0][0], p.splice(0, 1);
         continue;
       }
       x.push(n[C]);
@@ -2896,7 +2896,7 @@ function C0(n) {
   }
   return n;
 }
-function A0(n) {
+function s0(n) {
   let l = "array", t = [], r = [], i = [], B = [];
   for (let F in n.children) {
     const s = n.children[F];
@@ -2942,11 +2942,11 @@ function c(n, l = "serif") {
 }
 function h(n, l) {
   let t = document.createDocumentFragment();
-  n = C0(n);
+  n = B0(n);
   {
     let r = !1, i = (B) => {
       for (let a of B) {
-        if (t0(a)) {
+        if (r0(a)) {
           r = !0;
           return;
         }
@@ -2958,13 +2958,13 @@ function h(n, l) {
         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);
+          s.type == "group" ? (a.push(N("(")), a.push(...B0(s.children)), a.push(N(")"))) : a.push(s);
         }
         n = a;
       }
       for (let a = 0; a < n.length; a++) {
         const F = n[a];
-        t0(F) && (n[a] = Z);
+        r0(F) && (n[a] = Z);
       }
       let B = [];
       B.push({ type: "f", value: "x_table", children: n }), n = B;
@@ -2978,14 +2978,14 @@ function h(n, l) {
   for (let r in n) {
     let i = Number(r), B = n[i];
     if (B.type == "f" && B.children) {
-      let { attr: a, dic: F, array: s } = A0(B);
+      let { attr: a, dic: F, array: s } = s0(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)));
+        t.append(b, h(k0(B.children)));
       }
     }
     if (B.type == "f" && !B.children) {
@@ -3022,23 +3022,31 @@ function h(n, l) {
       let F = D(a, c(B.value, l));
       t.append(F);
     }
-    B.type == "group" && t.append(D0(B.children));
+    B.type == "group" && t.append(A0(B.children));
   }
   return t;
 }
-function k0(n) {
-  let l = E0(n);
+var x0 = {
+  emoji: !1
+};
+function w0(n) {
+  for (let l in n)
+    x0[l] && (x0[l] = n[l]);
+}
+function y0(n) {
+  let l = h0(n);
   console.log(l);
   let t = D("math");
   t.setAttribute("display", "block");
   let r = h(l);
   return t.append(r), t;
 }
-function y0(n) {
-  return k0(n).outerHTML;
+function q0(n) {
+  return y0(n).outerHTML;
 }
 export {
-  k0 as toMML,
-  y0 as toMMLHTML
+  w0 as init,
+  y0 as toMML,
+  q0 as toMMLHTML
 };
 //# sourceMappingURL=xmmath.es.js.map