svg-path-commander 2.0.4 → 2.0.5

package/dist/svg-path-commander.mjs

@@ -1,10 +1,10 @@
-var Vt = Object.defineProperty;
-var Gt = (e, t, n) => t in e ? Vt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var N = (e, t, n) => (Gt(e, typeof t != "symbol" ? t + "" : t, n), n);
-const at = {
+var Gt = Object.defineProperty;
+var te = (e, t, n) => t in e ? Gt(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var N = (e, t, n) => (te(e, typeof t != "symbol" ? t + "" : t, n), n);
+const mt = {
   origin: [0, 0, 0],
   round: 4
-}, O = "SVGPathCommander Error", K = {
+}, k = "SVGPathCommander Error", U = {
   a: 7,
   c: 6,
   h: 1,
@@ -16,12 +16,12 @@ const at = {
   t: 2,
   v: 1,
   z: 0
-}, Ct = (e) => {
+}, Tt = (e) => {
   let t = e.pathValue[e.segmentStart], n = t.toLowerCase();
   const { data: r } = e;
-  for (; r.length >= K[n] && (n === "m" && r.length > 2 ? (e.segments.push([t, ...r.splice(0, 2)]), n = "l", t = t === "m" ? "l" : "L") : e.segments.push([t, ...r.splice(0, K[n])]), !!K[n]); )
+  for (; r.length >= U[n] && (n === "m" && r.length > 2 ? (e.segments.push([t, ...r.splice(0, 2)]), n = "l", t = t === "m" ? "l" : "L") : e.segments.push([t, ...r.splice(0, U[n])]), !!U[n]); )
     ;
-}, te = (e) => {
+}, ee = (e) => {
   const { index: t, pathValue: n } = e, r = n.charCodeAt(t);
   if (r === 48) {
     e.param = 0, e.index += 1;
@@ -31,21 +31,21 @@ const at = {
     e.param = 1, e.index += 1;
     return;
   }
-  e.err = `${O}: invalid Arc flag "${n[t]}", expecting 0 or 1 at index ${t}`;
-}, D = (e) => e >= 48 && e <= 57, X = "Invalid path value", ee = (e) => {
+  e.err = `${k}: invalid Arc flag "${n[t]}", expecting 0 or 1 at index ${t}`;
+}, D = (e) => e >= 48 && e <= 57, R = "Invalid path value", ne = (e) => {
   const { max: t, pathValue: n, index: r } = e;
   let s = r, i = !1, o = !1, a = !1, l = !1, c;
   if (s >= t) {
-    e.err = `${O}: ${X} at index ${s}, "pathValue" is missing param`;
+    e.err = `${k}: ${R} at index ${s}, "pathValue" is missing param`;
     return;
   }
   if (c = n.charCodeAt(s), (c === 43 || c === 45) && (s += 1, c = n.charCodeAt(s)), !D(c) && c !== 46) {
-    e.err = `${O}: ${X} at index ${s}, "${n[s]}" is not a number`;
+    e.err = `${k}: ${R} at index ${s}, "${n[s]}" is not a number`;
     return;
   }
   if (c !== 46) {
     if (i = c === 48, s += 1, c = n.charCodeAt(s), i && s < t && c && D(c)) {
-      e.err = `${O}: ${X} at index ${r}, "${n[r]}" illegal number`;
+      e.err = `${k}: ${R} at index ${r}, "${n[r]}" illegal number`;
       return;
     }
     for (; s < t && D(n.charCodeAt(s)); )
@@ -59,19 +59,19 @@ const at = {
   }
   if (c === 101 || c === 69) {
     if (l && !o && !a) {
-      e.err = `${O}: ${X} at index ${s}, "${n[s]}" invalid float exponent`;
+      e.err = `${k}: ${R} at index ${s}, "${n[s]}" invalid float exponent`;
       return;
     }
     if (s += 1, c = n.charCodeAt(s), (c === 43 || c === 45) && (s += 1), s < t && D(n.charCodeAt(s)))
       for (; s < t && D(n.charCodeAt(s)); )
         s += 1;
     else {
-      e.err = `${O}: ${X} at index ${s}, "${n[s]}" invalid integer exponent`;
+      e.err = `${k}: ${R} at index ${s}, "${n[s]}" invalid integer exponent`;
       return;
     }
   }
   e.index = s, e.param = +e.pathValue.slice(r, s);
-}, ne = (e) => [
+}, se = (e) => [
   // Special spaces
   5760,
   6158,
@@ -101,11 +101,11 @@ const at = {
   11,
   12,
   160
-].includes(e), _ = (e) => {
+].includes(e), V = (e) => {
   const { pathValue: t, max: n } = e;
-  for (; e.index < n && ne(t.charCodeAt(e.index)); )
+  for (; e.index < n && se(t.charCodeAt(e.index)); )
     e.index += 1;
-}, se = (e) => {
+}, re = (e) => {
   switch (e | 32) {
     case 109:
     case 122:
@@ -121,53 +121,53 @@ const at = {
     default:
       return !1;
   }
-}, re = (e) => D(e) || e === 43 || e === 45 || e === 46, ie = (e) => (e | 32) === 97, It = (e) => {
-  const { max: t, pathValue: n, index: r } = e, s = n.charCodeAt(r), i = K[n[r].toLowerCase()];
-  if (e.segmentStart = r, !se(s)) {
-    e.err = `${O}: ${X} "${n[r]}" is not a path command`;
+}, ie = (e) => D(e) || e === 43 || e === 45 || e === 46, oe = (e) => (e | 32) === 97, jt = (e) => {
+  const { max: t, pathValue: n, index: r } = e, s = n.charCodeAt(r), i = U[n[r].toLowerCase()];
+  if (e.segmentStart = r, !re(s)) {
+    e.err = `${k}: ${R} "${n[r]}" is not a path command`;
     return;
   }
-  if (e.index += 1, _(e), e.data = [], !i) {
-    Ct(e);
+  if (e.index += 1, V(e), e.data = [], !i) {
+    Tt(e);
     return;
   }
   for (; ; ) {
     for (let o = i; o > 0; o -= 1) {
-      if (ie(s) && (o === 3 || o === 4) ? te(e) : ee(e), e.err.length)
+      if (oe(s) && (o === 3 || o === 4) ? ee(e) : ne(e), e.err.length)
         return;
-      e.data.push(e.param), _(e), e.index < t && n.charCodeAt(e.index) === 44 && (e.index += 1, _(e));
+      e.data.push(e.param), V(e), e.index < t && n.charCodeAt(e.index) === 44 && (e.index += 1, V(e));
     }
-    if (e.index >= e.max || !re(n.charCodeAt(e.index)))
+    if (e.index >= e.max || !ie(n.charCodeAt(e.index)))
       break;
   }
-  Ct(e);
+  Tt(e);
 };
-class jt {
+class zt {
   constructor(t) {
     this.segments = [], this.pathValue = t, this.max = t.length, this.index = 0, this.param = 0, this.segmentStart = 0, this.data = [], this.err = "";
   }
 }
-const mt = (e) => Array.isArray(e) && e.every((t) => {
+const _ = (e) => Array.isArray(e) && e.every((t) => {
   const n = t[0].toLowerCase();
-  return K[n] === t.length - 1 && "achlmqstvz".includes(n);
-}), Q = (e) => {
-  if (mt(e))
+  return U[n] === t.length - 1 && "achlmqstvz".includes(n) && t.slice(1).every(Number.isFinite);
+}) && e.length > 0, Z = (e) => {
+  if (_(e))
     return [...e];
-  const t = new jt(e);
-  for (_(t); t.index < t.max && !t.err.length; )
-    It(t);
+  const t = new zt(e);
+  for (V(t); t.index < t.max && !t.err.length; )
+    jt(t);
   if (t.err && t.err.length)
     throw TypeError(t.err);
   return t.segments;
-}, oe = (e) => {
+}, ce = (e) => {
   const t = e.length;
   let n = -1, r, s = e[t - 1], i = 0;
   for (; ++n < t; )
     r = s, s = e[n], i += r[1] * s[0] - r[0] * s[1];
   return i / 2;
-}, V = (e, t) => Math.sqrt((e[0] - t[0]) * (e[0] - t[0]) + (e[1] - t[1]) * (e[1] - t[1])), ce = (e) => e.reduce((t, n, r) => r ? t + V(e[r - 1], n) : 0, 0);
-var le = Object.defineProperty, ae = (e, t, n) => t in e ? le(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, C = (e, t, n) => (ae(e, typeof t != "symbol" ? t + "" : t, n), n);
-const me = {
+}, W = (e, t) => Math.sqrt((e[0] - t[0]) * (e[0] - t[0]) + (e[1] - t[1]) * (e[1] - t[1])), le = (e) => e.reduce((t, n, r) => r ? t + W(e[r - 1], n) : 0, 0);
+var ae = Object.defineProperty, me = (e, t, n) => t in e ? ae(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, C = (e, t, n) => (me(e, typeof t != "symbol" ? t + "" : t, n), n);
+const he = {
   a: 1,
   b: 0,
   c: 0,
@@ -192,13 +192,13 @@ const me = {
   m44: 1,
   is2D: !0,
   isIdentity: !0
-}, Et = (e) => (e instanceof Float64Array || e instanceof Float32Array || Array.isArray(e) && e.every((t) => typeof t == "number")) && [6, 16].some((t) => e.length === t), Dt = (e) => e instanceof DOMMatrix || e instanceof v || typeof e == "object" && Object.keys(me).every((t) => e && t in e), G = (e) => {
+}, It = (e) => (e instanceof Float64Array || e instanceof Float32Array || Array.isArray(e) && e.every((t) => typeof t == "number")) && [6, 16].some((t) => e.length === t), Dt = (e) => e instanceof DOMMatrix || e instanceof v || typeof e == "object" && Object.keys(he).every((t) => e && t in e), G = (e) => {
   const t = new v(), n = Array.from(e);
-  if (!Et(n))
+  if (!It(n))
     throw TypeError(`CSSMatrix: "${n.join(",")}" must be an array with 6/16 numbers.`);
   if (n.length === 16) {
-    const [r, s, i, o, a, l, c, m, f, y, g, h, u, x, p, b] = n;
-    t.m11 = r, t.a = r, t.m21 = a, t.c = a, t.m31 = f, t.m41 = u, t.e = u, t.m12 = s, t.b = s, t.m22 = l, t.d = l, t.m32 = y, t.m42 = x, t.f = x, t.m13 = i, t.m23 = c, t.m33 = g, t.m43 = p, t.m14 = o, t.m24 = m, t.m34 = h, t.m44 = b;
+    const [r, s, i, o, a, l, c, m, u, y, g, f, h, x, p, b] = n;
+    t.m11 = r, t.a = r, t.m21 = a, t.c = a, t.m31 = u, t.m41 = h, t.e = h, t.m12 = s, t.b = s, t.m22 = l, t.d = l, t.m32 = y, t.m42 = x, t.f = x, t.m13 = i, t.m23 = c, t.m33 = g, t.m43 = p, t.m14 = o, t.m24 = m, t.m34 = f, t.m44 = b;
   } else if (n.length === 6) {
     const [r, s, i, o, a, l] = n;
     t.m11 = r, t.a = r, t.m12 = s, t.b = s, t.m21 = i, t.c = i, t.m22 = o, t.d = o, t.m41 = a, t.e = a, t.m42 = l, t.f = l;
@@ -225,7 +225,7 @@ const me = {
       e.m44
     ]);
   throw TypeError(`CSSMatrix: "${JSON.stringify(e)}" is not a DOMMatrix / CSSMatrix / JSON compatible object.`);
-}, Rt = (e) => {
+}, Ft = (e) => {
   if (typeof e != "string")
     throw TypeError(`CSSMatrix: "${JSON.stringify(e)}" is not a string.`);
   const t = String(e).replace(/\s/g, "");
@@ -235,33 +235,33 @@ const me = {
     const [i, o] = s.split("(");
     if (!o)
       throw TypeError(r);
-    const a = o.split(",").map((h) => h.includes("rad") ? parseFloat(h) * (180 / Math.PI) : parseFloat(h)), [l, c, m, f] = a, y = [l, c, m], g = [l, c, m, f];
-    if (i === "perspective" && l && [c, m].every((h) => h === void 0))
+    const a = o.split(",").map((f) => f.includes("rad") ? parseFloat(f) * (180 / Math.PI) : parseFloat(f)), [l, c, m, u] = a, y = [l, c, m], g = [l, c, m, u];
+    if (i === "perspective" && l && [c, m].every((f) => f === void 0))
       n.m34 = -1 / l;
-    else if (i.includes("matrix") && [6, 16].includes(a.length) && a.every((h) => !Number.isNaN(+h))) {
-      const h = a.map((u) => Math.abs(u) < 1e-6 ? 0 : u);
-      n = n.multiply(G(h));
-    } else if (i === "translate3d" && y.every((h) => !Number.isNaN(+h)))
+    else if (i.includes("matrix") && [6, 16].includes(a.length) && a.every((f) => !Number.isNaN(+f))) {
+      const f = a.map((h) => Math.abs(h) < 1e-6 ? 0 : h);
+      n = n.multiply(G(f));
+    } else if (i === "translate3d" && y.every((f) => !Number.isNaN(+f)))
       n = n.translate(l, c, m);
     else if (i === "translate" && l && m === void 0)
       n = n.translate(l, c || 0, 0);
-    else if (i === "rotate3d" && g.every((h) => !Number.isNaN(+h)) && f)
-      n = n.rotateAxisAngle(l, c, m, f);
-    else if (i === "rotate" && l && [c, m].every((h) => h === void 0))
+    else if (i === "rotate3d" && g.every((f) => !Number.isNaN(+f)) && u)
+      n = n.rotateAxisAngle(l, c, m, u);
+    else if (i === "rotate" && l && [c, m].every((f) => f === void 0))
       n = n.rotate(0, 0, l);
-    else if (i === "scale3d" && y.every((h) => !Number.isNaN(+h)) && y.some((h) => h !== 1))
+    else if (i === "scale3d" && y.every((f) => !Number.isNaN(+f)) && y.some((f) => f !== 1))
       n = n.scale(l, c, m);
     else if (i === "scale" && !Number.isNaN(l) && l !== 1 && m === void 0) {
-      const h = Number.isNaN(+c) ? l : c;
-      n = n.scale(l, h, 1);
+      const f = Number.isNaN(+c) ? l : c;
+      n = n.scale(l, f, 1);
     } else if (i === "skew" && (l || !Number.isNaN(l) && c) && m === void 0)
       n = n.skew(l, c || 0);
-    else if (["translate", "rotate", "scale", "skew"].some((h) => i.includes(h)) && /[XYZ]/.test(i) && l && [c, m].every((h) => h === void 0))
+    else if (["translate", "rotate", "scale", "skew"].some((f) => i.includes(f)) && /[XYZ]/.test(i) && l && [c, m].every((f) => f === void 0))
       if (i === "skewX" || i === "skewY")
         n = n[i](l);
       else {
-        const h = i.replace(/[XYZ]/, ""), u = i.replace(h, ""), x = ["X", "Y", "Z"].indexOf(u), p = h === "scale" ? 1 : 0, b = [x === 0 ? l : p, x === 1 ? l : p, x === 2 ? l : p];
-        n = n[h](...b);
+        const f = i.replace(/[XYZ]/, ""), h = i.replace(f, ""), x = ["X", "Y", "Z"].indexOf(h), p = f === "scale" ? 1 : 0, b = [x === 0 ? l : p, x === 1 ? l : p, x === 2 ? l : p];
+        n = n[f](...b);
       }
     else
       throw TypeError(r);
@@ -283,28 +283,28 @@ const me = {
   e.m42,
   e.m43,
   e.m44
-], Xt = (e, t, n) => {
+], Rt = (e, t, n) => {
   const r = new v();
   return r.m41 = e, r.e = e, r.m42 = t, r.f = t, r.m43 = n, r;
-}, Ft = (e, t, n) => {
-  const r = new v(), s = Math.PI / 180, i = e * s, o = t * s, a = n * s, l = Math.cos(i), c = -Math.sin(i), m = Math.cos(o), f = -Math.sin(o), y = Math.cos(a), g = -Math.sin(a), h = m * y, u = -m * g;
-  r.m11 = h, r.a = h, r.m12 = u, r.b = u, r.m13 = f;
-  const x = c * f * y + l * g;
+}, Xt = (e, t, n) => {
+  const r = new v(), s = Math.PI / 180, i = e * s, o = t * s, a = n * s, l = Math.cos(i), c = -Math.sin(i), m = Math.cos(o), u = -Math.sin(o), y = Math.cos(a), g = -Math.sin(a), f = m * y, h = -m * g;
+  r.m11 = f, r.a = f, r.m12 = h, r.b = h, r.m13 = u;
+  const x = c * u * y + l * g;
   r.m21 = x, r.c = x;
-  const p = l * y - c * f * g;
-  return r.m22 = p, r.d = p, r.m23 = -c * m, r.m31 = c * g - l * f * y, r.m32 = c * y + l * f * g, r.m33 = l * m, r;
+  const p = l * y - c * u * g;
+  return r.m22 = p, r.d = p, r.m23 = -c * m, r.m31 = c * g - l * u * y, r.m32 = c * y + l * u * g, r.m33 = l * m, r;
 }, Qt = (e, t, n, r) => {
   const s = new v(), i = Math.sqrt(e * e + t * t + n * n);
   if (i === 0)
     return s;
-  const o = e / i, a = t / i, l = n / i, c = r * (Math.PI / 360), m = Math.sin(c), f = Math.cos(c), y = m * m, g = o * o, h = a * a, u = l * l, x = 1 - 2 * (h + u) * y;
+  const o = e / i, a = t / i, l = n / i, c = r * (Math.PI / 360), m = Math.sin(c), u = Math.cos(c), y = m * m, g = o * o, f = a * a, h = l * l, x = 1 - 2 * (f + h) * y;
   s.m11 = x, s.a = x;
-  const p = 2 * (o * a * y + l * m * f);
-  s.m12 = p, s.b = p, s.m13 = 2 * (o * l * y - a * m * f);
-  const b = 2 * (a * o * y - l * m * f);
+  const p = 2 * (o * a * y + l * m * u);
+  s.m12 = p, s.b = p, s.m13 = 2 * (o * l * y - a * m * u);
+  const b = 2 * (a * o * y - l * m * u);
   s.m21 = b, s.c = b;
-  const A = 1 - 2 * (u + g) * y;
-  return s.m22 = A, s.d = A, s.m23 = 2 * (a * l * y + o * m * f), s.m31 = 2 * (l * o * y + a * m * f), s.m32 = 2 * (l * a * y - o * m * f), s.m33 = 1 - 2 * (g + h) * y, s;
+  const A = 1 - 2 * (h + g) * y;
+  return s.m22 = A, s.d = A, s.m23 = 2 * (a * l * y + o * m * u), s.m31 = 2 * (l * o * y + a * m * u), s.m32 = 2 * (l * a * y - o * m * u), s.m33 = 1 - 2 * (g + f) * y, s;
 }, Ht = (e, t, n) => {
   const r = new v();
   return r.m11 = e, r.a = e, r.m22 = t, r.d = t, r.m33 = n, r;
@@ -319,9 +319,9 @@ const me = {
     n.m12 = s, n.b = s;
   }
   return n;
-}, Yt = (e) => ht(e, 0), Bt = (e) => ht(0, e), $ = (e, t) => {
-  const n = t.m11 * e.m11 + t.m12 * e.m21 + t.m13 * e.m31 + t.m14 * e.m41, r = t.m11 * e.m12 + t.m12 * e.m22 + t.m13 * e.m32 + t.m14 * e.m42, s = t.m11 * e.m13 + t.m12 * e.m23 + t.m13 * e.m33 + t.m14 * e.m43, i = t.m11 * e.m14 + t.m12 * e.m24 + t.m13 * e.m34 + t.m14 * e.m44, o = t.m21 * e.m11 + t.m22 * e.m21 + t.m23 * e.m31 + t.m24 * e.m41, a = t.m21 * e.m12 + t.m22 * e.m22 + t.m23 * e.m32 + t.m24 * e.m42, l = t.m21 * e.m13 + t.m22 * e.m23 + t.m23 * e.m33 + t.m24 * e.m43, c = t.m21 * e.m14 + t.m22 * e.m24 + t.m23 * e.m34 + t.m24 * e.m44, m = t.m31 * e.m11 + t.m32 * e.m21 + t.m33 * e.m31 + t.m34 * e.m41, f = t.m31 * e.m12 + t.m32 * e.m22 + t.m33 * e.m32 + t.m34 * e.m42, y = t.m31 * e.m13 + t.m32 * e.m23 + t.m33 * e.m33 + t.m34 * e.m43, g = t.m31 * e.m14 + t.m32 * e.m24 + t.m33 * e.m34 + t.m34 * e.m44, h = t.m41 * e.m11 + t.m42 * e.m21 + t.m43 * e.m31 + t.m44 * e.m41, u = t.m41 * e.m12 + t.m42 * e.m22 + t.m43 * e.m32 + t.m44 * e.m42, x = t.m41 * e.m13 + t.m42 * e.m23 + t.m43 * e.m33 + t.m44 * e.m43, p = t.m41 * e.m14 + t.m42 * e.m24 + t.m43 * e.m34 + t.m44 * e.m44;
-  return G([n, r, s, i, o, a, l, c, m, f, y, g, h, u, x, p]);
+}, Yt = (e) => ht(e, 0), Bt = (e) => ht(0, e), O = (e, t) => {
+  const n = t.m11 * e.m11 + t.m12 * e.m21 + t.m13 * e.m31 + t.m14 * e.m41, r = t.m11 * e.m12 + t.m12 * e.m22 + t.m13 * e.m32 + t.m14 * e.m42, s = t.m11 * e.m13 + t.m12 * e.m23 + t.m13 * e.m33 + t.m14 * e.m43, i = t.m11 * e.m14 + t.m12 * e.m24 + t.m13 * e.m34 + t.m14 * e.m44, o = t.m21 * e.m11 + t.m22 * e.m21 + t.m23 * e.m31 + t.m24 * e.m41, a = t.m21 * e.m12 + t.m22 * e.m22 + t.m23 * e.m32 + t.m24 * e.m42, l = t.m21 * e.m13 + t.m22 * e.m23 + t.m23 * e.m33 + t.m24 * e.m43, c = t.m21 * e.m14 + t.m22 * e.m24 + t.m23 * e.m34 + t.m24 * e.m44, m = t.m31 * e.m11 + t.m32 * e.m21 + t.m33 * e.m31 + t.m34 * e.m41, u = t.m31 * e.m12 + t.m32 * e.m22 + t.m33 * e.m32 + t.m34 * e.m42, y = t.m31 * e.m13 + t.m32 * e.m23 + t.m33 * e.m33 + t.m34 * e.m43, g = t.m31 * e.m14 + t.m32 * e.m24 + t.m33 * e.m34 + t.m34 * e.m44, f = t.m41 * e.m11 + t.m42 * e.m21 + t.m43 * e.m31 + t.m44 * e.m41, h = t.m41 * e.m12 + t.m42 * e.m22 + t.m43 * e.m32 + t.m44 * e.m42, x = t.m41 * e.m13 + t.m42 * e.m23 + t.m43 * e.m33 + t.m44 * e.m43, p = t.m41 * e.m14 + t.m42 * e.m24 + t.m43 * e.m34 + t.m44 * e.m44;
+  return G([n, r, s, i, o, a, l, c, m, u, y, g, f, h, x, p]);
 };
 class v {
   /**
@@ -368,7 +368,7 @@ class v {
    * @return the matrix instance
    */
   setMatrixValue(t) {
-    return typeof t == "string" && t.length && t !== "none" ? Rt(t) : Array.isArray(t) || t instanceof Float64Array || t instanceof Float32Array ? G(t) : typeof t == "object" ? Zt(t) : this;
+    return typeof t == "string" && t.length && t !== "none" ? Ft(t) : Array.isArray(t) || t instanceof Float64Array || t instanceof Float32Array ? G(t) : typeof t == "object" ? Zt(t) : this;
   }
   /**
    * Returns a *Float32Array* containing elements which comprise the matrix.
@@ -428,7 +428,7 @@ class v {
    * @return The resulted matrix.
    */
   multiply(t) {
-    return $(this, t);
+    return O(this, t);
   }
   /**
    * The translate method returns a new matrix which is this matrix post
@@ -444,7 +444,7 @@ class v {
   translate(t, n, r) {
     const s = t;
     let i = n, o = r;
-    return typeof i > "u" && (i = 0), typeof o > "u" && (o = 0), $(this, Xt(s, i, o));
+    return typeof i > "u" && (i = 0), typeof o > "u" && (o = 0), O(this, Rt(s, i, o));
   }
   /**
    * The scale method returns a new matrix which is this matrix post multiplied by
@@ -460,7 +460,7 @@ class v {
   scale(t, n, r) {
     const s = t;
     let i = n, o = r;
-    return typeof i > "u" && (i = t), typeof o > "u" && (o = 1), $(this, Ht(s, i, o));
+    return typeof i > "u" && (i = t), typeof o > "u" && (o = 1), O(this, Ht(s, i, o));
   }
   /**
    * The rotate method returns a new matrix which is this matrix post multiplied
@@ -476,7 +476,7 @@ class v {
    */
   rotate(t, n, r) {
     let s = t, i = n || 0, o = r || 0;
-    return typeof t == "number" && typeof n > "u" && typeof r > "u" && (o = s, s = 0, i = 0), $(this, Ft(s, i, o));
+    return typeof t == "number" && typeof n > "u" && typeof r > "u" && (o = s, s = 0, i = 0), O(this, Xt(s, i, o));
   }
   /**
    * The rotateAxisAngle method returns a new matrix which is this matrix post
@@ -493,7 +493,7 @@ class v {
   rotateAxisAngle(t, n, r, s) {
     if ([t, n, r, s].some((i) => Number.isNaN(+i)))
       throw new TypeError("CSSMatrix: expecting 4 values");
-    return $(this, Qt(t, n, r, s));
+    return O(this, Qt(t, n, r, s));
   }
   /**
    * Specifies a skew transformation along the `x-axis` by the given angle.
@@ -503,7 +503,7 @@ class v {
    * @return The resulted matrix
    */
   skewX(t) {
-    return $(this, Yt(t));
+    return O(this, Yt(t));
   }
   /**
    * Specifies a skew transformation along the `y-axis` by the given angle.
@@ -513,7 +513,7 @@ class v {
    * @return The resulted matrix
    */
   skewY(t) {
-    return $(this, Bt(t));
+    return O(this, Bt(t));
   }
   /**
    * Specifies a skew transformation along both the `x-axis` and `y-axis`.
@@ -524,7 +524,7 @@ class v {
    * @return The resulted matrix
    */
   skew(t, n) {
-    return $(this, ht(t, n));
+    return O(this, ht(t, n));
   }
   /**
    * Transforms a specified vector using the matrix, returning a new
@@ -547,12 +547,12 @@ class v {
     };
   }
 }
-C(v, "Translate", Xt), C(v, "Rotate", Ft), C(v, "RotateAxisAngle", Qt), C(v, "Scale", Ht), C(v, "SkewX", Yt), C(v, "SkewY", Bt), C(v, "Skew", ht), C(v, "Multiply", $), C(v, "fromArray", G), C(v, "fromMatrix", Zt), C(v, "fromString", Rt), C(v, "toArray", bt), C(v, "isCompatibleArray", Et), C(v, "isCompatibleObject", Dt);
-const Nt = (e) => mt(e) && // `isPathArray` also checks if it's `Array`
-e.every(([t]) => t === t.toUpperCase()), H = (e) => {
-  if (Nt(e))
+C(v, "Translate", Rt), C(v, "Rotate", Xt), C(v, "RotateAxisAngle", Qt), C(v, "Scale", Ht), C(v, "SkewX", Yt), C(v, "SkewY", Bt), C(v, "Skew", ht), C(v, "Multiply", O), C(v, "fromArray", G), C(v, "fromMatrix", Zt), C(v, "fromString", Ft), C(v, "toArray", bt), C(v, "isCompatibleArray", It), C(v, "isCompatibleObject", Dt);
+const wt = (e) => _(e) && // `isPathArray` also checks if it's `Array`
+e.every(([t]) => t === t.toUpperCase()), Q = (e) => {
+  if (wt(e))
     return [...e];
-  const t = Q(e);
+  const t = Z(e);
   let n = 0, r = 0, s = 0, i = 0;
   return t.map((o) => {
     const a = o.slice(1).map(Number), [l] = o, c = l.toUpperCase();
@@ -576,14 +576,14 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
       else if (c === "H")
         m = [c, a[0] + n];
       else {
-        const f = a.map((y, g) => y + (g % 2 ? r : n));
-        m = [c, ...f];
+        const u = a.map((y, g) => y + (g % 2 ? r : n));
+        m = [c, ...u];
       }
     else
       m = [c, ...a];
     return c === "Z" ? (n = s, r = i) : c === "H" ? [, n] = m : c === "V" ? [, r] = m : ([n, r] = m.slice(-2), c === "M" && (s = n, i = r)), m;
   });
-}, he = (e, t) => {
+}, ue = (e, t) => {
   const [n] = e, { x1: r, y1: s, x2: i, y2: o } = t, a = e.slice(1).map(Number);
   let l = e;
   if ("TQ".includes(n) || (t.qx = null, t.qy = null), n === "H")
@@ -607,7 +607,7 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
     t.qx = c, t.qy = m;
   }
   return l;
-}, wt = (e) => Nt(e) && e.every(([t]) => "ACLMQZ".includes(t)), ut = {
+}, vt = (e) => wt(e) && e.every(([t]) => "ACLMQZ".includes(t)), ut = {
   x1: 0,
   y1: 0,
   x2: 0,
@@ -616,21 +616,21 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
   y: 0,
   qx: null,
   qy: null
-}, j = (e) => {
-  if (wt(e))
+}, z = (e) => {
+  if (vt(e))
     return [...e];
-  const t = H(e), n = { ...ut }, r = t.length;
+  const t = Q(e), n = { ...ut }, r = t.length;
   for (let s = 0; s < r; s += 1) {
-    t[s], t[s] = he(t[s], n);
+    t[s], t[s] = ue(t[s], n);
     const i = t[s], o = i.length;
     n.x1 = +i[o - 2], n.y1 = +i[o - 1], n.x2 = +i[o - 4] || n.x1, n.y2 = +i[o - 3] || n.y1;
   }
   return t;
-}, I = (e, t, n) => {
+}, j = (e, t, n) => {
   const [r, s] = e, [i, o] = t;
   return [r + (i - r) * n, s + (o - s) * n];
 }, dt = (e, t, n, r, s) => {
-  const i = V([e, t], [n, r]);
+  const i = W([e, t], [n, r]);
   let o = { x: 0, y: 0 };
   if (typeof s == "number")
     if (s <= 0)
@@ -638,7 +638,7 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
     else if (s >= i)
       o = { x: n, y: r };
     else {
-      const [a, l] = I([e, t], [n, r], s / i);
+      const [a, l] = j([e, t], [n, r], s / i);
       o = { x: a, y: l };
     }
   return {
@@ -653,59 +653,59 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
       y: Math.max(t, r)
     }
   };
-}, Tt = (e, t) => {
+}, Lt = (e, t) => {
   const { x: n, y: r } = e, { x: s, y: i } = t, o = n * s + r * i, a = Math.sqrt((n ** 2 + r ** 2) * (s ** 2 + i ** 2));
   return (n * i - r * s < 0 ? -1 : 1) * Math.acos(o / a);
-}, ue = (e, t, n, r, s, i, o, a, l, c) => {
-  const { abs: m, sin: f, cos: y, sqrt: g, PI: h } = Math;
-  let u = m(n), x = m(r);
-  const b = (s % 360 + 360) % 360 * (h / 180);
+}, fe = (e, t, n, r, s, i, o, a, l, c) => {
+  const { abs: m, sin: u, cos: y, sqrt: g, PI: f } = Math;
+  let h = m(n), x = m(r);
+  const b = (s % 360 + 360) % 360 * (f / 180);
   if (e === a && t === l)
     return { x: e, y: t };
-  if (u === 0 || x === 0)
+  if (h === 0 || x === 0)
     return dt(e, t, a, l, c).point;
   const A = (e - a) / 2, d = (t - l) / 2, M = {
-    x: y(b) * A + f(b) * d,
-    y: -f(b) * A + y(b) * d
-  }, T = M.x ** 2 / u ** 2 + M.y ** 2 / x ** 2;
-  T > 1 && (u *= g(T), x *= g(T));
-  const z = u ** 2 * x ** 2 - u ** 2 * M.y ** 2 - x ** 2 * M.x ** 2, Y = u ** 2 * M.y ** 2 + x ** 2 * M.x ** 2;
-  let R = z / Y;
-  R = R < 0 ? 0 : R;
-  const tt = (i !== o ? 1 : -1) * g(R), k = {
-    x: tt * (u * M.y / x),
-    y: tt * (-(x * M.x) / u)
+    x: y(b) * A + u(b) * d,
+    y: -u(b) * A + y(b) * d
+  }, T = M.x ** 2 / h ** 2 + M.y ** 2 / x ** 2;
+  T > 1 && (h *= g(T), x *= g(T));
+  const E = h ** 2 * x ** 2 - h ** 2 * M.y ** 2 - x ** 2 * M.x ** 2, H = h ** 2 * M.y ** 2 + x ** 2 * M.x ** 2;
+  let F = E / H;
+  F = F < 0 ? 0 : F;
+  const tt = (i !== o ? 1 : -1) * g(F), S = {
+    x: tt * (h * M.y / x),
+    y: tt * (-(x * M.x) / h)
   }, et = {
-    x: y(b) * k.x - f(b) * k.y + (e + a) / 2,
-    y: f(b) * k.x + y(b) * k.y + (t + l) / 2
-  }, B = {
-    x: (M.x - k.x) / u,
-    y: (M.y - k.y) / x
-  }, nt = Tt({ x: 1, y: 0 }, B), st = {
-    x: (-M.x - k.x) / u,
-    y: (-M.y - k.y) / x
+    x: y(b) * S.x - u(b) * S.y + (e + a) / 2,
+    y: u(b) * S.x + y(b) * S.y + (t + l) / 2
+  }, Y = {
+    x: (M.x - S.x) / h,
+    y: (M.y - S.y) / x
+  }, nt = Lt({ x: 1, y: 0 }, Y), st = {
+    x: (-M.x - S.x) / h,
+    y: (-M.y - S.y) / x
   };
-  let S = Tt(B, st);
-  !o && S > 0 ? S -= 2 * h : o && S < 0 && (S += 2 * h), S %= 2 * h;
-  const q = nt + S * c, J = u * y(q), U = x * f(q);
+  let $ = Lt(Y, st);
+  !o && $ > 0 ? $ -= 2 * f : o && $ < 0 && ($ += 2 * f), $ %= 2 * f;
+  const q = nt + $ * c, B = h * y(q), J = x * u(q);
   return {
-    x: y(b) * J - f(b) * U + et.x,
-    y: f(b) * J + y(b) * U + et.y
+    x: y(b) * B - u(b) * J + et.x,
+    y: u(b) * B + y(b) * J + et.y
   };
-}, fe = (e, t, n, r, s, i, o, a, l, c) => {
+}, ye = (e, t, n, r, s, i, o, a, l, c) => {
   const m = typeof c == "number";
-  let f = e, y = t, g = 0, h = [f, y, g], u = [f, y], x = 0, p = { x: 0, y: 0 }, b = [{ x: f, y }];
-  m && c <= 0 && (p = { x: f, y });
+  let u = e, y = t, g = 0, f = [u, y, g], h = [u, y], x = 0, p = { x: 0, y: 0 }, b = [{ x: u, y }];
+  m && c <= 0 && (p = { x: u, y });
   const A = 300;
   for (let d = 0; d <= A; d += 1) {
-    if (x = d / A, { x: f, y } = ue(e, t, n, r, s, i, o, a, l, x), b = [...b, { x: f, y }], g += V(u, [f, y]), u = [f, y], m && g > c && c > h[2]) {
-      const M = (g - c) / (g - h[2]);
+    if (x = d / A, { x: u, y } = fe(e, t, n, r, s, i, o, a, l, x), b = [...b, { x: u, y }], g += W(h, [u, y]), h = [u, y], m && g > c && c > f[2]) {
+      const M = (g - c) / (g - f[2]);
       p = {
-        x: u[0] * (1 - M) + h[0] * M,
-        y: u[1] * (1 - M) + h[1] * M
+        x: h[0] * (1 - M) + f[0] * M,
+        y: h[1] * (1 - M) + f[1] * M
       };
     }
-    h = [f, y, g];
+    f = [u, y, g];
   }
   return m && c >= g && (p = { x: a, y: l }), {
     length: g,
@@ -719,26 +719,26 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
       y: Math.max(...b.map((d) => d.y))
     }
   };
-}, ye = (e, t, n, r, s, i, o, a, l) => {
+}, ge = (e, t, n, r, s, i, o, a, l) => {
   const c = 1 - l;
   return {
     x: c ** 3 * e + 3 * c ** 2 * l * n + 3 * c * l ** 2 * s + l ** 3 * o,
     y: c ** 3 * t + 3 * c ** 2 * l * r + 3 * c * l ** 2 * i + l ** 3 * a
   };
-}, ge = (e, t, n, r, s, i, o, a, l) => {
+}, xe = (e, t, n, r, s, i, o, a, l) => {
   const c = typeof l == "number";
-  let m = e, f = t, y = 0, g = [m, f, y], h = [m, f], u = 0, x = { x: 0, y: 0 }, p = [{ x: m, y: f }];
-  c && l <= 0 && (x = { x: m, y: f });
+  let m = e, u = t, y = 0, g = [m, u, y], f = [m, u], h = 0, x = { x: 0, y: 0 }, p = [{ x: m, y: u }];
+  c && l <= 0 && (x = { x: m, y: u });
   const b = 300;
   for (let A = 0; A <= b; A += 1) {
-    if (u = A / b, { x: m, y: f } = ye(e, t, n, r, s, i, o, a, u), p = [...p, { x: m, y: f }], y += V(h, [m, f]), h = [m, f], c && y > l && l > g[2]) {
+    if (h = A / b, { x: m, y: u } = ge(e, t, n, r, s, i, o, a, h), p = [...p, { x: m, y: u }], y += W(f, [m, u]), f = [m, u], c && y > l && l > g[2]) {
       const d = (y - l) / (y - g[2]);
       x = {
-        x: h[0] * (1 - d) + g[0] * d,
-        y: h[1] * (1 - d) + g[1] * d
+        x: f[0] * (1 - d) + g[0] * d,
+        y: f[1] * (1 - d) + g[1] * d
       };
     }
-    g = [m, f, y];
+    g = [m, u, y];
   }
   return c && l >= y && (x = { x: o, y: a }), {
     length: y,
@@ -752,59 +752,59 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
       y: Math.max(...p.map((A) => A.y))
     }
   };
-}, xe = (e, t, n, r, s, i, o) => {
+}, pe = (e, t, n, r, s, i, o) => {
   const a = 1 - o;
   return {
     x: a ** 2 * e + 2 * a * o * n + o ** 2 * s,
     y: a ** 2 * t + 2 * a * o * r + o ** 2 * i
   };
-}, pe = (e, t, n, r, s, i, o) => {
+}, be = (e, t, n, r, s, i, o) => {
   const a = typeof o == "number";
-  let l = e, c = t, m = 0, f = [l, c, m], y = [l, c], g = 0, h = { x: 0, y: 0 }, u = [{ x: l, y: c }];
-  a && o <= 0 && (h = { x: l, y: c });
+  let l = e, c = t, m = 0, u = [l, c, m], y = [l, c], g = 0, f = { x: 0, y: 0 }, h = [{ x: l, y: c }];
+  a && o <= 0 && (f = { x: l, y: c });
   const x = 300;
   for (let p = 0; p <= x; p += 1) {
-    if (g = p / x, { x: l, y: c } = xe(e, t, n, r, s, i, g), u = [...u, { x: l, y: c }], m += V(y, [l, c]), y = [l, c], a && m > o && o > f[2]) {
-      const b = (m - o) / (m - f[2]);
-      h = {
-        x: y[0] * (1 - b) + f[0] * b,
-        y: y[1] * (1 - b) + f[1] * b
+    if (g = p / x, { x: l, y: c } = pe(e, t, n, r, s, i, g), h = [...h, { x: l, y: c }], m += W(y, [l, c]), y = [l, c], a && m > o && o > u[2]) {
+      const b = (m - o) / (m - u[2]);
+      f = {
+        x: y[0] * (1 - b) + u[0] * b,
+        y: y[1] * (1 - b) + u[1] * b
       };
     }
-    f = [l, c, m];
+    u = [l, c, m];
   }
-  return a && o >= m && (h = { x: s, y: i }), {
+  return a && o >= m && (f = { x: s, y: i }), {
     length: m,
-    point: h,
+    point: f,
     min: {
-      x: Math.min(...u.map((p) => p.x)),
-      y: Math.min(...u.map((p) => p.y))
+      x: Math.min(...h.map((p) => p.x)),
+      y: Math.min(...h.map((p) => p.y))
     },
     max: {
-      x: Math.max(...u.map((p) => p.x)),
-      y: Math.max(...u.map((p) => p.y))
+      x: Math.max(...h.map((p) => p.x)),
+      y: Math.max(...h.map((p) => p.y))
     }
   };
 }, ft = (e, t) => {
-  const n = j(e), r = typeof t == "number";
-  let s, i = [], o, a = 0, l = 0, c = 0, m = 0, f, y = [], g = [], h = 0, u = { x: 0, y: 0 }, x = u, p = u, b = u, A = 0;
+  const n = z(e), r = typeof t == "number";
+  let s, i = [], o, a = 0, l = 0, c = 0, m = 0, u, y = [], g = [], f = 0, h = { x: 0, y: 0 }, x = h, p = h, b = h, A = 0;
   for (let d = 0, M = n.length; d < M; d += 1)
-    f = n[d], [o] = f, s = o === "M", i = s ? i : [a, l, ...f.slice(1)], s ? ([, c, m] = f, u = { x: c, y: m }, x = u, h = 0, r && t < 1e-3 && (b = u)) : o === "L" ? { length: h, min: u, max: x, point: p } = dt(
+    u = n[d], [o] = u, s = o === "M", i = s ? i : [a, l, ...u.slice(1)], s ? ([, c, m] = u, h = { x: c, y: m }, x = h, f = 0, r && t < 1e-3 && (b = h)) : o === "L" ? { length: f, min: h, max: x, point: p } = dt(
       ...i,
       (t || 0) - A
-    ) : o === "A" ? { length: h, min: u, max: x, point: p } = fe(
+    ) : o === "A" ? { length: f, min: h, max: x, point: p } = ye(
       ...i,
       (t || 0) - A
-    ) : o === "C" ? { length: h, min: u, max: x, point: p } = ge(
+    ) : o === "C" ? { length: f, min: h, max: x, point: p } = xe(
       ...i,
       (t || 0) - A
-    ) : o === "Q" ? { length: h, min: u, max: x, point: p } = pe(
+    ) : o === "Q" ? { length: f, min: h, max: x, point: p } = be(
       ...i,
       (t || 0) - A
-    ) : o === "Z" && (i = [a, l, c, m], { length: h, min: u, max: x, point: p } = dt(
+    ) : o === "Z" && (i = [a, l, c, m], { length: f, min: h, max: x, point: p } = dt(
       ...i,
       (t || 0) - A
-    )), r && A < t && A + h >= t && (b = p), g = [...g, x], y = [...y, u], A += h, [a, l] = o !== "Z" ? f.slice(-2) : [c, m];
+    )), r && A < t && A + f >= t && (b = p), g = [...g, x], y = [...y, h], A += f, [a, l] = o !== "Z" ? u.slice(-2) : [c, m];
   return r && t >= A && (b = { x: a, y: l }), {
     length: A,
     point: b,
@@ -817,7 +817,7 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
       y: Math.max(...g.map((d) => d.y))
     }
   };
-}, Lt = (e) => {
+}, kt = (e) => {
   if (!e)
     return {
       x: 0,
@@ -855,38 +855,38 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
       t[n] = "A", e.splice(s += 1, 0, ["C", ...r.splice(0, 6)]);
     e.splice(n, 1);
   }
-}, Jt = (e) => wt(e) && e.every(([t]) => "MC".includes(t)), rt = (e, t, n) => {
+}, Jt = (e) => vt(e) && e.every(([t]) => "MC".includes(t)), rt = (e, t, n) => {
   const r = e * Math.cos(n) - t * Math.sin(n), s = e * Math.sin(n) + t * Math.cos(n);
   return { x: r, y: s };
 }, Ut = (e, t, n, r, s, i, o, a, l, c) => {
-  let m = e, f = t, y = n, g = r, h = a, u = l;
+  let m = e, u = t, y = n, g = r, f = a, h = l;
   const x = Math.PI * 120 / 180, p = Math.PI / 180 * (+s || 0);
-  let b = [], A, d, M, T, z;
+  let b = [], A, d, M, T, E;
   if (c)
-    [d, M, T, z] = c;
+    [d, M, T, E] = c;
   else {
-    A = rt(m, f, -p), m = A.x, f = A.y, A = rt(h, u, -p), h = A.x, u = A.y;
-    const P = (m - h) / 2, L = (f - u) / 2;
-    let E = P * P / (y * y) + L * L / (g * g);
-    E > 1 && (E = Math.sqrt(E), y *= E, g *= E);
-    const xt = y * y, pt = g * g, Pt = (i === o ? -1 : 1) * Math.sqrt(Math.abs((xt * pt - xt * L * L - pt * P * P) / (xt * L * L + pt * P * P)));
-    T = Pt * y * L / g + (m + h) / 2, z = Pt * -g * P / y + (f + u) / 2, d = Math.asin(((f - z) / g * 10 ** 9 >> 0) / 10 ** 9), M = Math.asin(((u - z) / g * 10 ** 9 >> 0) / 10 ** 9), d = m < T ? Math.PI - d : d, M = h < T ? Math.PI - M : M, d < 0 && (d = Math.PI * 2 + d), M < 0 && (M = Math.PI * 2 + M), o && d > M && (d -= Math.PI * 2), !o && M > d && (M -= Math.PI * 2);
+    A = rt(m, u, -p), m = A.x, u = A.y, A = rt(f, h, -p), f = A.x, h = A.y;
+    const P = (m - f) / 2, L = (u - h) / 2;
+    let I = P * P / (y * y) + L * L / (g * g);
+    I > 1 && (I = Math.sqrt(I), y *= I, g *= I);
+    const xt = y * y, pt = g * g, Ct = (i === o ? -1 : 1) * Math.sqrt(Math.abs((xt * pt - xt * L * L - pt * P * P) / (xt * L * L + pt * P * P)));
+    T = Ct * y * L / g + (m + f) / 2, E = Ct * -g * P / y + (u + h) / 2, d = Math.asin(((u - E) / g * 10 ** 9 >> 0) / 10 ** 9), M = Math.asin(((h - E) / g * 10 ** 9 >> 0) / 10 ** 9), d = m < T ? Math.PI - d : d, M = f < T ? Math.PI - M : M, d < 0 && (d = Math.PI * 2 + d), M < 0 && (M = Math.PI * 2 + M), o && d > M && (d -= Math.PI * 2), !o && M > d && (M -= Math.PI * 2);
   }
-  let Y = M - d;
-  if (Math.abs(Y) > x) {
-    const P = M, L = h, E = u;
-    M = d + x * (o && M > d ? 1 : -1), h = T + y * Math.cos(M), u = z + g * Math.sin(M), b = Ut(h, u, y, g, s, 0, o, L, E, [M, P, T, z]);
+  let H = M - d;
+  if (Math.abs(H) > x) {
+    const P = M, L = f, I = h;
+    M = d + x * (o && M > d ? 1 : -1), f = T + y * Math.cos(M), h = E + g * Math.sin(M), b = Ut(f, h, y, g, s, 0, o, L, I, [M, P, T, E]);
   }
-  Y = M - d;
-  const R = Math.cos(d), tt = Math.sin(d), k = Math.cos(M), et = Math.sin(M), B = Math.tan(Y / 4), nt = 4 / 3 * y * B, st = 4 / 3 * g * B, S = [m, f], q = [m + nt * tt, f - st * R], J = [h + nt * et, u - st * k], U = [h, u];
-  if (q[0] = 2 * S[0] - q[0], q[1] = 2 * S[1] - q[1], c)
-    return [...q, ...J, ...U, ...b];
-  b = [...q, ...J, ...U, ...b];
+  H = M - d;
+  const F = Math.cos(d), tt = Math.sin(d), S = Math.cos(M), et = Math.sin(M), Y = Math.tan(H / 4), nt = 4 / 3 * y * Y, st = 4 / 3 * g * Y, $ = [m, u], q = [m + nt * tt, u - st * F], B = [f + nt * et, h - st * S], J = [f, h];
+  if (q[0] = 2 * $[0] - q[0], q[1] = 2 * $[1] - q[1], c)
+    return [...q, ...B, ...J, ...b];
+  b = [...q, ...B, ...J, ...b];
   const gt = [];
   for (let P = 0, L = b.length; P < L; P += 1)
     gt[P] = P % 2 ? rt(b[P - 1], b[P], p).y : rt(b[P], b[P + 1], p).x;
   return gt;
-}, be = (e, t, n, r, s, i) => {
+}, de = (e, t, n, r, s, i) => {
   const o = 0.3333333333333333, a = 2 / 3;
   return [
     o * e + a * n,
@@ -901,15 +901,15 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
     i
     // x,y
   ];
-}, kt = (e, t, n, r) => [...I([e, t], [n, r], 0.5), n, r, n, r], ot = (e, t) => {
+}, St = (e, t, n, r) => [...j([e, t], [n, r], 0.5), n, r, n, r], ot = (e, t) => {
   const [n] = e, r = e.slice(1).map(Number), [s, i] = r;
   let o;
   const { x1: a, y1: l, x: c, y: m } = t;
-  return "TQ".includes(n) || (t.qx = null, t.qy = null), n === "M" ? (t.x = s, t.y = i, e) : n === "A" ? (o = [a, l, ...r], ["C", ...Ut(...o)]) : n === "Q" ? (t.qx = s, t.qy = i, o = [a, l, ...r], ["C", ...be(...o)]) : n === "L" ? ["C", ...kt(a, l, s, i)] : n === "Z" ? ["C", ...kt(a, l, c, m)] : e;
+  return "TQ".includes(n) || (t.qx = null, t.qy = null), n === "M" ? (t.x = s, t.y = i, e) : n === "A" ? (o = [a, l, ...r], ["C", ...Ut(...o)]) : n === "Q" ? (t.qx = s, t.qy = i, o = [a, l, ...r], ["C", ...de(...o)]) : n === "L" ? ["C", ...St(a, l, s, i)] : n === "Z" ? ["C", ...St(a, l, c, m)] : e;
 }, ct = (e) => {
   if (Jt(e))
     return [...e];
-  const t = j(e), n = { ...ut }, r = [];
+  const t = z(e), n = { ...ut }, r = [];
   let s = "", i = t.length;
   for (let o = 0; o < i; o += 1) {
     [s] = t[o], r[o] = s, t[o] = ot(t[o], n), Mt(t, r, o), i = t.length;
@@ -917,30 +917,30 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
     n.x1 = +a[l - 2], n.y1 = +a[l - 1], n.x2 = +a[l - 4] || n.x1, n.y2 = +a[l - 3] || n.y1;
   }
   return t;
-}, de = (e, t, n, r, s, i, o, a) => 3 * ((a - t) * (n + s) - (o - e) * (r + i) + r * (e - s) - n * (t - i) + a * (s + e / 3) - o * (i + t / 3)) / 20, Kt = (e) => {
+}, Me = (e, t, n, r, s, i, o, a) => 3 * ((a - t) * (n + s) - (o - e) * (r + i) + r * (e - s) - n * (t - i) + a * (s + e / 3) - o * (i + t / 3)) / 20, Vt = (e) => {
   let t = 0, n = 0, r = 0;
   return ct(e).map((s) => {
     switch (s[0]) {
       case "M":
         return [, t, n] = s, 0;
       default:
-        return r = de(t, n, ...s.slice(1)), [t, n] = s.slice(-2), r;
+        return r = Me(t, n, ...s.slice(1)), [t, n] = s.slice(-2), r;
     }
   }).reduce((s, i) => s + i, 0);
-}, F = (e) => ft(e).length, Me = (e) => Kt(ct(e)) >= 0, W = (e, t) => ft(e, t).point, vt = (e, t) => {
-  const n = Q(e);
-  let r = [...n], s = F(r), i = r.length - 1, o = 0, a = 0, l = n[0];
-  const [c, m] = l.slice(-2), f = { x: c, y: m };
+}, X = (e) => ft(e).length, Ae = (e) => Vt(ct(e)) >= 0, K = (e, t) => ft(e, t).point, Pt = (e, t) => {
+  const n = Z(e);
+  let r = [...n], s = X(r), i = r.length - 1, o = 0, a = 0, l = n[0];
+  const [c, m] = l.slice(-2), u = { x: c, y: m };
   if (i <= 0 || !t || !Number.isFinite(t))
     return {
       segment: l,
       index: 0,
       length: a,
-      point: f,
+      point: u,
       lengthAtSegment: o
     };
   if (t >= s)
-    return r = n.slice(0, -1), o = F(r), a = s - o, {
+    return r = n.slice(0, -1), o = X(r), a = s - o, {
       segment: n[i],
       index: i,
       length: a,
@@ -948,7 +948,7 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
     };
   const y = [];
   for (; i > 0; )
-    l = r[i], r = r.slice(0, -1), o = F(r), a = s - o, s = o, y.push({
+    l = r[i], r = r.slice(0, -1), o = X(r), a = s - o, s = o, y.push({
       segment: l,
       index: i,
       length: a,
@@ -956,41 +956,31 @@ e.every(([t]) => t === t.toUpperCase()), H = (e) => {
     }), i -= 1;
   return y.find(({ lengthAtSegment: g }) => g <= t);
 }, yt = (e, t) => {
-  const n = Q(e), r = j(n), s = F(n), i = (d) => {
+  const n = Z(e), r = z(n), s = X(n), i = (d) => {
     const M = d.x - t.x, T = d.y - t.y;
     return M * M + T * T;
   };
-  let o = 8, a, l = { x: 0, y: 0 }, c = 0, m = 0, f = 1 / 0;
+  let o = 8, a, l = { x: 0, y: 0 }, c = 0, m = 0, u = 1 / 0;
   for (let d = 0; d <= s; d += o)
-    a = W(r, d), c = i(a), c < f && (l = a, m = d, f = c);
+    a = K(r, d), c = i(a), c < u && (l = a, m = d, u = c);
   o /= 2;
-  let y, g, h = 0, u = 0, x = 0, p = 0;
+  let y, g, f = 0, h = 0, x = 0, p = 0;
   for (; o > 0.5; )
-    h = m - o, y = W(r, h), x = i(y), u = m + o, g = W(r, u), p = i(g), h >= 0 && x < f ? (l = y, m = h, f = x) : u <= s && p < f ? (l = g, m = u, f = p) : o /= 2;
-  const b = vt(n, m), A = Math.sqrt(f);
+    f = m - o, y = K(r, f), x = i(y), h = m + o, g = K(r, h), p = i(g), f >= 0 && x < u ? (l = y, m = f, u = x) : h <= s && p < u ? (l = g, m = h, u = p) : o /= 2;
+  const b = Pt(n, m), A = Math.sqrt(u);
   return { closest: l, distance: A, segment: b };
-}, Ae = (e, t) => yt(e, t).closest, Ne = (e, t) => yt(e, t).segment, we = (e, t) => vt(e, t).segment, ve = (e, t) => {
+}, Ne = (e, t) => yt(e, t).closest, we = (e, t) => yt(e, t).segment, ve = (e, t) => Pt(e, t).segment, Pe = (e, t) => {
   const { distance: n } = yt(e, t);
   return Math.abs(n) < 1e-3;
-}, _t = (e) => {
-  if (typeof e != "string")
+}, Kt = (e) => {
+  if (typeof e != "string" || !e.length)
     return !1;
-  const t = new jt(e);
-  for (_(t); t.index < t.max && !t.err.length; )
-    It(t);
+  const t = new zt(e);
+  for (V(t); t.index < t.max && !t.err.length; )
+    jt(t);
   return !t.err.length && "mM".includes(t.segments[0][0]);
-}, Wt = (e) => mt(e) && // `isPathArray` checks if it's `Array`
-e.slice(1).every(([t]) => t === t.toLowerCase()), lt = (e, t) => {
-  let { round: n } = at;
-  if (t === "off" || n === "off")
-    return [...e];
-  n = typeof t == "number" && t >= 0 ? t : n;
-  const r = typeof n == "number" && n >= 1 ? 10 ** n : 1;
-  return e.map((s) => {
-    const i = s.slice(1).map(Number).map((o) => n ? Math.round(o * r) / r : Math.round(o));
-    return [s[0], ...i];
-  });
-}, Z = (e, t) => lt(e, t).map((n) => n[0] + n.slice(1).join(" ")).join(""), St = {
+}, _t = (e) => _(e) && // `isPathArray` checks if it's `Array`
+e.slice(1).every(([t]) => t === t.toLowerCase()), lt = {
   line: ["x1", "y1", "x2", "y2"],
   circle: ["cx", "cy", "r"],
   ellipse: ["cx", "cy", "rx", "ry"],
@@ -998,36 +988,36 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), lt = (e, t) => {
   polygon: ["points"],
   polyline: ["points"],
   glyph: ["d"]
-}, Pe = (e) => {
-  const { x1: t, y1: n, x2: r, y2: s } = e;
-  return [
+}, Ce = (e) => {
+  let { x1: t, y1: n, x2: r, y2: s } = e;
+  return [t, n, r, s] = [t, n, r, s].map((i) => +i), [
     ["M", t, n],
     ["L", r, s]
   ];
-}, Ce = (e) => {
-  const t = [], n = (e.points || "").trim().split(/[\s|,]/).map(Number);
+}, Te = (e) => {
+  const t = [], n = (e.points || "").trim().split(/[\s|,]/).map((s) => +s);
   let r = 0;
   for (; r < n.length; )
     t.push([r ? "L" : "M", n[r], n[r + 1]]), r += 2;
   return e.type === "polygon" ? [...t, ["z"]] : t;
-}, Te = (e) => {
-  const { cx: t, cy: n, r } = e;
-  return [
+}, Le = (e) => {
+  let { cx: t, cy: n, r } = e;
+  return [t, n, r] = [t, n, r].map((s) => +s), [
     ["M", t - r, n],
     ["a", r, r, 0, 1, 0, 2 * r, 0],
     ["a", r, r, 0, 1, 0, -2 * r, 0]
   ];
-}, Le = (e) => {
-  const { cx: t, cy: n, rx: r, ry: s } = e;
-  return [
+}, ke = (e) => {
+  let { cx: t, cy: n } = e, r = e.rx || 0, s = e.ry || r;
+  return [t, n, r, s] = [t, n, r, s].map((i) => +i), [
     ["M", t - r, n],
     ["a", r, s, 0, 1, 0, 2 * r, 0],
     ["a", r, s, 0, 1, 0, -2 * r, 0]
   ];
-}, ke = (e) => {
+}, Se = (e) => {
   const t = +e.x || 0, n = +e.y || 0, r = +e.width, s = +e.height;
-  let i = +e.rx, o = +e.ry;
-  return i || o ? (i = i || o, o = o || i, i * 2 > r && (i -= (i * 2 - r) / 2), o * 2 > s && (o -= (o * 2 - s) / 2), [
+  let i = +(e.rx || 0), o = +(e.ry || i);
+  return i || o ? (i * 2 > r && (i -= (i * 2 - r) / 2), o * 2 > s && (o -= (o * 2 - s) / 2), [
     ["M", t + i, n],
     ["h", r - i * 2],
     ["s", i, 0, i, o],
@@ -1038,35 +1028,55 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), lt = (e, t) => {
     ["v", -s + o * 2],
     ["s", 0, -o, i, -o]
   ]) : [["M", t, n], ["h", r], ["v", s], ["H", t], ["Z"]];
-}, Se = (e, t, n) => {
+}, Wt = (e, t) => {
+  const r = (t || document).defaultView || /* istanbul ignore next */
+  window, s = Object.keys(lt), i = e instanceof r.SVGElement, o = i ? e.tagName : null;
+  if (o && [...s, "path"].every((u) => o !== u))
+    throw TypeError(`${k}: "${o}" is not SVGElement`);
+  const a = i ? o : e.type, l = lt[a], c = { type: a };
+  i ? l.forEach((u) => {
+    c[u] = e.getAttribute(u);
+  }) : Object.assign(c, e);
+  let m = [];
+  return a === "circle" ? m = Le(c) : a === "ellipse" ? m = ke(c) : ["polyline", "polygon"].includes(a) ? m = Te(c) : a === "rect" ? m = Se(c) : a === "line" ? m = Ce(c) : ["glyph", "path"].includes(a) && (m = Z(i ? e.getAttribute("d") || "" : e.d || "")), _(m) && m.length ? m : !1;
+}, at = (e, t) => {
+  let { round: n } = mt;
+  if (t === "off" || n === "off")
+    return [...e];
+  n = typeof t == "number" && t >= 0 ? t : n;
+  const r = typeof n == "number" && n >= 1 ? 10 ** n : 1;
+  return e.map((s) => {
+    const i = s.slice(1).map(Number).map((o) => n ? Math.round(o * r) / r : Math.round(o));
+    return [s[0], ...i];
+  });
+}, At = (e, t) => at(e, t).map((n) => n[0] + n.slice(1).join(" ")).join(""), $e = (e, t, n) => {
   const r = n || document, s = r.defaultView || /* istanbul ignore next */
-  window, i = Object.keys(St), o = e instanceof s.SVGElement, a = o ? e.tagName : null;
+  window, i = Object.keys(lt), o = e instanceof s.SVGElement, a = o ? e.tagName : null;
+  if (a === "path")
+    throw TypeError(`${k}: "${a}" is already SVGPathElement`);
   if (a && i.every((h) => a !== h))
-    throw TypeError(`${O}: "${a}" is not SVGElement`);
-  const l = r.createElementNS("http://www.w3.org/2000/svg", "path"), c = o ? a : e.type, m = St[c], f = { type: c };
-  o ? (m.forEach((h) => {
-    m.includes(h) && (f[h] = e.getAttribute(h));
-  }), Object.values(e.attributes).forEach(({ name: h, value: u }) => {
-    m.includes(h) || l.setAttribute(h, u);
-  })) : (Object.assign(f, e), Object.keys(f).forEach((h) => {
+    throw TypeError(`${k}: "${a}" is not SVGElement`);
+  const l = r.createElementNS("http://www.w3.org/2000/svg", "path"), c = o ? a : e.type, m = lt[c], u = { type: c }, y = mt.round, g = Wt(e, r), f = g && g.length ? At(g, y) : "";
+  return o ? (m.forEach((h) => {
+    u[h] = e.getAttribute(h);
+  }), Object.values(e.attributes).forEach(({ name: h, value: x }) => {
+    m.includes(h) || l.setAttribute(h, x);
+  })) : (Object.assign(u, e), Object.keys(u).forEach((h) => {
     !m.includes(h) && h !== "type" && l.setAttribute(
-      h.replace(/[A-Z]/g, (u) => `-${u.toLowerCase()}`),
-      f[h]
+      h.replace(/[A-Z]/g, (x) => `-${x.toLowerCase()}`),
+      u[h]
     );
-  }));
-  let y = "";
-  const g = at.round;
-  return c === "circle" ? y = Z(Te(f), g) : c === "ellipse" ? y = Z(Le(f), g) : ["polyline", "polygon"].includes(c) ? y = Z(Ce(f), g) : c === "rect" ? y = Z(ke(f), g) : c === "line" ? y = Z(Pe(f), g) : c === "glyph" && (y = o ? e.getAttribute("d") : e.d), _t(y) ? (l.setAttribute("d", y), t && o && (e.before(l, e), e.remove()), l) : !1;
-}, qt = (e) => {
+  })), Kt(f) ? (l.setAttribute("d", f), t && o && (e.before(l, e), e.remove()), l) : !1;
+}, $t = (e) => {
   const t = [];
   let n, r = -1;
   return e.forEach((s) => {
     s[0] === "M" ? (n = [s], r += 1) : n = [...n, s], t[r] = n;
   }), t;
-}, At = (e) => {
-  if (Wt(e))
+}, Nt = (e) => {
+  if (_t(e))
     return [...e];
-  const t = Q(e);
+  const t = Z(e);
   let n = 0, r = 0, s = 0, i = 0;
   return t.map((o) => {
     const a = o.slice(1).map(Number), [l] = o, c = l.toLowerCase();
@@ -1090,39 +1100,39 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), lt = (e, t) => {
       else if (c === "h")
         m = [c, a[0] - n];
       else {
-        const y = a.map((g, h) => g - (h % 2 ? r : n));
+        const y = a.map((g, f) => g - (f % 2 ? r : n));
         m = [c, ...y];
       }
     else
       l === "m" && (s = a[0] + n, i = a[1] + r), m = [c, ...a];
-    const f = m.length;
-    return c === "z" ? (n = s, r = i) : c === "h" ? n += m[1] : c === "v" ? r += m[1] : (n += m[f - 2], r += m[f - 1]), m;
+    const u = m.length;
+    return c === "z" ? (n = s, r = i) : c === "h" ? n += m[1] : c === "v" ? r += m[1] : (n += m[u - 2], r += m[u - 1]), m;
   });
 }, qe = (e, t, n, r) => {
-  const [s] = e, i = (p) => Math.round(p * 10 ** 4) / 10 ** 4, o = e.slice(1).map((p) => +p), a = t.slice(1).map((p) => +p), { x1: l, y1: c, x2: m, y2: f, x: y, y: g } = n;
-  let h = e;
-  const [u, x] = a.slice(-2);
+  const [s] = e, i = (p) => Math.round(p * 10 ** 4) / 10 ** 4, o = e.slice(1).map((p) => +p), a = t.slice(1).map((p) => +p), { x1: l, y1: c, x2: m, y2: u, x: y, y: g } = n;
+  let f = e;
+  const [h, x] = a.slice(-2);
   if ("TQ".includes(s) || (n.qx = null, n.qy = null), ["V", "H", "S", "T", "Z"].includes(s))
-    h = [s, ...o];
+    f = [s, ...o];
   else if (s === "L")
-    i(y) === i(u) ? h = ["V", x] : i(g) === i(x) && (h = ["H", u]);
+    i(y) === i(h) ? f = ["V", x] : i(g) === i(x) && (f = ["H", h]);
   else if (s === "C") {
     const [p, b] = a;
-    "CS".includes(r) && (i(p) === i(l * 2 - m) && i(b) === i(c * 2 - f) || i(l) === i(m * 2 - y) && i(c) === i(f * 2 - g)) && (h = ["S", ...a.slice(-4)]), n.x1 = p, n.y1 = b;
+    "CS".includes(r) && (i(p) === i(l * 2 - m) && i(b) === i(c * 2 - u) || i(l) === i(m * 2 - y) && i(c) === i(u * 2 - g)) && (f = ["S", ...a.slice(-4)]), n.x1 = p, n.y1 = b;
   } else if (s === "Q") {
     const [p, b] = a;
-    n.qx = p, n.qy = b, "QT".includes(r) && (i(p) === i(l * 2 - m) && i(b) === i(c * 2 - f) || i(l) === i(m * 2 - y) && i(c) === i(f * 2 - g)) && (h = ["T", ...a.slice(-2)]);
+    n.qx = p, n.qy = b, "QT".includes(r) && (i(p) === i(l * 2 - m) && i(b) === i(c * 2 - u) || i(l) === i(m * 2 - y) && i(c) === i(u * 2 - g)) && (f = ["T", ...a.slice(-2)]);
   }
-  return h;
-}, $t = (e, t) => {
-  const n = H(e), r = j(n), s = { ...ut }, i = [], o = n.length;
-  let a = "", l = "", c = 0, m = 0, f = 0, y = 0;
-  for (let u = 0; u < o; u += 1) {
-    [a] = n[u], i[u] = a, u && (l = i[u - 1]), n[u] = qe(n[u], r[u], s, l);
-    const x = n[u], p = x.length;
+  return f;
+}, qt = (e, t) => {
+  const n = Q(e), r = z(n), s = { ...ut }, i = [], o = n.length;
+  let a = "", l = "", c = 0, m = 0, u = 0, y = 0;
+  for (let h = 0; h < o; h += 1) {
+    [a] = n[h], i[h] = a, h && (l = i[h - 1]), n[h] = qe(n[h], r[h], s, l);
+    const x = n[h], p = x.length;
     switch (s.x1 = +x[p - 2], s.y1 = +x[p - 1], s.x2 = +x[p - 4] || s.x1, s.y2 = +x[p - 3] || s.y1, a) {
       case "Z":
-        c = f, m = y;
+        c = u, m = y;
         break;
       case "H":
         [, c] = x;
@@ -1131,19 +1141,19 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), lt = (e, t) => {
         [, m] = x;
         break;
       default:
-        [c, m] = x.slice(-2).map(Number), a === "M" && (f = c, y = m);
+        [c, m] = x.slice(-2).map(Number), a === "M" && (u = c, y = m);
     }
     s.x = c, s.y = m;
   }
-  const g = lt(n, t), h = lt(At(n), t);
-  return g.map((u, x) => x ? u.join("").length < h[x].join("").length ? u : h[x] : u);
-}, $e = (e) => {
+  const g = at(n, t), f = at(Nt(n), t);
+  return g.map((h, x) => x ? h.join("").length < f[x].join("").length ? h : f[x] : h);
+}, Oe = (e) => {
   const t = e.slice(1).map(
     (n, r, s) => r ? [...s[r - 1].slice(-2), ...n.slice(1)] : [...e[0].slice(1), ...n.slice(1)]
   ).map((n) => n.map((r, s) => n[n.length - s - 2 * (1 - s % 2)])).reverse();
   return [["M", ...t[0].slice(0, 2)], ...t.map((n) => ["C", ...n.slice(2)])];
 }, it = (e) => {
-  const t = H(e), n = t.slice(-1)[0][0] === "Z", r = j(t).map((s, i) => {
+  const t = Q(e), n = t.slice(-1)[0][0] === "Z", r = z(t).map((s, i) => {
     const [o, a] = s.slice(-2).map(Number);
     return {
       seg: t[i],
@@ -1158,93 +1168,93 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), lt = (e, t) => {
       // y
     };
   }).map((s, i, o) => {
-    const a = s.seg, l = s.n, c = i && o[i - 1], m = o[i + 1], f = s.c, y = o.length, g = i ? o[i - 1].x : o[y - 1].x, h = i ? o[i - 1].y : o[y - 1].y;
-    let u = [];
-    switch (f) {
+    const a = s.seg, l = s.n, c = i && o[i - 1], m = o[i + 1], u = s.c, y = o.length, g = i ? o[i - 1].x : o[y - 1].x, f = i ? o[i - 1].y : o[y - 1].y;
+    let h = [];
+    switch (u) {
       case "M":
-        u = n ? ["Z"] : [f, g, h];
+        h = n ? ["Z"] : [u, g, f];
         break;
       case "A":
-        u = [f, ...a.slice(1, -3), a[5] === 1 ? 0 : 1, g, h];
+        h = [u, ...a.slice(1, -3), a[5] === 1 ? 0 : 1, g, f];
         break;
       case "C":
-        m && m.c === "S" ? u = ["S", a[1], a[2], g, h] : u = [f, a[3], a[4], a[1], a[2], g, h];
+        m && m.c === "S" ? h = ["S", a[1], a[2], g, f] : h = [u, a[3], a[4], a[1], a[2], g, f];
         break;
       case "S":
-        c && "CS".includes(c.c) && (!m || m.c !== "S") ? u = ["C", l[3], l[4], l[1], l[2], g, h] : u = [f, l[1], l[2], g, h];
+        c && "CS".includes(c.c) && (!m || m.c !== "S") ? h = ["C", l[3], l[4], l[1], l[2], g, f] : h = [u, l[1], l[2], g, f];
         break;
       case "Q":
-        m && m.c === "T" ? u = ["T", g, h] : u = [f, ...a.slice(1, -2), g, h];
+        m && m.c === "T" ? h = ["T", g, f] : h = [u, ...a.slice(1, -2), g, f];
         break;
       case "T":
-        c && "QT".includes(c.c) && (!m || m.c !== "T") ? u = ["Q", l[1], l[2], g, h] : u = [f, g, h];
+        c && "QT".includes(c.c) && (!m || m.c !== "T") ? h = ["Q", l[1], l[2], g, f] : h = [u, g, f];
         break;
       case "Z":
-        u = ["M", g, h];
+        h = ["M", g, f];
         break;
       case "H":
-        u = [f, g];
+        h = [u, g];
         break;
       case "V":
-        u = [f, h];
+        h = [u, f];
         break;
       default:
-        u = [f, ...a.slice(1, -2), g, h];
+        h = [u, ...a.slice(1, -2), g, f];
     }
-    return u;
+    return h;
   });
   return n ? r.reverse() : [r[0], ...r.slice(1).reverse()];
-}, Oe = (e) => {
+}, Ee = (e) => {
   let t = new v();
   const { origin: n } = e, [r, s] = n, { translate: i } = e, { rotate: o } = e, { skew: a } = e, { scale: l } = e;
   return Array.isArray(i) && i.length >= 2 && i.every((c) => !Number.isNaN(+c)) && i.some((c) => c !== 0) ? t = t.translate(...i) : typeof i == "number" && !Number.isNaN(i) && (t = t.translate(i)), (o || a || l) && (t = t.translate(r, s), Array.isArray(o) && o.length >= 2 && o.every((c) => !Number.isNaN(+c)) && o.some((c) => c !== 0) ? t = t.rotate(...o) : typeof o == "number" && !Number.isNaN(o) && (t = t.rotate(o)), Array.isArray(a) && a.length === 2 && a.every((c) => !Number.isNaN(+c)) && a.some((c) => c !== 0) ? (t = a[0] ? t.skewX(a[0]) : t, t = a[1] ? t.skewY(a[1]) : t) : typeof a == "number" && !Number.isNaN(a) && (t = t.skewX(a)), Array.isArray(l) && l.length >= 2 && l.every((c) => !Number.isNaN(+c)) && l.some((c) => c !== 1) ? t = t.scale(...l) : typeof l == "number" && !Number.isNaN(l) && (t = t.scale(l)), t = t.translate(-r, -s)), t;
-}, ze = (e, t) => {
+}, je = (e, t) => {
   let n = v.Translate(...t.slice(0, -1));
   return [, , , n.m44] = t, n = e.multiply(n), [n.m41, n.m42, n.m43, n.m44];
 }, Ot = (e, t, n) => {
-  const [r, s, i] = n, [o, a, l] = ze(e, [...t, 0, 1]), c = o - r, m = a - s, f = l - i;
+  const [r, s, i] = n, [o, a, l] = je(e, [...t, 0, 1]), c = o - r, m = a - s, u = l - i;
   return [
     // protect against division by ZERO
-    c * (Math.abs(i) / Math.abs(f) || 1) + r,
-    m * (Math.abs(i) / Math.abs(f) || 1) + s
+    c * (Math.abs(i) / Math.abs(u) || 1) + r,
+    m * (Math.abs(i) / Math.abs(u) || 1) + s
   ];
-}, zt = (e, t) => {
+}, Et = (e, t) => {
   let n = 0, r = 0, s, i, o, a, l, c;
-  const m = H(e), f = t && Object.keys(t);
-  if (!t || f && !f.length)
+  const m = Q(e), u = t && Object.keys(t);
+  if (!t || u && !u.length)
     return [...m];
-  const y = j(m);
+  const y = z(m);
   if (!t.origin) {
-    const { origin: M } = at;
+    const { origin: M } = mt;
     Object.assign(t, { origin: M });
   }
-  const g = Oe(t), { origin: h } = t, u = { ...ut };
+  const g = Ee(t), { origin: f } = t, h = { ...ut };
   let x = [], p = 0, b = "", A = [];
   const d = [];
   if (!g.isIdentity) {
     for (s = 0, o = m.length; s < o; s += 1) {
-      x = m[s], m[s] && ([b] = x), d[s] = b, b === "A" && (x = ot(y[s], u), m[s] = ot(y[s], u), Mt(m, d, s), y[s] = ot(y[s], u), Mt(y, d, s), o = Math.max(m.length, y.length)), x = y[s], p = x.length, u.x1 = +x[p - 2], u.y1 = +x[p - 1], u.x2 = +x[p - 4] || u.x1, u.y2 = +x[p - 3] || u.y1;
+      x = m[s], m[s] && ([b] = x), d[s] = b, b === "A" && (x = ot(y[s], h), m[s] = ot(y[s], h), Mt(m, d, s), y[s] = ot(y[s], h), Mt(y, d, s), o = Math.max(m.length, y.length)), x = y[s], p = x.length, h.x1 = +x[p - 2], h.y1 = +x[p - 1], h.x2 = +x[p - 4] || h.x1, h.y2 = +x[p - 3] || h.y1;
       const M = {
         s: m[s],
         c: m[s][0],
-        x: u.x1,
-        y: u.y1
+        x: h.x1,
+        y: h.y1
       };
       A = [...A, M];
     }
     return A.map((M) => {
       if (b = M.c, x = M.s, b === "L" || b === "H" || b === "V")
-        return [l, c] = Ot(g, [M.x, M.y], h), n !== l && r !== c ? x = ["L", l, c] : r === c ? x = ["H", l] : n === l && (x = ["V", c]), n = l, r = c, x;
+        return [l, c] = Ot(g, [M.x, M.y], f), n !== l && r !== c ? x = ["L", l, c] : r === c ? x = ["H", l] : n === l && (x = ["V", c]), n = l, r = c, x;
       for (i = 1, a = x.length; i < a; i += 2)
-        [n, r] = Ot(g, [+x[i], +x[i + 1]], h), x[i] = n, x[i + 1] = r;
+        [n, r] = Ot(g, [+x[i], +x[i + 1]], f), x[i] = n, x[i + 1] = r;
       return x;
     });
   }
   return [...m];
-}, Ie = (e) => {
-  const n = e.slice(0, 2), r = e.slice(2, 4), s = e.slice(4, 6), i = e.slice(6, 8), o = I(n, r, 0.5), a = I(r, s, 0.5), l = I(s, i, 0.5), c = I(o, a, 0.5), m = I(a, l, 0.5), f = I(c, m, 0.5);
+}, ze = (e) => {
+  const n = e.slice(0, 2), r = e.slice(2, 4), s = e.slice(4, 6), i = e.slice(6, 8), o = j(n, r, 0.5), a = j(r, s, 0.5), l = j(s, i, 0.5), c = j(o, a, 0.5), m = j(a, l, 0.5), u = j(c, m, 0.5);
   return [
-    ["C", ...o, ...c, ...f],
+    ["C", ...o, ...c, ...u],
     ["C", ...m, ...l, ...i]
   ];
 };
@@ -1257,27 +1267,27 @@ class w {
   constructor(t, n) {
     const r = n || {}, s = typeof t > "u";
     if (s || !t.length)
-      throw TypeError(`${O}: "pathValue" is ${s ? "undefined" : "empty"}`);
-    const i = Q(t);
+      throw TypeError(`${k}: "pathValue" is ${s ? "undefined" : "empty"}`);
+    const i = Z(t);
     this.segments = i;
-    const { width: o, height: a, cx: l, cy: c, cz: m } = this.getBBox(), { round: f, origin: y } = r;
+    const { width: o, height: a, cx: l, cy: c, cz: m } = this.getBBox(), { round: u, origin: y } = r;
     let g;
-    if (f === "auto") {
-      const u = `${Math.floor(Math.max(o, a))}`.length;
-      g = u >= 4 ? 0 : 4 - u;
+    if (u === "auto") {
+      const h = `${Math.floor(Math.max(o, a))}`.length;
+      g = h >= 4 ? 0 : 4 - h;
     } else
-      Number.isInteger(f) || f === "off" ? g = f : g = at.round;
-    let h;
+      Number.isInteger(u) || u === "off" ? g = u : g = mt.round;
+    let f;
     if (Array.isArray(y) && y.length >= 2) {
-      const [u, x, p] = y.map(Number);
-      h = [
-        Number.isNaN(u) ? l : u,
+      const [h, x, p] = y.map(Number);
+      f = [
+        Number.isNaN(h) ? l : h,
         Number.isNaN(x) ? c : x,
         Number.isNaN(p) ? m : p
       ];
     } else
-      h = [l, c, m];
-    return this.round = g, this.origin = h, this;
+      f = [l, c, m];
+    return this.round = g, this.origin = f, this;
   }
   /**
    * Returns the path bounding box, equivalent to native `path.getBBox()`.
@@ -1286,7 +1296,7 @@ class w {
    * @returns the pathBBox
    */
   getBBox() {
-    return Lt(this.segments);
+    return kt(this.segments);
   }
   /**
    * Returns the total path length, equivalent to native `path.getTotalLength()`.
@@ -1295,7 +1305,7 @@ class w {
    * @returns the path total length
    */
   getTotalLength() {
-    return F(this.segments);
+    return X(this.segments);
   }
   /**
    * Returns an `{x,y}` point in the path stroke at a given length,
@@ -1306,7 +1316,7 @@ class w {
    * @returns the requested point
    */
   getPointAtLength(t) {
-    return W(this.segments, t);
+    return K(this.segments, t);
   }
   /**
    * Convert path to absolute values
@@ -1315,7 +1325,7 @@ class w {
    */
   toAbsolute() {
     const { segments: t } = this;
-    return this.segments = H(t), this;
+    return this.segments = Q(t), this;
   }
   /**
    * Convert path to relative values
@@ -1324,7 +1334,7 @@ class w {
    */
   toRelative() {
     const { segments: t } = this;
-    return this.segments = At(t), this;
+    return this.segments = Nt(t), this;
   }
   /**
    * Convert path to cubic-bezier values. In addition, un-necessary `Z`
@@ -1344,7 +1354,7 @@ class w {
    */
   reverse(t) {
     this.toAbsolute();
-    const { segments: n } = this, r = qt(n), s = r.length > 1 ? r : !1, i = s ? [...s].map((a, l) => t ? l ? it(a) : [...a] : it(a)) : [...n];
+    const { segments: n } = this, r = $t(n), s = r.length > 1 ? r : !1, i = s ? [...s].map((a, l) => t ? l ? it(a) : [...a] : it(a)) : [...n];
     let o = [];
     return s ? o = i.flat(1) : o = t ? n : it(n), this.segments = [...o], this;
   }
@@ -1357,7 +1367,7 @@ class w {
    */
   normalize() {
     const { segments: t } = this;
-    return this.segments = j(t), this;
+    return this.segments = z(t), this;
   }
   /**
    * Optimize `pathArray` values:
@@ -1369,7 +1379,7 @@ class w {
    */
   optimize() {
     const { segments: t } = this;
-    return this.segments = $t(t, this.round), this;
+    return this.segments = qt(t, this.round), this;
   }
   /**
    * Transform path using values from an `Object` defined as `transformObject`.
@@ -1394,7 +1404,7 @@ class w {
       o.origin = [Number.isNaN(l) ? r : l, Number.isNaN(c) ? s : c, m || i];
     } else
       o.origin = [r, s, i];
-    return this.segments = zt(n, o), this;
+    return this.segments = Et(n, o), this;
   }
   /**
    * Rotate path 180deg vertically
@@ -1420,11 +1430,11 @@ class w {
    * @return the path string
    */
   toString() {
-    return Z(this.segments, this.round);
+    return At(this.segments, this.round);
   }
 }
 // bring main utilities to front
-N(w, "CSSMatrix", v), N(w, "getPathBBox", Lt), N(w, "getPathArea", Kt), N(w, "getTotalLength", F), N(w, "getDrawDirection", Me), N(w, "getPointAtLength", W), N(w, "pathLengthFactory", ft), N(w, "getPropertiesAtLength", vt), N(w, "getPropertiesAtPoint", yt), N(w, "polygonLength", ce), N(w, "polygonArea", oe), N(w, "getClosestPoint", Ae), N(w, "getSegmentOfPoint", Ne), N(w, "getSegmentAtLength", we), N(w, "isPointInStroke", ve), N(w, "isValidPath", _t), N(w, "isPathArray", mt), N(w, "isAbsoluteArray", Nt), N(w, "isRelativeArray", Wt), N(w, "isCurveArray", Jt), N(w, "isNormalizedArray", wt), N(w, "shapeToPath", Se), N(w, "parsePathString", Q), N(w, "roundPath", lt), N(w, "splitPath", qt), N(w, "splitCubic", Ie), N(w, "optimizePath", $t), N(w, "reverseCurve", $e), N(w, "reversePath", it), N(w, "normalizePath", j), N(w, "transformPath", zt), N(w, "pathToAbsolute", H), N(w, "pathToRelative", At), N(w, "pathToCurve", ct), N(w, "pathToString", Z);
+N(w, "CSSMatrix", v), N(w, "getPathBBox", kt), N(w, "getPathArea", Vt), N(w, "getTotalLength", X), N(w, "getDrawDirection", Ae), N(w, "getPointAtLength", K), N(w, "pathLengthFactory", ft), N(w, "getPropertiesAtLength", Pt), N(w, "getPropertiesAtPoint", yt), N(w, "polygonLength", le), N(w, "polygonArea", ce), N(w, "getClosestPoint", Ne), N(w, "getSegmentOfPoint", we), N(w, "getSegmentAtLength", ve), N(w, "isPointInStroke", Pe), N(w, "isValidPath", Kt), N(w, "isPathArray", _), N(w, "isAbsoluteArray", wt), N(w, "isRelativeArray", _t), N(w, "isCurveArray", Jt), N(w, "isNormalizedArray", vt), N(w, "shapeToPath", $e), N(w, "shapeToPathArray", Wt), N(w, "parsePathString", Z), N(w, "roundPath", at), N(w, "splitPath", $t), N(w, "splitCubic", ze), N(w, "optimizePath", qt), N(w, "reverseCurve", Oe), N(w, "reversePath", it), N(w, "normalizePath", z), N(w, "transformPath", Et), N(w, "pathToAbsolute", Q), N(w, "pathToRelative", Nt), N(w, "pathToCurve", ct), N(w, "pathToString", At);
 export {
   w as default
 };