svg-path-commander 2.0.1 → 2.0.3

package/dist/svg-path-commander.mjs

@@ -1,7 +1,10 @@
+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 at = {
   origin: [0, 0, 0],
   round: 4
-}, q = "SVGPathCommander Error", B = {
+}, O = "SVGPathCommander Error", K = {
   a: 7,
   c: 6,
   h: 1,
@@ -13,12 +16,12 @@ const at = {
   t: 2,
   v: 1,
   z: 0
-}, vt = (e) => {
+}, Tt = (e) => {
   let t = e.pathValue[e.segmentStart], n = t.toLowerCase();
   const { data: r } = e;
-  for (; r.length >= B[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, B[n])]), !!B[n]); )
+  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]); )
     ;
-}, Kt = (e) => {
+}, ee = (e) => {
   const { index: t, pathValue: n } = e, r = n.charCodeAt(t);
   if (r === 48) {
     e.param = 0, e.index += 1;
@@ -28,47 +31,47 @@ const at = {
     e.param = 1, e.index += 1;
     return;
   }
-  e.err = `${q}: invalid Arc flag "${n[t]}", expecting 0 or 1 at index ${t}`;
-}, I = (e) => e >= 48 && e <= 57, D = "Invalid path value", _t = (e) => {
+  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", ne = (e) => {
   const { max: t, pathValue: n, index: r } = e;
-  let s = r, i = !1, o = !1, l = !1, c = !1, a;
+  let s = r, i = !1, o = !1, a = !1, l = !1, c;
   if (s >= t) {
-    e.err = `${q}: ${D} at index ${s}, "pathValue" is missing param`;
+    e.err = `${O}: ${X} at index ${s}, "pathValue" is missing param`;
     return;
   }
-  if (a = n.charCodeAt(s), (a === 43 || a === 45) && (s += 1, a = n.charCodeAt(s)), !I(a) && a !== 46) {
-    e.err = `${q}: ${D} at index ${s}, "${n[s]}" is not a number`;
+  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`;
     return;
   }
-  if (a !== 46) {
-    if (i = a === 48, s += 1, a = n.charCodeAt(s), i && s < t && a && I(a)) {
-      e.err = `${q}: ${D} at index ${r}, "${n[r]}" illegal number`;
+  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`;
       return;
     }
-    for (; s < t && I(n.charCodeAt(s)); )
+    for (; s < t && D(n.charCodeAt(s)); )
       s += 1, o = !0;
-    a = n.charCodeAt(s);
+    c = n.charCodeAt(s);
   }
-  if (a === 46) {
-    for (c = !0, s += 1; I(n.charCodeAt(s)); )
-      s += 1, l = !0;
-    a = n.charCodeAt(s);
+  if (c === 46) {
+    for (l = !0, s += 1; D(n.charCodeAt(s)); )
+      s += 1, a = !0;
+    c = n.charCodeAt(s);
   }
-  if (a === 101 || a === 69) {
-    if (c && !o && !l) {
-      e.err = `${q}: ${D} at index ${s}, "${n[s]}" invalid float exponent`;
+  if (c === 101 || c === 69) {
+    if (l && !o && !a) {
+      e.err = `${O}: ${X} at index ${s}, "${n[s]}" invalid float exponent`;
       return;
     }
-    if (s += 1, a = n.charCodeAt(s), (a === 43 || a === 45) && (s += 1), s < t && I(n.charCodeAt(s)))
-      for (; s < t && I(n.charCodeAt(s)); )
+    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 = `${q}: ${D} at index ${s}, "${n[s]}" invalid integer exponent`;
+      e.err = `${O}: ${X} at index ${s}, "${n[s]}" invalid integer exponent`;
       return;
     }
   }
   e.index = s, e.param = +e.pathValue.slice(r, s);
-}, Wt = (e) => [
+}, se = (e) => [
   // Special spaces
   5760,
   6158,
@@ -98,11 +101,11 @@ const at = {
   11,
   12,
   160
-].includes(e), G = (e) => {
+].includes(e), _ = (e) => {
   const { pathValue: t, max: n } = e;
-  for (; e.index < n && Wt(t.charCodeAt(e.index)); )
+  for (; e.index < n && se(t.charCodeAt(e.index)); )
     e.index += 1;
-}, te = (e) => {
+}, re = (e) => {
   switch (e | 32) {
     case 109:
     case 122:
@@ -118,136 +121,136 @@ const at = {
     default:
       return !1;
   }
-}, ee = (e) => I(e) || e === 43 || e === 45 || e === 46, ne = (e) => (e | 32) === 97, Ot = (e) => {
-  const { max: t, pathValue: n, index: r } = e, s = n.charCodeAt(r), i = B[n[r].toLowerCase()];
-  if (e.segmentStart = r, !te(s)) {
-    e.err = `${q}: ${D} "${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 = K[n[r].toLowerCase()];
+  if (e.segmentStart = r, !re(s)) {
+    e.err = `${O}: ${X} "${n[r]}" is not a path command`;
     return;
   }
-  if (e.index += 1, G(e), e.data = [], !i) {
-    vt(e);
+  if (e.index += 1, _(e), e.data = [], !i) {
+    Tt(e);
     return;
   }
   for (; ; ) {
     for (let o = i; o > 0; o -= 1) {
-      if (ne(s) && (o === 3 || o === 4) ? Kt(e) : _t(e), e.err.length)
+      if (oe(s) && (o === 3 || o === 4) ? ee(e) : ne(e), e.err.length)
         return;
-      e.data.push(e.param), G(e), e.index < t && n.charCodeAt(e.index) === 44 && (e.index += 1, G(e));
+      e.data.push(e.param), _(e), e.index < t && n.charCodeAt(e.index) === 44 && (e.index += 1, _(e));
     }
-    if (e.index >= e.max || !ee(n.charCodeAt(e.index)))
+    if (e.index >= e.max || !ie(n.charCodeAt(e.index)))
       break;
   }
-  vt(e);
+  Tt(e);
 };
-class zt {
+class Et {
   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 ct = (e) => Array.isArray(e) && e.every((t) => {
+const mt = (e) => Array.isArray(e) && e.every((t) => {
   const n = t[0].toLowerCase();
-  return B[n] === t.length - 1 && "achlmqstvz".includes(n);
-}), R = (e) => {
-  if (ct(e))
+  return K[n] === t.length - 1 && "achlmqstvz".includes(n);
+}), Q = (e) => {
+  if (mt(e))
     return [...e];
-  const t = new zt(e);
-  for (G(t); t.index < t.max && !t.err.length; )
-    Ot(t);
+  const t = new Et(e);
+  for (_(t); t.index < t.max && !t.err.length; )
+    jt(t);
   if (t.err && t.err.length)
     throw TypeError(t.err);
   return t.segments;
-}, se = (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;
-}, U = (e, t) => Math.sqrt((e[0] - t[0]) * (e[0] - t[0]) + (e[1] - t[1]) * (e[1] - t[1])), re = (e) => e.reduce((t, n, r) => r ? t + U(e[r - 1], n) : 0, 0);
-var ie = Object.defineProperty, oe = (e, t, n) => t in e ? ie(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n, C = (e, t, n) => (oe(e, typeof t != "symbol" ? t + "" : t, n), n);
-const ae = { a: 1, b: 0, c: 0, d: 1, e: 0, f: 0, m11: 1, m12: 0, m13: 0, m14: 0, m21: 0, m22: 1, m23: 0, m24: 0, m31: 0, m32: 0, m33: 1, m34: 0, m41: 0, m42: 0, m43: 0, m44: 1, is2D: !0, isIdentity: !0 }, It = (e) => (e instanceof Float64Array || e instanceof Float32Array || Array.isArray(e) && e.every((t) => typeof t == "number")) && [6, 16].some((t) => e.length === t), jt = (e) => e instanceof DOMMatrix || e instanceof N || typeof e == "object" && Object.keys(ae).every((t) => e && t in e), K = (e) => {
-  const t = new N(), n = Array.from(e);
-  if (!It(n))
+}, V = (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 + V(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, d: 1, e: 0, f: 0, m11: 1, m12: 0, m13: 0, m14: 0, m21: 0, m22: 1, m23: 0, m24: 0, m31: 0, m32: 0, m33: 1, m34: 0, m41: 0, m42: 0, m43: 0, m44: 1, is2D: !0, isIdentity: !0 }, Dt = (e) => (e instanceof Float64Array || e instanceof Float32Array || Array.isArray(e) && e.every((t) => typeof t == "number")) && [6, 16].some((t) => e.length === t), Zt = (e) => e instanceof DOMMatrix || e instanceof w || typeof e == "object" && Object.keys(he).every((t) => e && t in e), G = (e) => {
+  const t = new w(), n = Array.from(e);
+  if (!Dt(n))
     throw TypeError(`CSSMatrix: "${n.join(",")}" must be an array with 6/16 numbers.`);
   if (n.length === 16) {
-    const [r, s, i, o, l, c, a, m, f, y, g, h, u, x, d, p] = n;
-    t.m11 = r, t.a = r, t.m21 = l, t.c = l, t.m31 = f, t.m41 = u, t.e = u, t.m12 = s, t.b = s, t.m22 = c, t.d = c, t.m32 = y, t.m42 = x, t.f = x, t.m13 = i, t.m23 = a, t.m33 = g, t.m43 = d, t.m14 = o, t.m24 = m, t.m34 = h, t.m44 = p;
+    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;
   } else if (n.length === 6) {
-    const [r, s, i, o, l, c] = 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 = l, t.e = l, t.m42 = c, t.f = c;
+    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;
   }
   return t;
-}, Et = (e) => {
-  if (jt(e))
-    return K([e.m11, e.m12, e.m13, e.m14, e.m21, e.m22, e.m23, e.m24, e.m31, e.m32, e.m33, e.m34, e.m41, e.m42, e.m43, e.m44]);
+}, Rt = (e) => {
+  if (Zt(e))
+    return G([e.m11, e.m12, e.m13, e.m14, e.m21, e.m22, e.m23, e.m24, e.m31, e.m32, e.m33, e.m34, e.m41, e.m42, e.m43, e.m44]);
   throw TypeError(`CSSMatrix: "${JSON.stringify(e)}" is not a DOMMatrix / CSSMatrix / JSON compatible object.`);
-}, Dt = (e) => {
+}, Xt = (e) => {
   if (typeof e != "string")
     throw TypeError(`CSSMatrix: "${JSON.stringify(e)}" is not a string.`);
   const t = String(e).replace(/\s/g, "");
-  let n = new N();
+  let n = new w();
   const r = `CSSMatrix: invalid transform string "${e}"`;
   return t.split(")").filter((s) => s).forEach((s) => {
     const [i, o] = s.split("(");
     if (!o)
       throw TypeError(r);
-    const l = o.split(",").map((h) => h.includes("rad") ? parseFloat(h) * (180 / Math.PI) : parseFloat(h)), [c, a, m, f] = l, y = [c, a, m], g = [c, a, m, f];
-    if (i === "perspective" && c && [a, m].every((h) => h === void 0))
-      n.m34 = -1 / c;
-    else if (i.includes("matrix") && [6, 16].includes(l.length) && l.every((h) => !Number.isNaN(+h))) {
-      const h = l.map((u) => Math.abs(u) < 1e-6 ? 0 : u);
-      n = n.multiply(K(h));
+    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))
+      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)))
-      n = n.translate(c, a, m);
-    else if (i === "translate" && c && m === void 0)
-      n = n.translate(c, a || 0, 0);
+      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(c, a, m, f);
-    else if (i === "rotate" && c && [a, m].every((h) => h === void 0))
-      n = n.rotate(0, 0, c);
+      n = n.rotateAxisAngle(l, c, m, f);
+    else if (i === "rotate" && l && [c, m].every((h) => h === void 0))
+      n = n.rotate(0, 0, l);
     else if (i === "scale3d" && y.every((h) => !Number.isNaN(+h)) && y.some((h) => h !== 1))
-      n = n.scale(c, a, m);
-    else if (i === "scale" && !Number.isNaN(c) && c !== 1 && m === void 0) {
-      const h = Number.isNaN(+a) ? c : a;
-      n = n.scale(c, h, 1);
-    } else if (i === "skew" && (c || !Number.isNaN(c) && a) && m === void 0)
-      n = n.skew(c, a || 0);
-    else if (["translate", "rotate", "scale", "skew"].some((h) => i.includes(h)) && /[XYZ]/.test(i) && c && [a, m].every((h) => h === void 0))
+      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);
+    } 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))
       if (i === "skewX" || i === "skewY")
-        n = n[i](c);
+        n = n[i](l);
       else {
-        const h = i.replace(/[XYZ]/, ""), u = i.replace(h, ""), x = ["X", "Y", "Z"].indexOf(u), d = h === "scale" ? 1 : 0, p = [x === 0 ? c : d, x === 1 ? c : d, x === 2 ? c : d];
-        n = n[h](...p);
+        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);
       }
     else
       throw TypeError(r);
   }), n;
-}, xt = (e, t) => t ? [e.a, e.b, e.c, e.d, e.e, e.f] : [e.m11, e.m12, e.m13, e.m14, e.m21, e.m22, e.m23, e.m24, e.m31, e.m32, e.m33, e.m34, e.m41, e.m42, e.m43, e.m44], Zt = (e, t, n) => {
-  const r = new N();
+}, bt = (e, t) => t ? [e.a, e.b, e.c, e.d, e.e, e.f] : [e.m11, e.m12, e.m13, e.m14, e.m21, e.m22, e.m23, e.m24, e.m31, e.m32, e.m33, e.m34, e.m41, e.m42, e.m43, e.m44], Ft = (e, t, n) => {
+  const r = new w();
   return r.m41 = e, r.e = e, r.m42 = t, r.f = t, r.m43 = n, r;
-}, Rt = (e, t, n) => {
-  const r = new N(), s = Math.PI / 180, i = e * s, o = t * s, l = n * s, c = Math.cos(i), a = -Math.sin(i), m = Math.cos(o), f = -Math.sin(o), y = Math.cos(l), g = -Math.sin(l), h = m * y, u = -m * g;
+}, Qt = (e, t, n) => {
+  const r = new w(), 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 = a * f * y + c * g;
+  const x = c * f * y + l * g;
   r.m21 = x, r.c = x;
-  const d = c * y - a * f * g;
-  return r.m22 = d, r.d = d, r.m23 = -a * m, r.m31 = a * g - c * f * y, r.m32 = a * y + c * f * g, r.m33 = c * m, r;
-}, Xt = (e, t, n, r) => {
-  const s = new N(), i = Math.sqrt(e * e + t * t + n * n);
+  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;
+}, Ht = (e, t, n, r) => {
+  const s = new w(), i = Math.sqrt(e * e + t * t + n * n);
   if (i === 0)
     return s;
-  const o = e / i, l = t / i, c = n / i, a = r * (Math.PI / 360), m = Math.sin(a), f = Math.cos(a), y = m * m, g = o * o, h = l * l, u = c * c, 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), f = Math.cos(c), y = m * m, g = o * o, h = a * a, u = l * l, x = 1 - 2 * (h + u) * y;
   s.m11 = x, s.a = x;
-  const d = 2 * (o * l * y + c * m * f);
-  s.m12 = d, s.b = d, s.m13 = 2 * (o * c * y - l * m * f);
-  const p = 2 * (l * o * y - c * m * f);
-  s.m21 = p, s.c = p;
+  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);
+  s.m21 = b, s.c = b;
   const A = 1 - 2 * (u + g) * y;
-  return s.m22 = A, s.d = A, s.m23 = 2 * (l * c * y + o * m * f), s.m31 = 2 * (c * o * y + l * m * f), s.m32 = 2 * (c * l * y - o * m * f), s.m33 = 1 - 2 * (g + h) * y, s;
-}, Ft = (e, t, n) => {
-  const r = new N();
+  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;
+}, Yt = (e, t, n) => {
+  const r = new w();
   return r.m11 = e, r.a = e, r.m22 = t, r.d = t, r.m33 = n, r;
-}, lt = (e, t) => {
-  const n = new N();
+}, ht = (e, t) => {
+  const n = new w();
   if (e) {
     const r = e * Math.PI / 180, s = Math.tan(r);
     n.m21 = s, n.c = s;
@@ -257,11 +260,11 @@ const ae = { a: 1, b: 0, c: 0, d: 1, e: 0, f: 0, m11: 1, m12: 0, m13: 0, m14: 0,
     n.m12 = s, n.b = s;
   }
   return n;
-}, Qt = (e) => lt(e, 0), Ht = (e) => lt(0, e), k = (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, l = t.m21 * e.m12 + t.m22 * e.m22 + t.m23 * e.m32 + t.m24 * e.m42, c = t.m21 * e.m13 + t.m22 * e.m23 + t.m23 * e.m33 + t.m24 * e.m43, a = 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, d = t.m41 * e.m14 + t.m42 * e.m24 + t.m43 * e.m34 + t.m44 * e.m44;
-  return K([n, r, s, i, o, l, c, a, m, f, y, g, h, u, x, d]);
+}, Bt = (e) => ht(e, 0), Jt = (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]);
 };
-class N {
+class w {
   constructor(t) {
     return this.a = 1, this.b = 0, this.c = 0, this.d = 1, this.e = 0, this.f = 0, this.m11 = 1, this.m12 = 0, this.m13 = 0, this.m14 = 0, this.m21 = 0, this.m22 = 1, this.m23 = 0, this.m24 = 0, this.m31 = 0, this.m32 = 0, this.m33 = 1, this.m34 = 0, this.m41 = 0, this.m42 = 0, this.m43 = 0, this.m44 = 1, t ? this.setMatrixValue(t) : this;
   }
@@ -272,13 +275,13 @@ class N {
     return this.m31 === 0 && this.m32 === 0 && this.m33 === 1 && this.m34 === 0 && this.m43 === 0 && this.m44 === 1;
   }
   setMatrixValue(t) {
-    return typeof t == "string" && t.length && t !== "none" ? Dt(t) : Array.isArray(t) || t instanceof Float64Array || t instanceof Float32Array ? K(t) : typeof t == "object" ? Et(t) : this;
+    return typeof t == "string" && t.length && t !== "none" ? Xt(t) : Array.isArray(t) || t instanceof Float64Array || t instanceof Float32Array ? G(t) : typeof t == "object" ? Rt(t) : this;
   }
   toFloat32Array(t) {
-    return Float32Array.from(xt(this, t));
+    return Float32Array.from(bt(this, t));
   }
   toFloat64Array(t) {
-    return Float64Array.from(xt(this, t));
+    return Float64Array.from(bt(this, t));
   }
   toString() {
     const { is2D: t } = this, n = this.toFloat64Array(t).join(", ");
@@ -289,103 +292,103 @@ class N {
     return { ...this, is2D: t, isIdentity: n };
   }
   multiply(t) {
-    return k(this, t);
+    return $(this, t);
   }
   translate(t, n, r) {
     const s = t;
     let i = n, o = r;
-    return typeof i > "u" && (i = 0), typeof o > "u" && (o = 0), k(this, Zt(s, i, o));
+    return typeof i > "u" && (i = 0), typeof o > "u" && (o = 0), $(this, Ft(s, i, o));
   }
   scale(t, n, r) {
     const s = t;
     let i = n, o = r;
-    return typeof i > "u" && (i = t), typeof o > "u" && (o = 1), k(this, Ft(s, i, o));
+    return typeof i > "u" && (i = t), typeof o > "u" && (o = 1), $(this, Yt(s, i, o));
   }
   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), k(this, Rt(s, i, o));
+    return typeof t == "number" && typeof n > "u" && typeof r > "u" && (o = s, s = 0, i = 0), $(this, Qt(s, i, o));
   }
   rotateAxisAngle(t, n, r, s) {
     if ([t, n, r, s].some((i) => Number.isNaN(+i)))
       throw new TypeError("CSSMatrix: expecting 4 values");
-    return k(this, Xt(t, n, r, s));
+    return $(this, Ht(t, n, r, s));
   }
   skewX(t) {
-    return k(this, Qt(t));
+    return $(this, Bt(t));
   }
   skewY(t) {
-    return k(this, Ht(t));
+    return $(this, Jt(t));
   }
   skew(t, n) {
-    return k(this, lt(t, n));
+    return $(this, ht(t, n));
   }
   transformPoint(t) {
     const n = this.m11 * t.x + this.m21 * t.y + this.m31 * t.z + this.m41 * t.w, r = this.m12 * t.x + this.m22 * t.y + this.m32 * t.z + this.m42 * t.w, s = this.m13 * t.x + this.m23 * t.y + this.m33 * t.z + this.m43 * t.w, i = this.m14 * t.x + this.m24 * t.y + this.m34 * t.z + this.m44 * t.w;
     return t instanceof DOMPoint ? new DOMPoint(n, r, s, i) : { x: n, y: r, z: s, w: i };
   }
 }
-C(N, "Translate", Zt), C(N, "Rotate", Rt), C(N, "RotateAxisAngle", Xt), C(N, "Scale", Ft), C(N, "SkewX", Qt), C(N, "SkewY", Ht), C(N, "Skew", lt), C(N, "Multiply", k), C(N, "fromArray", K), C(N, "fromMatrix", Et), C(N, "fromString", Dt), C(N, "toArray", xt), C(N, "isCompatibleArray", It), C(N, "isCompatibleObject", jt);
-var Mt = N;
-const At = (e) => ct(e) && // `isPathArray` also checks if it's `Array`
-e.every(([t]) => t === t.toUpperCase()), X = (e) => {
-  if (At(e))
+C(w, "Translate", Ft), C(w, "Rotate", Qt), C(w, "RotateAxisAngle", Ht), C(w, "Scale", Yt), C(w, "SkewX", Bt), C(w, "SkewY", Jt), C(w, "Skew", ht), C(w, "Multiply", $), C(w, "fromArray", G), C(w, "fromMatrix", Rt), C(w, "fromString", Xt), C(w, "toArray", bt), C(w, "isCompatibleArray", Dt), C(w, "isCompatibleObject", Zt);
+var Nt = w;
+const vt = (e) => mt(e) && // `isPathArray` also checks if it's `Array`
+e.every(([t]) => t === t.toUpperCase()), H = (e) => {
+  if (vt(e))
     return [...e];
-  const t = R(e);
+  const t = Q(e);
   let n = 0, r = 0, s = 0, i = 0;
   return t.map((o) => {
-    const l = o.slice(1).map(Number), [c] = o, a = c.toUpperCase();
-    if (c === "M")
-      return [n, r] = l, s = n, i = r, ["M", n, r];
+    const a = o.slice(1).map(Number), [l] = o, c = l.toUpperCase();
+    if (l === "M")
+      return [n, r] = a, s = n, i = r, ["M", n, r];
     let m = [];
-    if (c !== a)
-      if (a === "A")
+    if (l !== c)
+      if (c === "A")
         m = [
-          a,
-          l[0],
-          l[1],
-          l[2],
-          l[3],
-          l[4],
-          l[5] + n,
-          l[6] + r
+          c,
+          a[0],
+          a[1],
+          a[2],
+          a[3],
+          a[4],
+          a[5] + n,
+          a[6] + r
         ];
-      else if (a === "V")
-        m = [a, l[0] + r];
-      else if (a === "H")
-        m = [a, l[0] + n];
+      else if (c === "V")
+        m = [c, a[0] + r];
+      else if (c === "H")
+        m = [c, a[0] + n];
       else {
-        const f = l.map((y, g) => y + (g % 2 ? r : n));
-        m = [a, ...f];
+        const f = a.map((y, g) => y + (g % 2 ? r : n));
+        m = [c, ...f];
       }
     else
-      m = [a, ...l];
-    return a === "Z" ? (n = s, r = i) : a === "H" ? [, n] = m : a === "V" ? [, r] = m : ([n, r] = m.slice(-2), a === "M" && (s = n, i = r)), m;
+      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;
   });
-}, ce = (e, t) => {
-  const [n] = e, { x1: r, y1: s, x2: i, y2: o } = t, l = e.slice(1).map(Number);
-  let c = e;
+}, 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")
-    c = ["L", e[1], s];
+    l = ["L", e[1], s];
   else if (n === "V")
-    c = ["L", r, e[1]];
+    l = ["L", r, e[1]];
   else if (n === "S") {
-    const a = r * 2 - i, m = s * 2 - o;
-    t.x1 = a, t.y1 = m, c = ["C", a, m, ...l];
+    const c = r * 2 - i, m = s * 2 - o;
+    t.x1 = c, t.y1 = m, l = ["C", c, m, ...a];
   } else if (n === "T") {
-    const a = r * 2 - (t.qx ? t.qx : (
+    const c = r * 2 - (t.qx ? t.qx : (
       /* istanbul ignore next */
       0
     )), m = s * 2 - (t.qy ? t.qy : (
       /* istanbul ignore next */
       0
     ));
-    t.qx = a, t.qy = m, c = ["Q", a, m, ...l];
+    t.qx = c, t.qy = m, l = ["Q", c, m, ...a];
   } else if (n === "Q") {
-    const [a, m] = l;
-    t.qx = a, t.qy = m;
+    const [c, m] = a;
+    t.qx = c, t.qy = m;
   }
-  return c;
-}, Nt = (e) => At(e) && e.every(([t]) => "ACLMQZ".includes(t)), mt = {
+  return l;
+}, wt = (e) => vt(e) && e.every(([t]) => "ACLMQZ".includes(t)), ut = {
   x1: 0,
   y1: 0,
   x2: 0,
@@ -394,21 +397,21 @@ e.every(([t]) => t === t.toUpperCase()), X = (e) => {
   y: 0,
   qx: null,
   qy: null
-}, O = (e) => {
-  if (Nt(e))
+}, j = (e) => {
+  if (wt(e))
     return [...e];
-  const t = X(e), n = { ...mt }, r = t.length;
+  const t = H(e), n = { ...ut }, r = t.length;
   for (let s = 0; s < r; s += 1) {
-    t[s], t[s] = ce(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;
-}, V = (e, t, n) => {
+}, I = (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 = U([e, t], [n, r]);
+  const i = V([e, t], [n, r]);
   let o = { x: 0, y: 0 };
   if (typeof s == "number")
     if (s <= 0)
@@ -416,8 +419,8 @@ e.every(([t]) => t === t.toUpperCase()), X = (e) => {
     else if (s >= i)
       o = { x: n, y: r };
     else {
-      const [l, c] = V([e, t], [n, r], s / i);
-      o = { x: l, y: c };
+      const [a, l] = I([e, t], [n, r], s / i);
+      o = { x: a, y: l };
     }
   return {
     length: i,
@@ -431,171 +434,171 @@ e.every(([t]) => t === t.toUpperCase()), X = (e) => {
       y: Math.max(t, r)
     }
   };
-}, wt = (e, t) => {
-  const { x: n, y: r } = e, { x: s, y: i } = t, o = n * s + r * i, l = Math.sqrt((n ** 2 + r ** 2) * (s ** 2 + i ** 2));
-  return (n * i - r * s < 0 ? -1 : 1) * Math.acos(o / l);
-}, le = (e, t, n, r, s, i, o, l, c, a) => {
+}, 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);
+}, fe = (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 p = (s % 360 + 360) % 360 * (h / 180);
-  if (e === l && t === c)
+  const b = (s % 360 + 360) % 360 * (h / 180);
+  if (e === a && t === l)
     return { x: e, y: t };
   if (u === 0 || x === 0)
-    return dt(e, t, l, c, a).point;
-  const A = (e - l) / 2, b = (t - c) / 2, M = {
-    x: y(p) * A + f(p) * b,
-    y: -f(p) * A + y(p) * b
-  }, v = M.x ** 2 / u ** 2 + M.y ** 2 / x ** 2;
-  v > 1 && (u *= g(v), x *= g(v));
-  const $ = u ** 2 * x ** 2 - u ** 2 * M.y ** 2 - x ** 2 * M.x ** 2, F = u ** 2 * M.y ** 2 + x ** 2 * M.x ** 2;
-  let E = $ / F;
-  E = E < 0 ? 0 : E;
-  const _ = (i !== o ? 1 : -1) * g(E), S = {
-    x: _ * (u * M.y / x),
-    y: _ * (-(x * M.x) / u)
-  }, W = {
-    x: y(p) * S.x - f(p) * S.y + (e + l) / 2,
-    y: f(p) * S.x + y(p) * S.y + (t + c) / 2
-  }, Q = {
-    x: (M.x - S.x) / u,
-    y: (M.y - S.y) / x
-  }, tt = wt({ x: 1, y: 0 }, Q), et = {
-    x: (-M.x - S.x) / u,
-    y: (-M.y - S.y) / x
+    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)
+  }, 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 = Lt({ x: 1, y: 0 }, B), st = {
+    x: (-M.x - k.x) / u,
+    y: (-M.y - k.y) / x
   };
-  let T = wt(Q, et);
-  !o && T > 0 ? T -= 2 * h : o && T < 0 && (T += 2 * h), T %= 2 * h;
-  const L = tt + T * a, H = u * y(L), Y = x * f(L);
+  let S = Lt(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);
   return {
-    x: y(p) * H - f(p) * Y + W.x,
-    y: f(p) * H + y(p) * Y + W.y
+    x: y(b) * J - f(b) * U + et.x,
+    y: f(b) * J + y(b) * U + et.y
   };
-}, me = (e, t, n, r, s, i, o, l, c, a) => {
-  const m = typeof a == "number";
-  let f = e, y = t, g = 0, h = [f, y, g], u = [f, y], x = 0, d = { x: 0, y: 0 }, p = [{ x: f, y }];
-  m && a <= 0 && (d = { x: f, y });
+}, 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 });
   const A = 300;
-  for (let b = 0; b <= A; b += 1) {
-    if (x = b / A, { x: f, y } = le(e, t, n, r, s, i, o, l, c, x), p = [...p, { x: f, y }], g += U(u, [f, y]), u = [f, y], m && g > a && a > h[2]) {
-      const M = (g - a) / (g - h[2]);
-      d = {
+  for (let d = 0; d <= A; d += 1) {
+    if (x = d / A, { x: f, y } = fe(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]);
+      p = {
         x: u[0] * (1 - M) + h[0] * M,
         y: u[1] * (1 - M) + h[1] * M
       };
     }
     h = [f, y, g];
   }
-  return m && a >= g && (d = { x: l, y: c }), {
+  return m && c >= g && (p = { x: a, y: l }), {
     length: g,
-    point: d,
+    point: p,
     min: {
-      x: Math.min(...p.map((b) => b.x)),
-      y: Math.min(...p.map((b) => b.y))
+      x: Math.min(...b.map((d) => d.x)),
+      y: Math.min(...b.map((d) => d.y))
     },
     max: {
-      x: Math.max(...p.map((b) => b.x)),
-      y: Math.max(...p.map((b) => b.y))
+      x: Math.max(...b.map((d) => d.x)),
+      y: Math.max(...b.map((d) => d.y))
     }
   };
-}, he = (e, t, n, r, s, i, o, l, c) => {
-  const a = 1 - c;
+}, ge = (e, t, n, r, s, i, o, a, l) => {
+  const c = 1 - l;
   return {
-    x: a ** 3 * e + 3 * a ** 2 * c * n + 3 * a * c ** 2 * s + c ** 3 * o,
-    y: a ** 3 * t + 3 * a ** 2 * c * r + 3 * a * c ** 2 * i + c ** 3 * l
+    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
   };
-}, ue = (e, t, n, r, s, i, o, l, c) => {
-  const a = typeof c == "number";
-  let m = e, f = t, y = 0, g = [m, f, y], h = [m, f], u = 0, x = { x: 0, y: 0 }, d = [{ x: m, y: f }];
-  a && c <= 0 && (x = { x: m, y: f });
-  const p = 300;
-  for (let A = 0; A <= p; A += 1) {
-    if (u = A / p, { x: m, y: f } = he(e, t, n, r, s, i, o, l, u), d = [...d, { x: m, y: f }], y += U(h, [m, f]), h = [m, f], a && y > c && c > g[2]) {
-      const b = (y - c) / (y - g[2]);
+}, 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 });
+  const b = 300;
+  for (let A = 0; A <= b; A += 1) {
+    if (u = A / b, { x: m, y: f } = ge(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]) {
+      const d = (y - l) / (y - g[2]);
       x = {
-        x: h[0] * (1 - b) + g[0] * b,
-        y: h[1] * (1 - b) + g[1] * b
+        x: h[0] * (1 - d) + g[0] * d,
+        y: h[1] * (1 - d) + g[1] * d
       };
     }
     g = [m, f, y];
   }
-  return a && c >= y && (x = { x: o, y: l }), {
+  return c && l >= y && (x = { x: o, y: a }), {
     length: y,
     point: x,
     min: {
-      x: Math.min(...d.map((A) => A.x)),
-      y: Math.min(...d.map((A) => A.y))
+      x: Math.min(...p.map((A) => A.x)),
+      y: Math.min(...p.map((A) => A.y))
     },
     max: {
-      x: Math.max(...d.map((A) => A.x)),
-      y: Math.max(...d.map((A) => A.y))
+      x: Math.max(...p.map((A) => A.x)),
+      y: Math.max(...p.map((A) => A.y))
     }
   };
-}, fe = (e, t, n, r, s, i, o) => {
-  const l = 1 - o;
+}, pe = (e, t, n, r, s, i, o) => {
+  const a = 1 - o;
   return {
-    x: l ** 2 * e + 2 * l * o * n + o ** 2 * s,
-    y: l ** 2 * t + 2 * l * o * r + o ** 2 * i
+    x: a ** 2 * e + 2 * a * o * n + o ** 2 * s,
+    y: a ** 2 * t + 2 * a * o * r + o ** 2 * i
   };
-}, ye = (e, t, n, r, s, i, o) => {
-  const l = typeof o == "number";
-  let c = e, a = t, m = 0, f = [c, a, m], y = [c, a], g = 0, h = { x: 0, y: 0 }, u = [{ x: c, y: a }];
-  l && o <= 0 && (h = { x: c, y: a });
+}, 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 });
   const x = 300;
-  for (let d = 0; d <= x; d += 1) {
-    if (g = d / x, { x: c, y: a } = fe(e, t, n, r, s, i, g), u = [...u, { x: c, y: a }], m += U(y, [c, a]), y = [c, a], l && m > o && o > f[2]) {
-      const p = (m - o) / (m - f[2]);
+  for (let p = 0; p <= x; p += 1) {
+    if (g = p / x, { x: l, y: c } = pe(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 - p) + f[0] * p,
-        y: y[1] * (1 - p) + f[1] * p
+        x: y[0] * (1 - b) + f[0] * b,
+        y: y[1] * (1 - b) + f[1] * b
       };
     }
-    f = [c, a, m];
+    f = [l, c, m];
   }
-  return l && o >= m && (h = { x: s, y: i }), {
+  return a && o >= m && (h = { x: s, y: i }), {
     length: m,
     point: h,
     min: {
-      x: Math.min(...u.map((d) => d.x)),
-      y: Math.min(...u.map((d) => d.y))
+      x: Math.min(...u.map((p) => p.x)),
+      y: Math.min(...u.map((p) => p.y))
     },
     max: {
-      x: Math.max(...u.map((d) => d.x)),
-      y: Math.max(...u.map((d) => d.y))
+      x: Math.max(...u.map((p) => p.x)),
+      y: Math.max(...u.map((p) => p.y))
     }
   };
-}, ht = (e, t) => {
-  const n = O(e), r = typeof t == "number";
-  let s, i = [], o, l = 0, c = 0, a = 0, m = 0, f, y = [], g = [], h = 0, u = { x: 0, y: 0 }, x = u, d = u, p = u, A = 0;
-  for (let b = 0, M = n.length; b < M; b += 1)
-    f = n[b], [o] = f, s = o === "M", i = s ? i : [l, c, ...f.slice(1)], s ? ([, a, m] = f, u = { x: a, y: m }, x = u, h = 0, r && t < 1e-3 && (p = u)) : o === "L" ? { length: h, min: u, max: x, point: d } = dt(
+}, 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;
+  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(
       ...i,
       (t || 0) - A
-    ) : o === "A" ? { length: h, min: u, max: x, point: d } = me(
+    ) : o === "A" ? { length: h, min: u, max: x, point: p } = ye(
       ...i,
       (t || 0) - A
-    ) : o === "C" ? { length: h, min: u, max: x, point: d } = ue(
+    ) : o === "C" ? { length: h, min: u, max: x, point: p } = xe(
       ...i,
       (t || 0) - A
-    ) : o === "Q" ? { length: h, min: u, max: x, point: d } = ye(
+    ) : o === "Q" ? { length: h, min: u, max: x, point: p } = be(
       ...i,
       (t || 0) - A
-    ) : o === "Z" && (i = [l, c, a, m], { length: h, min: u, max: x, point: d } = dt(
+    ) : o === "Z" && (i = [a, l, c, m], { length: h, min: u, max: x, point: p } = dt(
       ...i,
       (t || 0) - A
-    )), r && A < t && A + h >= t && (p = d), g = [...g, x], y = [...y, u], A += h, [l, c] = o !== "Z" ? f.slice(-2) : [a, m];
-  return r && t >= A && (p = { x: l, y: c }), {
+    )), 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];
+  return r && t >= A && (b = { x: a, y: l }), {
     length: A,
-    point: p,
+    point: b,
     min: {
-      x: Math.min(...y.map((b) => b.x)),
-      y: Math.min(...y.map((b) => b.y))
+      x: Math.min(...y.map((d) => d.x)),
+      y: Math.min(...y.map((d) => d.y))
     },
     max: {
-      x: Math.max(...g.map((b) => b.x)),
-      y: Math.max(...g.map((b) => b.y))
+      x: Math.max(...g.map((d) => d.x)),
+      y: Math.max(...g.map((d) => d.y))
     }
   };
-}, St = (e) => {
+}, kt = (e) => {
   if (!e)
     return {
       x: 0,
@@ -611,7 +614,7 @@ e.every(([t]) => t === t.toUpperCase()), X = (e) => {
   const {
     min: { x: t, y: n },
     max: { x: r, y: s }
-  } = ht(e), i = r - t, o = s - n;
+  } = ft(e), i = r - t, o = s - n;
   return {
     width: i,
     height: o,
@@ -624,7 +627,7 @@ e.every(([t]) => t === t.toUpperCase()), X = (e) => {
     // an estimted guess
     cz: Math.max(i, o) + Math.min(i, o) / 2
   };
-}, pt = (e, t, n) => {
+}, Mt = (e, t, n) => {
   if (e[n].length > 7) {
     e[n].shift();
     const r = e[n];
@@ -633,132 +636,132 @@ e.every(([t]) => t === t.toUpperCase()), X = (e) => {
       t[n] = "A", e.splice(s += 1, 0, ["C", ...r.splice(0, 6)]);
     e.splice(n, 1);
   }
-}, Yt = (e) => Nt(e) && e.every(([t]) => "MC".includes(t)), nt = (e, t, n) => {
+}, Ut = (e) => wt(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 };
-}, Bt = (e, t, n, r, s, i, o, l, c, a) => {
-  let m = e, f = t, y = n, g = r, h = l, u = c;
-  const x = Math.PI * 120 / 180, d = Math.PI / 180 * (+s || 0);
-  let p = [], A, b, M, v, $;
-  if (a)
-    [b, M, v, $] = a;
+}, Kt = (e, t, n, r, s, i, o, a, l, c) => {
+  let m = e, f = t, y = n, g = r, h = a, u = l;
+  const x = Math.PI * 120 / 180, p = Math.PI / 180 * (+s || 0);
+  let b = [], A, d, M, T, z;
+  if (c)
+    [d, M, T, z] = c;
   else {
-    A = nt(m, f, -d), m = A.x, f = A.y, A = nt(h, u, -d), h = A.x, u = A.y;
-    const P = (m - h) / 2, w = (f - u) / 2;
-    let z = P * P / (y * y) + w * w / (g * g);
-    z > 1 && (z = Math.sqrt(z), y *= z, g *= z);
-    const yt = y * y, gt = g * g, Ct = (i === o ? -1 : 1) * Math.sqrt(Math.abs((yt * gt - yt * w * w - gt * P * P) / (yt * w * w + gt * P * P)));
-    v = Ct * y * w / g + (m + h) / 2, $ = Ct * -g * P / y + (f + u) / 2, b = Math.asin(((f - $) / g * 10 ** 9 >> 0) / 10 ** 9), M = Math.asin(((u - $) / g * 10 ** 9 >> 0) / 10 ** 9), b = m < v ? Math.PI - b : b, M = h < v ? Math.PI - M : M, b < 0 && (b = Math.PI * 2 + b), M < 0 && (M = Math.PI * 2 + M), o && b > M && (b -= Math.PI * 2), !o && M > b && (M -= Math.PI * 2);
+    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, 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 + h) / 2, z = Ct * -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);
   }
-  let F = M - b;
-  if (Math.abs(F) > x) {
-    const P = M, w = h, z = u;
-    M = b + x * (o && M > b ? 1 : -1), h = v + y * Math.cos(M), u = $ + g * Math.sin(M), p = Bt(h, u, y, g, s, 0, o, w, z, [M, P, v, $]);
+  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 = Kt(h, u, y, g, s, 0, o, L, E, [M, P, T, z]);
   }
-  F = M - b;
-  const E = Math.cos(b), _ = Math.sin(b), S = Math.cos(M), W = Math.sin(M), Q = Math.tan(F / 4), tt = 4 / 3 * y * Q, et = 4 / 3 * g * Q, T = [m, f], L = [m + tt * _, f - et * E], H = [h + tt * W, u - et * S], Y = [h, u];
-  if (L[0] = 2 * T[0] - L[0], L[1] = 2 * T[1] - L[1], a)
-    return [...L, ...H, ...Y, ...p];
-  p = [...L, ...H, ...Y, ...p];
-  const ft = [];
-  for (let P = 0, w = p.length; P < w; P += 1)
-    ft[P] = P % 2 ? nt(p[P - 1], p[P], d).y : nt(p[P], p[P + 1], d).x;
-  return ft;
-}, ge = (e, t, n, r, s, i) => {
-  const o = 0.3333333333333333, l = 2 / 3;
+  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];
+  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;
+}, de = (e, t, n, r, s, i) => {
+  const o = 0.3333333333333333, a = 2 / 3;
   return [
-    o * e + l * n,
+    o * e + a * n,
     // cpx1
-    o * t + l * r,
+    o * t + a * r,
     // cpy1
-    o * s + l * n,
+    o * s + a * n,
     // cpx2
-    o * i + l * r,
+    o * i + a * r,
     // cpy2
     s,
     i
     // x,y
   ];
-}, Tt = (e, t, n, r) => [...V([e, t], [n, r], 0.5), n, r, n, r], rt = (e, t) => {
+}, St = (e, t, n, r) => [...I([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: l, y1: c, x: a, 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 = [l, c, ...r], ["C", ...Bt(...o)]) : n === "Q" ? (t.qx = s, t.qy = i, o = [l, c, ...r], ["C", ...ge(...o)]) : n === "L" ? ["C", ...Tt(l, c, s, i)] : n === "Z" ? ["C", ...Tt(l, c, a, m)] : e;
-}, it = (e) => {
-  if (Yt(e))
+  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", ...Kt(...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 (Ut(e))
     return [...e];
-  const t = O(e), n = { ...mt }, r = [];
+  const t = j(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] = rt(t[o], n), pt(t, r, o), i = t.length;
-    const l = t[o], c = l.length;
-    n.x1 = +l[c - 2], n.y1 = +l[c - 1], n.x2 = +l[c - 4] || n.x1, n.y2 = +l[c - 3] || n.y1;
+    [s] = t[o], r[o] = s, t[o] = ot(t[o], n), Mt(t, r, o), i = t.length;
+    const a = t[o], l = a.length;
+    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;
-}, xe = (e, t, n, r, s, i, o, l) => 3 * ((l - t) * (n + s) - (o - e) * (r + i) + r * (e - s) - n * (t - i) + l * (s + e / 3) - o * (i + t / 3)) / 20, Gt = (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, _t = (e) => {
   let t = 0, n = 0, r = 0;
-  return it(e).map((s) => {
+  return ct(e).map((s) => {
     switch (s[0]) {
       case "M":
         return [, t, n] = s, 0;
       default:
-        return r = xe(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);
-}, Z = (e) => ht(e).length, de = (e) => Gt(it(e)) >= 0, J = (e, t) => ht(e, t).point, Pt = (e, t) => {
-  const n = R(e);
-  let r = [...n], s = Z(r), i = r.length - 1, o = 0, l = 0, c = n[0];
-  const [a, m] = c.slice(-2), f = { x: a, y: m };
+}, F = (e) => ft(e).length, Ae = (e) => _t(ct(e)) >= 0, W = (e, t) => ft(e, t).point, Pt = (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 };
   if (i <= 0 || !t || !Number.isFinite(t))
     return {
-      segment: c,
+      segment: l,
       index: 0,
-      length: l,
+      length: a,
       point: f,
       lengthAtSegment: o
     };
   if (t >= s)
-    return r = n.slice(0, -1), o = Z(r), l = s - o, {
+    return r = n.slice(0, -1), o = F(r), a = s - o, {
       segment: n[i],
       index: i,
-      length: l,
+      length: a,
       lengthAtSegment: o
     };
   const y = [];
   for (; i > 0; )
-    c = r[i], r = r.slice(0, -1), o = Z(r), l = s - o, s = o, y.push({
-      segment: c,
+    l = r[i], r = r.slice(0, -1), o = F(r), a = s - o, s = o, y.push({
+      segment: l,
       index: i,
-      length: l,
+      length: a,
       lengthAtSegment: o
     }), i -= 1;
   return y.find(({ lengthAtSegment: g }) => g <= t);
-}, ut = (e, t) => {
-  const n = R(e), r = O(n), s = Z(n), i = (b) => {
-    const M = b.x - t.x, v = b.y - t.y;
-    return M * M + v * v;
+}, yt = (e, t) => {
+  const n = Q(e), r = j(n), s = F(n), i = (d) => {
+    const M = d.x - t.x, T = d.y - t.y;
+    return M * M + T * T;
   };
-  let o = 8, l, c = { x: 0, y: 0 }, a = 0, m = 0, f = 1 / 0;
-  for (let b = 0; b <= s; b += o)
-    l = J(r, b), a = i(l), a < f && (c = l, m = b, f = a);
+  let o = 8, a, l = { x: 0, y: 0 }, c = 0, m = 0, f = 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);
   o /= 2;
-  let y, g, h = 0, u = 0, x = 0, d = 0;
+  let y, g, h = 0, u = 0, x = 0, p = 0;
   for (; o > 0.5; )
-    h = m - o, y = J(r, h), x = i(y), u = m + o, g = J(r, u), d = i(g), h >= 0 && x < f ? (c = y, m = h, f = x) : u <= s && d < f ? (c = g, m = u, f = d) : o /= 2;
-  const p = Pt(n, m), A = Math.sqrt(f);
-  return { closest: c, distance: A, segment: p };
-}, pe = (e, t) => ut(e, t).closest, be = (e, t) => ut(e, t).segment, Me = (e, t) => Pt(e, t).segment, Ae = (e, t) => {
-  const { distance: n } = ut(e, t);
+    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 = Pt(n, m), A = Math.sqrt(f);
+  return { closest: l, distance: A, segment: b };
+}, Ne = (e, t) => yt(e, t).closest, ve = (e, t) => yt(e, t).segment, we = (e, t) => Pt(e, t).segment, Pe = (e, t) => {
+  const { distance: n } = yt(e, t);
   return Math.abs(n) < 1e-3;
-}, Jt = (e) => {
+}, Wt = (e) => {
   if (typeof e != "string")
     return !1;
-  const t = new zt(e);
-  for (G(t); t.index < t.max && !t.err.length; )
-    Ot(t);
+  const t = new Et(e);
+  for (_(t); t.index < t.max && !t.err.length; )
+    jt(t);
   return !t.err.length && "mM".includes(t.segments[0][0]);
-}, Ut = (e) => ct(e) && // `isPathArray` checks if it's `Array`
-e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (e, t) => {
+}, Vt = (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];
@@ -768,7 +771,7 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (e, t) => {
     const i = s.slice(1).map(Number).map((o) => n ? Math.round(o * r) / r : Math.round(o));
     return [s[0], ...i];
   });
-}, j = (e, t) => ot(e, t).map((n) => n[0] + n.slice(1).join(" ")).join(""), Lt = {
+}, Z = (e, t) => lt(e, t).map((n) => n[0] + n.slice(1).join(" ")).join(""), qt = {
   line: ["x1", "y1", "x2", "y2"],
   circle: ["cx", "cy", "r"],
   ellipse: ["cx", "cy", "rx", "ry"],
@@ -776,33 +779,33 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (e, t) => {
   polygon: ["points"],
   polyline: ["points"],
   glyph: ["d"]
-}, Ne = (e) => {
+}, Ce = (e) => {
   const { x1: t, y1: n, x2: r, y2: s } = e;
   return [
     ["M", t, n],
     ["L", r, s]
   ];
-}, Pe = (e) => {
+}, Te = (e) => {
   const t = [], n = (e.points || "").trim().split(/[\s|,]/).map(Number);
   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;
-}, Ce = (e) => {
+}, Le = (e) => {
   const { cx: t, cy: n, r } = e;
   return [
     ["M", t - r, n],
     ["a", r, r, 0, 1, 0, 2 * r, 0],
     ["a", r, r, 0, 1, 0, -2 * r, 0]
   ];
-}, ve = (e) => {
+}, ke = (e) => {
   const { cx: t, cy: n, rx: r, ry: s } = e;
   return [
     ["M", t - r, n],
     ["a", r, s, 0, 1, 0, 2 * r, 0],
     ["a", r, s, 0, 1, 0, -2 * r, 0]
   ];
-}, we = (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), [
@@ -816,113 +819,113 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (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) => {
+}, qe = (e, t, n) => {
   const r = n || document, s = r.defaultView || /* istanbul ignore next */
-  window, i = Object.keys(Lt), o = e instanceof s.SVGElement, l = o ? e.tagName : null;
-  if (l && i.every((h) => l !== h))
-    throw TypeError(`${q}: "${l}" is not SVGElement`);
-  const c = r.createElementNS("http://www.w3.org/2000/svg", "path"), a = o ? l : e.type, m = Lt[a], f = { type: a };
+  window, i = Object.keys(qt), o = e instanceof s.SVGElement, a = o ? e.tagName : null;
+  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 = qt[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) || c.setAttribute(h, u);
+    m.includes(h) || l.setAttribute(h, u);
   })) : (Object.assign(f, e), Object.keys(f).forEach((h) => {
-    !m.includes(h) && h !== "type" && c.setAttribute(
+    !m.includes(h) && h !== "type" && l.setAttribute(
       h.replace(/[A-Z]/g, (u) => `-${u.toLowerCase()}`),
       f[h]
     );
   }));
   let y = "";
   const g = at.round;
-  return a === "circle" ? y = j(Ce(f), g) : a === "ellipse" ? y = j(ve(f), g) : ["polyline", "polygon"].includes(a) ? y = j(Pe(f), g) : a === "rect" ? y = j(we(f), g) : a === "line" ? y = j(Ne(f), g) : a === "glyph" && (y = o ? e.getAttribute("d") : e.d), Jt(y) ? (c.setAttribute("d", y), t && o && (e.before(c, e), e.remove()), c) : !1;
-}, kt = (e) => {
+  return c === "circle" ? y = Z(Le(f), g) : c === "ellipse" ? y = Z(ke(f), g) : ["polyline", "polygon"].includes(c) ? y = Z(Te(f), g) : c === "rect" ? y = Z(Se(f), g) : c === "line" ? y = Z(Ce(f), g) : c === "glyph" && (y = o ? e.getAttribute("d") : e.d), Wt(y) ? (l.setAttribute("d", y), 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;
-}, bt = (e) => {
-  if (Ut(e))
+}, At = (e) => {
+  if (Vt(e))
     return [...e];
-  const t = R(e);
+  const t = Q(e);
   let n = 0, r = 0, s = 0, i = 0;
   return t.map((o) => {
-    const l = o.slice(1).map(Number), [c] = o, a = c.toLowerCase();
-    if (c === "M")
-      return [n, r] = l, s = n, i = r, ["M", n, r];
+    const a = o.slice(1).map(Number), [l] = o, c = l.toLowerCase();
+    if (l === "M")
+      return [n, r] = a, s = n, i = r, ["M", n, r];
     let m = [];
-    if (c !== a)
-      if (a === "a")
+    if (l !== c)
+      if (c === "a")
         m = [
-          a,
-          l[0],
-          l[1],
-          l[2],
-          l[3],
-          l[4],
-          l[5] - n,
-          l[6] - r
+          c,
+          a[0],
+          a[1],
+          a[2],
+          a[3],
+          a[4],
+          a[5] - n,
+          a[6] - r
         ];
-      else if (a === "v")
-        m = [a, l[0] - r];
-      else if (a === "h")
-        m = [a, l[0] - n];
+      else if (c === "v")
+        m = [c, a[0] - r];
+      else if (c === "h")
+        m = [c, a[0] - n];
       else {
-        const y = l.map((g, h) => g - (h % 2 ? r : n));
-        m = [a, ...y];
+        const y = a.map((g, h) => g - (h % 2 ? r : n));
+        m = [c, ...y];
       }
     else
-      c === "m" && (s = l[0] + n, i = l[1] + r), m = [a, ...l];
+      l === "m" && (s = a[0] + n, i = a[1] + r), m = [c, ...a];
     const f = m.length;
-    return a === "z" ? (n = s, r = i) : a === "h" ? n += m[1] : a === "v" ? r += m[1] : (n += m[f - 2], r += m[f - 1]), m;
+    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;
   });
-}, Te = (e, t, n, r) => {
-  const [s] = e, i = (d) => Math.round(d * 10 ** 4) / 10 ** 4, o = e.slice(1).map((d) => +d), l = t.slice(1).map((d) => +d), { x1: c, y1: a, x2: m, y2: f, x: y, y: g } = n;
+}, $e = (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] = l.slice(-2);
+  const [u, x] = a.slice(-2);
   if ("TQ".includes(s) || (n.qx = null, n.qy = null), ["V", "H", "S", "T", "Z"].includes(s))
     h = [s, ...o];
   else if (s === "L")
     i(y) === i(u) ? h = ["V", x] : i(g) === i(x) && (h = ["H", u]);
   else if (s === "C") {
-    const [d, p] = l;
-    "CS".includes(r) && (i(d) === i(c * 2 - m) && i(p) === i(a * 2 - f) || i(c) === i(m * 2 - y) && i(a) === i(f * 2 - g)) && (h = ["S", ...l.slice(-4)]), n.x1 = d, n.y1 = p;
+    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;
   } else if (s === "Q") {
-    const [d, p] = l;
-    n.qx = d, n.qy = p, "QT".includes(r) && (i(d) === i(c * 2 - m) && i(p) === i(a * 2 - f) || i(c) === i(m * 2 - y) && i(a) === i(f * 2 - g)) && (h = ["T", ...l.slice(-2)]);
+    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)]);
   }
   return h;
-}, qt = (e, t) => {
-  const n = X(e), r = O(n), s = { ...mt }, i = [], o = n.length;
-  let l = "", c = "", a = 0, m = 0, f = 0, y = 0;
+}, Ot = (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) {
-    [l] = n[u], i[u] = l, u && (c = i[u - 1]), n[u] = Te(n[u], r[u], s, c);
-    const x = n[u], d = x.length;
-    switch (s.x1 = +x[d - 2], s.y1 = +x[d - 1], s.x2 = +x[d - 4] || s.x1, s.y2 = +x[d - 3] || s.y1, l) {
+    [a] = n[u], i[u] = a, u && (l = i[u - 1]), n[u] = $e(n[u], r[u], s, l);
+    const x = n[u], 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":
-        a = f, m = y;
+        c = f, m = y;
         break;
       case "H":
-        [, a] = x;
+        [, c] = x;
         break;
       case "V":
         [, m] = x;
         break;
       default:
-        [a, m] = x.slice(-2).map(Number), l === "M" && (f = a, y = m);
+        [c, m] = x.slice(-2).map(Number), a === "M" && (f = c, y = m);
     }
-    s.x = a, s.y = m;
+    s.x = c, s.y = m;
   }
-  const g = ot(n, t), h = ot(bt(n), t);
+  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);
-}, Le = (e) => {
+}, 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)])];
-}, st = (e) => {
-  const t = X(e), n = t.slice(-1)[0][0] === "Z", r = O(t).map((s, i) => {
-    const [o, l] = s.slice(-2).map(Number);
+}, it = (e) => {
+  const t = H(e), n = t.slice(-1)[0][0] === "Z", r = j(t).map((s, i) => {
+    const [o, a] = s.slice(-2).map(Number);
     return {
       seg: t[i],
       // absolute
@@ -932,30 +935,30 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (e, t) => {
       // pathCommand
       x: o,
       // x
-      y: l
+      y: a
       // y
     };
   }).map((s, i, o) => {
-    const l = s.seg, c = s.n, a = 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;
+    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) {
       case "M":
         u = n ? ["Z"] : [f, g, h];
         break;
       case "A":
-        u = [f, ...l.slice(1, -3), l[5] === 1 ? 0 : 1, g, h];
+        u = [f, ...a.slice(1, -3), a[5] === 1 ? 0 : 1, g, h];
         break;
       case "C":
-        m && m.c === "S" ? u = ["S", l[1], l[2], g, h] : u = [f, l[3], l[4], l[1], l[2], g, h];
+        m && m.c === "S" ? u = ["S", a[1], a[2], g, h] : u = [f, a[3], a[4], a[1], a[2], g, h];
         break;
       case "S":
-        a && "CS".includes(a.c) && (!m || m.c !== "S") ? u = ["C", c[3], c[4], c[1], c[2], g, h] : u = [f, c[1], c[2], g, h];
+        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];
         break;
       case "Q":
-        m && m.c === "T" ? u = ["T", g, h] : u = [f, ...l.slice(1, -2), g, h];
+        m && m.c === "T" ? u = ["T", g, h] : u = [f, ...a.slice(1, -2), g, h];
         break;
       case "T":
-        a && "QT".includes(a.c) && (!m || m.c !== "T") ? u = ["Q", c[1], c[2], g, h] : u = [f, g, h];
+        c && "QT".includes(c.c) && (!m || m.c !== "T") ? u = ["Q", l[1], l[2], g, h] : u = [f, g, h];
         break;
       case "Z":
         u = ["M", g, h];
@@ -967,41 +970,41 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (e, t) => {
         u = [f, h];
         break;
       default:
-        u = [f, ...l.slice(1, -2), g, h];
+        u = [f, ...a.slice(1, -2), g, h];
     }
     return u;
   });
   return n ? r.reverse() : [r[0], ...r.slice(1).reverse()];
-}, ke = (e) => {
-  let t = new Mt();
-  const { origin: n } = e, [r, s] = n, { translate: i } = e, { rotate: o } = e, { skew: l } = e, { scale: c } = e;
-  return Array.isArray(i) && i.length >= 2 && i.every((a) => !Number.isNaN(+a)) && i.some((a) => a !== 0) ? t = t.translate(...i) : typeof i == "number" && !Number.isNaN(i) && (t = t.translate(i)), (o || l || c) && (t = t.translate(r, s), Array.isArray(o) && o.length >= 2 && o.every((a) => !Number.isNaN(+a)) && o.some((a) => a !== 0) ? t = t.rotate(...o) : typeof o == "number" && !Number.isNaN(o) && (t = t.rotate(o)), Array.isArray(l) && l.length === 2 && l.every((a) => !Number.isNaN(+a)) && l.some((a) => a !== 0) ? (t = l[0] ? t.skewX(l[0]) : t, t = l[1] ? t.skewY(l[1]) : t) : typeof l == "number" && !Number.isNaN(l) && (t = t.skewX(l)), Array.isArray(c) && c.length >= 2 && c.every((a) => !Number.isNaN(+a)) && c.some((a) => a !== 1) ? t = t.scale(...c) : typeof c == "number" && !Number.isNaN(c) && (t = t.scale(c)), t = t.translate(-r, -s)), t;
-}, qe = (e, t) => {
-  let n = Mt.Translate(...t.slice(0, -1));
+}, ze = (e) => {
+  let t = new Nt();
+  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;
+}, Ie = (e, t) => {
+  let n = Nt.Translate(...t.slice(0, -1));
   return [, , , n.m44] = t, n = e.multiply(n), [n.m41, n.m42, n.m43, n.m44];
-}, $t = (e, t, n) => {
-  const [r, s, i] = n, [o, l, c] = qe(e, [...t, 0, 1]), a = o - r, m = l - s, f = c - i;
+}, zt = (e, t, n) => {
+  const [r, s, i] = n, [o, a, l] = Ie(e, [...t, 0, 1]), c = o - r, m = a - s, f = l - i;
   return [
     // protect against division by ZERO
-    a * (Math.abs(i) / Math.abs(f) || 1) + r,
+    c * (Math.abs(i) / Math.abs(f) || 1) + r,
     m * (Math.abs(i) / Math.abs(f) || 1) + s
   ];
-}, Vt = (e, t) => {
-  let n = 0, r = 0, s, i, o, l, c, a;
-  const m = X(e), f = t && Object.keys(t);
+}, It = (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)
     return [...m];
-  const y = O(m);
+  const y = j(m);
   if (!t.origin) {
     const { origin: M } = at;
     Object.assign(t, { origin: M });
   }
-  const g = ke(t), { origin: h } = t, u = { ...mt };
-  let x = [], d = 0, p = "", A = [];
-  const b = [];
+  const g = ze(t), { origin: h } = t, u = { ...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] && ([p] = x), b[s] = p, p === "A" && (x = rt(y[s], u), m[s] = rt(y[s], u), pt(m, b, s), y[s] = rt(y[s], u), pt(y, b, s), o = Math.max(m.length, y.length)), x = y[s], d = x.length, u.x1 = +x[d - 2], u.y1 = +x[d - 1], u.x2 = +x[d - 4] || u.x1, u.y2 = +x[d - 3] || u.y1;
+      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;
       const M = {
         s: m[s],
         c: m[s][0],
@@ -1011,58 +1014,22 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), ot = (e, t) => {
       A = [...A, M];
     }
     return A.map((M) => {
-      if (p = M.c, x = M.s, p === "L" || p === "H" || p === "V")
-        return [c, a] = $t(g, [M.x, M.y], h), n !== c && r !== a ? x = ["L", c, a] : r === a ? x = ["H", c] : n === c && (x = ["V", a]), n = c, r = a, x;
-      for (i = 1, l = x.length; i < l; i += 2)
-        [n, r] = $t(g, [+x[i], +x[i + 1]], h), x[i] = n, x[i + 1] = r;
+      if (b = M.c, x = M.s, b === "L" || b === "H" || b === "V")
+        return [l, c] = zt(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;
+      for (i = 1, a = x.length; i < a; i += 2)
+        [n, r] = zt(g, [+x[i], +x[i + 1]], h), x[i] = n, x[i + 1] = r;
       return x;
     });
   }
   return [...m];
-}, $e = (e) => {
-  const n = e.slice(0, 2), r = e.slice(2, 4), s = e.slice(4, 6), i = e.slice(6, 8), o = V(n, r, 0.5), l = V(r, s, 0.5), c = V(s, i, 0.5), a = V(o, l, 0.5), m = V(l, c, 0.5), f = V(a, m, 0.5);
+}, je = (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);
   return [
-    ["C", ...o, ...a, ...f],
-    ["C", ...m, ...c, ...i]
+    ["C", ...o, ...c, ...f],
+    ["C", ...m, ...l, ...i]
   ];
 };
-class Ve {
-  // bring main utilities to front
-  static CSSMatrix = Mt;
-  static getPathBBox = St;
-  static getPathArea = Gt;
-  static getTotalLength = Z;
-  static getDrawDirection = de;
-  static getPointAtLength = J;
-  static pathLengthFactory = ht;
-  static getPropertiesAtLength = Pt;
-  static getPropertiesAtPoint = ut;
-  static polygonLength = re;
-  static polygonArea = se;
-  static getClosestPoint = pe;
-  static getSegmentOfPoint = be;
-  static getSegmentAtLength = Me;
-  static isPointInStroke = Ae;
-  static isValidPath = Jt;
-  static isPathArray = ct;
-  static isAbsoluteArray = At;
-  static isRelativeArray = Ut;
-  static isCurveArray = Yt;
-  static isNormalizedArray = Nt;
-  static shapeToPath = Se;
-  static parsePathString = R;
-  static roundPath = ot;
-  static splitPath = kt;
-  static splitCubic = $e;
-  static optimizePath = qt;
-  static reverseCurve = Le;
-  static reversePath = st;
-  static normalizePath = O;
-  static transformPath = Vt;
-  static pathToAbsolute = X;
-  static pathToRelative = bt;
-  static pathToCurve = it;
-  static pathToString = j;
+class v {
   /**
    * @constructor
    * @param {string} pathValue the path string
@@ -1071,26 +1038,26 @@ class Ve {
   constructor(t, n) {
     const r = n || {}, s = typeof t > "u";
     if (s || !t.length)
-      throw TypeError(`${q}: "pathValue" is ${s ? "undefined" : "empty"}`);
-    const i = R(t);
+      throw TypeError(`${O}: "pathValue" is ${s ? "undefined" : "empty"}`);
+    const i = Q(t);
     this.segments = i;
-    const { width: o, height: l, cx: c, cy: a, cz: m } = this.getBBox(), { round: f, origin: y } = r;
+    const { width: o, height: a, cx: l, cy: c, cz: m } = this.getBBox(), { round: f, origin: y } = r;
     let g;
     if (f === "auto") {
-      const u = `${Math.floor(Math.max(o, l))}`.length;
+      const u = `${Math.floor(Math.max(o, a))}`.length;
       g = u >= 4 ? 0 : 4 - u;
     } else
       Number.isInteger(f) || f === "off" ? g = f : g = at.round;
     let h;
     if (Array.isArray(y) && y.length >= 2) {
-      const [u, x, d] = y.map(Number);
+      const [u, x, p] = y.map(Number);
       h = [
-        Number.isNaN(u) ? c : u,
-        Number.isNaN(x) ? a : x,
-        Number.isNaN(d) ? m : d
+        Number.isNaN(u) ? l : u,
+        Number.isNaN(x) ? c : x,
+        Number.isNaN(p) ? m : p
       ];
     } else
-      h = [c, a, m];
+      h = [l, c, m];
     return this.round = g, this.origin = h, this;
   }
   /**
@@ -1100,7 +1067,7 @@ class Ve {
    * @returns the pathBBox
    */
   getBBox() {
-    return St(this.segments);
+    return kt(this.segments);
   }
   /**
    * Returns the total path length, equivalent to native `path.getTotalLength()`.
@@ -1109,7 +1076,7 @@ class Ve {
    * @returns the path total length
    */
   getTotalLength() {
-    return Z(this.segments);
+    return F(this.segments);
   }
   /**
    * Returns an `{x,y}` point in the path stroke at a given length,
@@ -1120,7 +1087,7 @@ class Ve {
    * @returns the requested point
    */
   getPointAtLength(t) {
-    return J(this.segments, t);
+    return W(this.segments, t);
   }
   /**
    * Convert path to absolute values
@@ -1129,7 +1096,7 @@ class Ve {
    */
   toAbsolute() {
     const { segments: t } = this;
-    return this.segments = X(t), this;
+    return this.segments = H(t), this;
   }
   /**
    * Convert path to relative values
@@ -1138,7 +1105,7 @@ class Ve {
    */
   toRelative() {
     const { segments: t } = this;
-    return this.segments = bt(t), this;
+    return this.segments = At(t), this;
   }
   /**
    * Convert path to cubic-bezier values. In addition, un-necessary `Z`
@@ -1148,7 +1115,7 @@ class Ve {
    */
   toCurve() {
     const { segments: t } = this;
-    return this.segments = it(t), this;
+    return this.segments = ct(t), this;
   }
   /**
    * Reverse the order of the segments and their values.
@@ -1158,9 +1125,9 @@ class Ve {
    */
   reverse(t) {
     this.toAbsolute();
-    const { segments: n } = this, r = kt(n), s = r.length > 1 ? r : !1, i = s ? [...s].map((l, c) => t ? c ? st(l) : [...l] : st(l)) : [...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 : st(n), this.segments = [...o], this;
+    return s ? o = i.flat(1) : o = t ? n : it(n), this.segments = [...o], this;
   }
   /**
    * Normalize path in 2 steps:
@@ -1171,7 +1138,7 @@ class Ve {
    */
   normalize() {
     const { segments: t } = this;
-    return this.segments = O(t), this;
+    return this.segments = j(t), this;
   }
   /**
    * Optimize `pathArray` values:
@@ -1183,7 +1150,7 @@ class Ve {
    */
   optimize() {
     const { segments: t } = this;
-    return this.segments = qt(t, this.round), this;
+    return this.segments = Ot(t, this.round), this;
   }
   /**
    * Transform path using values from an `Object` defined as `transformObject`.
@@ -1194,21 +1161,21 @@ class Ve {
    * @public
    */
   transform(t) {
-    if (!t || typeof t != "object" || typeof t == "object" && !["translate", "rotate", "skew", "scale"].some((c) => c in t))
+    if (!t || typeof t != "object" || typeof t == "object" && !["translate", "rotate", "skew", "scale"].some((l) => l in t))
       return this;
     const {
       segments: n,
       origin: [r, s, i]
     } = this, o = {};
-    for (const [c, a] of Object.entries(t))
-      c === "skew" && Array.isArray(a) || (c === "rotate" || c === "translate" || c === "origin" || c === "scale") && Array.isArray(a) ? o[c] = a.map(Number) : c !== "origin" && typeof Number(a) == "number" && (o[c] = Number(a));
-    const { origin: l } = o;
-    if (Array.isArray(l) && l.length >= 2) {
-      const [c, a, m] = l.map(Number);
-      o.origin = [Number.isNaN(c) ? r : c, Number.isNaN(a) ? s : a, m || i];
+    for (const [l, c] of Object.entries(t))
+      l === "skew" && Array.isArray(c) || (l === "rotate" || l === "translate" || l === "origin" || l === "scale") && Array.isArray(c) ? o[l] = c.map(Number) : l !== "origin" && typeof Number(c) == "number" && (o[l] = Number(c));
+    const { origin: a } = o;
+    if (Array.isArray(a) && a.length >= 2) {
+      const [l, c, m] = a.map(Number);
+      o.origin = [Number.isNaN(l) ? r : l, Number.isNaN(c) ? s : c, m || i];
     } else
       o.origin = [r, s, i];
-    return this.segments = Vt(n, o), this;
+    return this.segments = It(n, o), this;
   }
   /**
    * Rotate path 180deg vertically
@@ -1234,10 +1201,12 @@ class Ve {
    * @return the path string
    */
   toString() {
-    return j(this.segments, this.round);
+    return Z(this.segments, this.round);
   }
 }
+// bring main utilities to front
+N(v, "CSSMatrix", Nt), N(v, "getPathBBox", kt), N(v, "getPathArea", _t), N(v, "getTotalLength", F), N(v, "getDrawDirection", Ae), N(v, "getPointAtLength", W), N(v, "pathLengthFactory", ft), N(v, "getPropertiesAtLength", Pt), N(v, "getPropertiesAtPoint", yt), N(v, "polygonLength", le), N(v, "polygonArea", ce), N(v, "getClosestPoint", Ne), N(v, "getSegmentOfPoint", ve), N(v, "getSegmentAtLength", we), N(v, "isPointInStroke", Pe), N(v, "isValidPath", Wt), N(v, "isPathArray", mt), N(v, "isAbsoluteArray", vt), N(v, "isRelativeArray", Vt), N(v, "isCurveArray", Ut), N(v, "isNormalizedArray", wt), N(v, "shapeToPath", qe), N(v, "parsePathString", Q), N(v, "roundPath", lt), N(v, "splitPath", $t), N(v, "splitCubic", je), N(v, "optimizePath", Ot), N(v, "reverseCurve", Oe), N(v, "reversePath", it), N(v, "normalizePath", j), N(v, "transformPath", It), N(v, "pathToAbsolute", H), N(v, "pathToRelative", At), N(v, "pathToCurve", ct), N(v, "pathToString", Z);
 export {
-  Ve as default
+  v as default
 };
 //# sourceMappingURL=svg-path-commander.mjs.map