svg-path-commander 2.1.2 → 2.1.5

package/dist/svg-path-commander.mjs

@@ -1,8 +1,8 @@
-var Se = Object.defineProperty;
-var De = (e, t, s) => t in e ? Se(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s;
-var g = (e, t, s) => De(e, typeof t != "symbol" ? t + "" : t, s);
-var Ze = Object.defineProperty, Oe = (e, t, s) => t in e ? Ze(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s, q = (e, t, s) => Oe(e, typeof t != "symbol" ? t + "" : t, s);
-const Qe = {
+var je = Object.defineProperty;
+var Qe = (e, t, s) => t in e ? je(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s;
+var d = (e, t, s) => Qe(e, typeof t != "symbol" ? t + "" : t, s);
+var Ze = Object.defineProperty, De = (e, t, s) => t in e ? Ze(e, t, { enumerable: !0, configurable: !0, writable: !0, value: s }) : e[t] = s, S = (e, t, s) => De(e, typeof t != "symbol" ? t + "" : t, s);
+const Oe = {
   a: 1,
   b: 0,
   c: 0,
@@ -27,21 +27,21 @@ const Qe = {
   m44: 1,
   is2D: !0,
   isIdentity: !0
-}, Vt = (e) => (e instanceof Float64Array || e instanceof Float32Array || Array.isArray(e) && e.every((t) => typeof t == "number")) && [6, 16].some((t) => e.length === t), Gt = (e) => e instanceof DOMMatrix || e instanceof C || typeof e == "object" && Object.keys(Qe).every((t) => e && t in e), ht = (e) => {
-  const t = new C(), s = Array.from(e);
-  if (!Vt(s))
+}, Gt = (e) => (e instanceof Float64Array || e instanceof Float32Array || Array.isArray(e) && e.every((t) => typeof t == "number")) && [6, 16].some((t) => e.length === t), te = (e) => e instanceof DOMMatrix || e instanceof T || typeof e == "object" && Object.keys(Oe).every((t) => e && t in e), lt = (e) => {
+  const t = new T(), s = Array.from(e);
+  if (!Gt(s))
     throw TypeError(`CSSMatrix: "${s.join(",")}" must be an array with 6/16 numbers.`);
   if (s.length === 16) {
-    const [r, n, i, o, a, c, l, u, m, f, y, h, x, b, A, w] = s;
-    t.m11 = r, t.a = r, t.m21 = a, t.c = a, t.m31 = m, t.m41 = x, t.e = x, t.m12 = n, t.b = n, t.m22 = c, t.d = c, t.m32 = f, t.m42 = b, t.f = b, t.m13 = i, t.m23 = l, t.m33 = y, t.m43 = A, t.m14 = o, t.m24 = u, t.m34 = h, t.m44 = w;
+    const [r, n, i, o, l, c, a, u, m, h, g, f, y, p, M, N] = s;
+    t.m11 = r, t.a = r, t.m21 = l, t.c = l, t.m31 = m, t.m41 = y, t.e = y, t.m12 = n, t.b = n, t.m22 = c, t.d = c, t.m32 = h, t.m42 = p, t.f = p, t.m13 = i, t.m23 = a, t.m33 = g, t.m43 = M, t.m14 = o, t.m24 = u, t.m34 = f, t.m44 = N;
   } else if (s.length === 6) {
-    const [r, n, i, o, a, c] = s;
-    t.m11 = r, t.a = r, t.m12 = n, t.b = n, t.m21 = i, t.c = i, t.m22 = o, t.d = o, t.m41 = a, t.e = a, t.m42 = c, t.f = c;
+    const [r, n, i, o, l, c] = s;
+    t.m11 = r, t.a = r, t.m12 = n, t.b = n, t.m21 = i, t.c = i, t.m22 = o, t.d = o, t.m41 = l, t.e = l, t.m42 = c, t.f = c;
   }
   return t;
-}, te = (e) => {
-  if (Gt(e))
-    return ht([
+}, ee = (e) => {
+  if (te(e))
+    return lt([
       e.m11,
       e.m12,
       e.m13,
@@ -60,47 +60,47 @@ const Qe = {
       e.m44
     ]);
   throw TypeError(`CSSMatrix: "${JSON.stringify(e)}" is not a DOMMatrix / CSSMatrix / JSON compatible object.`);
-}, ee = (e) => {
+}, ne = (e) => {
   if (typeof e != "string")
     throw TypeError(`CSSMatrix: "${JSON.stringify(e)}" is not a string.`);
   const t = String(e).replace(/\s/g, "");
-  let s = new C();
+  let s = new T();
   const r = `CSSMatrix: invalid transform string "${e}"`;
   return t.split(")").filter((n) => n).forEach((n) => {
     const [i, o] = n.split("(");
     if (!o) throw TypeError(r);
-    const a = o.split(",").map((h) => h.includes("rad") ? parseFloat(h) * (180 / Math.PI) : parseFloat(h)), [c, l, u, m] = a, f = [c, l, u], y = [c, l, u, m];
-    if (i === "perspective" && c && [l, u].every((h) => h === void 0))
+    const l = o.split(",").map((f) => f.includes("rad") ? parseFloat(f) * (180 / Math.PI) : parseFloat(f)), [c, a, u, m] = l, h = [c, a, u], g = [c, a, u, m];
+    if (i === "perspective" && c && [a, u].every((f) => f === void 0))
       s.m34 = -1 / c;
-    else if (i.includes("matrix") && [6, 16].includes(a.length) && a.every((h) => !Number.isNaN(+h))) {
-      const h = a.map((x) => Math.abs(x) < 1e-6 ? 0 : x);
-      s = s.multiply(ht(h));
-    } else if (i === "translate3d" && f.every((h) => !Number.isNaN(+h)))
-      s = s.translate(c, l, u);
+    else if (i.includes("matrix") && [6, 16].includes(l.length) && l.every((f) => !Number.isNaN(+f))) {
+      const f = l.map((y) => Math.abs(y) < 1e-6 ? 0 : y);
+      s = s.multiply(lt(f));
+    } else if (i === "translate3d" && h.every((f) => !Number.isNaN(+f)))
+      s = s.translate(c, a, u);
     else if (i === "translate" && c && u === void 0)
-      s = s.translate(c, l || 0, 0);
-    else if (i === "rotate3d" && y.every((h) => !Number.isNaN(+h)) && m)
-      s = s.rotateAxisAngle(c, l, u, m);
-    else if (i === "rotate" && c && [l, u].every((h) => h === void 0))
+      s = s.translate(c, a || 0, 0);
+    else if (i === "rotate3d" && g.every((f) => !Number.isNaN(+f)) && m)
+      s = s.rotateAxisAngle(c, a, u, m);
+    else if (i === "rotate" && c && [a, u].every((f) => f === void 0))
       s = s.rotate(0, 0, c);
-    else if (i === "scale3d" && f.every((h) => !Number.isNaN(+h)) && f.some((h) => h !== 1))
-      s = s.scale(c, l, u);
+    else if (i === "scale3d" && h.every((f) => !Number.isNaN(+f)) && h.some((f) => f !== 1))
+      s = s.scale(c, a, u);
     else if (i === "scale" && !Number.isNaN(c) && c !== 1 && u === void 0) {
-      const h = Number.isNaN(+l) ? c : l;
-      s = s.scale(c, h, 1);
-    } else if (i === "skew" && (c || !Number.isNaN(c) && l) && u === void 0)
-      s = s.skew(c, l || 0);
-    else if (["translate", "rotate", "scale", "skew"].some((h) => i.includes(h)) && /[XYZ]/.test(i) && c && [l, u].every((h) => h === void 0))
+      const f = Number.isNaN(+a) ? c : a;
+      s = s.scale(c, f, 1);
+    } else if (i === "skew" && (c || !Number.isNaN(c) && a) && u === void 0)
+      s = s.skew(c, a || 0);
+    else if (["translate", "rotate", "scale", "skew"].some((f) => i.includes(f)) && /[XYZ]/.test(i) && c && [a, u].every((f) => f === void 0))
       if (i === "skewX" || i === "skewY")
         s = s[i](c);
       else {
-        const h = i.replace(/[XYZ]/, ""), x = i.replace(h, ""), b = ["X", "Y", "Z"].indexOf(x), A = h === "scale" ? 1 : 0, w = [b === 0 ? c : A, b === 1 ? c : A, b === 2 ? c : A];
-        s = s[h](...w);
+        const f = i.replace(/[XYZ]/, ""), y = i.replace(f, ""), p = ["X", "Y", "Z"].indexOf(y), M = f === "scale" ? 1 : 0, N = [p === 0 ? c : M, p === 1 ? c : M, p === 2 ? c : M];
+        s = s[f](...N);
       }
     else
       throw TypeError(r);
   }), s;
-}, vt = (e, t) => t ? [e.a, e.b, e.c, e.d, e.e, e.f] : [
+}, zt = (e, t) => t ? [e.a, e.b, e.c, e.d, e.e, e.f] : [
   e.m11,
   e.m12,
   e.m13,
@@ -117,33 +117,33 @@ const Qe = {
   e.m42,
   e.m43,
   e.m44
-], ne = (e, t, s) => {
-  const r = new C();
+], se = (e, t, s) => {
+  const r = new T();
   return r.m41 = e, r.e = e, r.m42 = t, r.f = t, r.m43 = s, r;
-}, se = (e, t, s) => {
-  const r = new C(), n = Math.PI / 180, i = e * n, o = t * n, a = s * n, c = Math.cos(i), l = -Math.sin(i), u = Math.cos(o), m = -Math.sin(o), f = Math.cos(a), y = -Math.sin(a), h = u * f, x = -u * y;
-  r.m11 = h, r.a = h, r.m12 = x, r.b = x, r.m13 = m;
-  const b = l * m * f + c * y;
-  r.m21 = b, r.c = b;
-  const A = c * f - l * m * y;
-  return r.m22 = A, r.d = A, r.m23 = -l * u, r.m31 = l * y - c * m * f, r.m32 = l * f + c * m * y, r.m33 = c * u, r;
-}, re = (e, t, s, r) => {
-  const n = new C(), i = Math.sqrt(e * e + t * t + s * s);
+}, re = (e, t, s) => {
+  const r = new T(), n = Math.PI / 180, i = e * n, o = t * n, l = s * n, c = Math.cos(i), a = -Math.sin(i), u = Math.cos(o), m = -Math.sin(o), h = Math.cos(l), g = -Math.sin(l), f = u * h, y = -u * g;
+  r.m11 = f, r.a = f, r.m12 = y, r.b = y, r.m13 = m;
+  const p = a * m * h + c * g;
+  r.m21 = p, r.c = p;
+  const M = c * h - a * m * g;
+  return r.m22 = M, r.d = M, r.m23 = -a * u, r.m31 = a * g - c * m * h, r.m32 = a * h + c * m * g, r.m33 = c * u, r;
+}, ie = (e, t, s, r) => {
+  const n = new T(), i = Math.sqrt(e * e + t * t + s * s);
   if (i === 0)
     return n;
-  const o = e / i, a = t / i, c = s / i, l = r * (Math.PI / 360), u = Math.sin(l), m = Math.cos(l), f = u * u, y = o * o, h = a * a, x = c * c, b = 1 - 2 * (h + x) * f;
-  n.m11 = b, n.a = b;
-  const A = 2 * (o * a * f + c * u * m);
-  n.m12 = A, n.b = A, n.m13 = 2 * (o * c * f - a * u * m);
-  const w = 2 * (a * o * f - c * u * m);
-  n.m21 = w, n.c = w;
-  const N = 1 - 2 * (x + y) * f;
-  return n.m22 = N, n.d = N, n.m23 = 2 * (a * c * f + o * u * m), n.m31 = 2 * (c * o * f + a * u * m), n.m32 = 2 * (c * a * f - o * u * m), n.m33 = 1 - 2 * (y + h) * f, n;
-}, ie = (e, t, s) => {
-  const r = new C();
+  const o = e / i, l = t / i, c = s / i, a = r * (Math.PI / 360), u = Math.sin(a), m = Math.cos(a), h = u * u, g = o * o, f = l * l, y = c * c, p = 1 - 2 * (f + y) * h;
+  n.m11 = p, n.a = p;
+  const M = 2 * (o * l * h + c * u * m);
+  n.m12 = M, n.b = M, n.m13 = 2 * (o * c * h - l * u * m);
+  const N = 2 * (l * o * h - c * u * m);
+  n.m21 = N, n.c = N;
+  const x = 1 - 2 * (y + g) * h;
+  return n.m22 = x, n.d = x, n.m23 = 2 * (l * c * h + o * u * m), n.m31 = 2 * (c * o * h + l * u * m), n.m32 = 2 * (c * l * h - o * u * m), n.m33 = 1 - 2 * (g + f) * h, n;
+}, oe = (e, t, s) => {
+  const r = new T();
   return r.m11 = e, r.a = e, r.m22 = t, r.d = t, r.m33 = s, r;
 }, At = (e, t) => {
-  const s = new C();
+  const s = new T();
   if (e) {
     const r = e * Math.PI / 180, n = Math.tan(r);
     s.m21 = n, s.c = n;
@@ -153,11 +153,11 @@ const Qe = {
     s.m12 = n, s.b = n;
   }
   return s;
-}, oe = (e) => At(e, 0), ce = (e) => At(0, e), B = (e, t) => {
-  const s = 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, n = 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, c = t.m21 * e.m13 + t.m22 * e.m23 + t.m23 * e.m33 + t.m24 * e.m43, l = t.m21 * e.m14 + t.m22 * e.m24 + t.m23 * e.m34 + t.m24 * e.m44, u = t.m31 * e.m11 + t.m32 * e.m21 + t.m33 * e.m31 + t.m34 * e.m41, m = t.m31 * e.m12 + t.m32 * e.m22 + t.m33 * e.m32 + t.m34 * e.m42, f = t.m31 * e.m13 + t.m32 * e.m23 + t.m33 * e.m33 + t.m34 * e.m43, y = 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, x = t.m41 * e.m12 + t.m42 * e.m22 + t.m43 * e.m32 + t.m44 * e.m42, b = t.m41 * e.m13 + t.m42 * e.m23 + t.m43 * e.m33 + t.m44 * e.m43, A = t.m41 * e.m14 + t.m42 * e.m24 + t.m43 * e.m34 + t.m44 * e.m44;
-  return ht([s, r, n, i, o, a, c, l, u, m, f, y, h, x, b, A]);
+}, ce = (e) => At(e, 0), le = (e) => At(0, e), _ = (e, t) => {
+  const s = 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, n = 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, u = t.m31 * e.m11 + t.m32 * e.m21 + t.m33 * e.m31 + t.m34 * e.m41, m = t.m31 * e.m12 + t.m32 * e.m22 + t.m33 * e.m32 + t.m34 * e.m42, h = 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, y = t.m41 * e.m12 + t.m42 * e.m22 + t.m43 * e.m32 + t.m44 * e.m42, p = t.m41 * e.m13 + t.m42 * e.m23 + t.m43 * e.m33 + t.m44 * e.m43, M = t.m41 * e.m14 + t.m42 * e.m24 + t.m43 * e.m34 + t.m44 * e.m44;
+  return lt([s, r, n, i, o, l, c, a, u, m, h, g, f, y, p, M]);
 };
-class C {
+class T {
   /**
    * @constructor
    * @param init accepts all parameter configurations:
@@ -202,7 +202,7 @@ class C {
    * @return the matrix instance
    */
   setMatrixValue(t) {
-    return typeof t == "string" && t.length && t !== "none" ? ee(t) : Array.isArray(t) || t instanceof Float64Array || t instanceof Float32Array ? ht(t) : typeof t == "object" ? te(t) : this;
+    return typeof t == "string" && t.length && t !== "none" ? ne(t) : Array.isArray(t) || t instanceof Float64Array || t instanceof Float32Array ? lt(t) : typeof t == "object" ? ee(t) : this;
   }
   /**
    * Returns a *Float32Array* containing elements which comprise the matrix.
@@ -213,7 +213,7 @@ class C {
    * @return an *Array* representation of the matrix
    */
   toFloat32Array(t) {
-    return Float32Array.from(vt(this, t));
+    return Float32Array.from(zt(this, t));
   }
   /**
    * Returns a *Float64Array* containing elements which comprise the matrix.
@@ -224,7 +224,7 @@ class C {
    * @return an *Array* representation of the matrix
    */
   toFloat64Array(t) {
-    return Float64Array.from(vt(this, t));
+    return Float64Array.from(zt(this, t));
   }
   /**
    * Creates and returns a string representation of the matrix in `CSS` matrix syntax,
@@ -262,7 +262,7 @@ class C {
    * @return The resulted matrix.
    */
   multiply(t) {
-    return B(this, t);
+    return _(this, t);
   }
   /**
    * The translate method returns a new matrix which is this matrix post
@@ -278,7 +278,7 @@ class C {
   translate(t, s, r) {
     const n = t;
     let i = s, o = r;
-    return typeof i > "u" && (i = 0), typeof o > "u" && (o = 0), B(this, ne(n, i, o));
+    return typeof i > "u" && (i = 0), typeof o > "u" && (o = 0), _(this, se(n, i, o));
   }
   /**
    * The scale method returns a new matrix which is this matrix post multiplied by
@@ -294,7 +294,7 @@ class C {
   scale(t, s, r) {
     const n = t;
     let i = s, o = r;
-    return typeof i > "u" && (i = t), typeof o > "u" && (o = 1), B(this, ie(n, i, o));
+    return typeof i > "u" && (i = t), typeof o > "u" && (o = 1), _(this, oe(n, i, o));
   }
   /**
    * The rotate method returns a new matrix which is this matrix post multiplied
@@ -310,7 +310,7 @@ class C {
    */
   rotate(t, s, r) {
     let n = t, i = s || 0, o = r || 0;
-    return typeof t == "number" && typeof s > "u" && typeof r > "u" && (o = n, n = 0, i = 0), B(this, se(n, i, o));
+    return typeof t == "number" && typeof s > "u" && typeof r > "u" && (o = n, n = 0, i = 0), _(this, re(n, i, o));
   }
   /**
    * The rotateAxisAngle method returns a new matrix which is this matrix post
@@ -327,7 +327,7 @@ class C {
   rotateAxisAngle(t, s, r, n) {
     if ([t, s, r, n].some((i) => Number.isNaN(+i)))
       throw new TypeError("CSSMatrix: expecting 4 values");
-    return B(this, re(t, s, r, n));
+    return _(this, ie(t, s, r, n));
   }
   /**
    * Specifies a skew transformation along the `x-axis` by the given angle.
@@ -337,7 +337,7 @@ class C {
    * @return The resulted matrix
    */
   skewX(t) {
-    return B(this, oe(t));
+    return _(this, ce(t));
   }
   /**
    * Specifies a skew transformation along the `y-axis` by the given angle.
@@ -347,7 +347,7 @@ class C {
    * @return The resulted matrix
    */
   skewY(t) {
-    return B(this, ce(t));
+    return _(this, le(t));
   }
   /**
    * Specifies a skew transformation along both the `x-axis` and `y-axis`.
@@ -358,7 +358,7 @@ class C {
    * @return The resulted matrix
    */
   skew(t, s) {
-    return B(this, At(t, s));
+    return _(this, At(t, s));
   }
   /**
    * Transforms a specified vector using the matrix, returning a new
@@ -381,11 +381,11 @@ class C {
     };
   }
 }
-q(C, "Translate", ne), q(C, "Rotate", se), q(C, "RotateAxisAngle", re), q(C, "Scale", ie), q(C, "SkewX", oe), q(C, "SkewY", ce), q(C, "Skew", At), q(C, "Multiply", B), q(C, "fromArray", ht), q(C, "fromMatrix", te), q(C, "fromString", ee), q(C, "toArray", vt), q(C, "isCompatibleArray", Vt), q(C, "isCompatibleObject", Gt);
+S(T, "Translate", se), S(T, "Rotate", re), S(T, "RotateAxisAngle", ie), S(T, "Scale", oe), S(T, "SkewX", ce), S(T, "SkewY", le), S(T, "Skew", At), S(T, "Multiply", _), S(T, "fromArray", lt), S(T, "fromMatrix", ee), S(T, "fromString", ne), S(T, "toArray", zt), S(T, "isCompatibleArray", Gt), S(T, "isCompatibleObject", te);
 const V = {
   origin: [0, 0, 0],
   round: 4
-}, nt = {
+}, tt = {
   a: 7,
   c: 6,
   h: 1,
@@ -397,16 +397,20 @@ const V = {
   t: 2,
   v: 1,
   z: 0
-}, Tt = (e) => {
+}, qt = (e) => {
   let t = e.pathValue[e.segmentStart], s = t.toLowerCase();
   const { data: r } = e;
-  for (; r.length >= nt[s] && (s === "m" && r.length > 2 ? (e.segments.push([t].concat(r.splice(0, 2))), s = "l", t = t === "m" ? "l" : "L") : e.segments.push(
+  for (; r.length >= tt[s] && (s === "m" && r.length > 2 ? (e.segments.push(
+    [t].concat(
+      r.splice(0, 2)
+    )
+  ), s = "l", t = t === "m" ? "l" : "L") : e.segments.push(
     [t].concat(
-      r.splice(0, nt[s])
+      r.splice(0, tt[s])
     )
-  ), !!nt[s]); )
+  ), !!tt[s]); )
     ;
-}, E = "SVGPathCommander Error", ae = (e) => {
+}, j = "SVGPathCommander Error", ae = (e) => {
   const { index: t, pathValue: s } = e, r = s.charCodeAt(t);
   if (r === 48) {
     e.param = 0, e.index += 1;
@@ -416,47 +420,47 @@ const V = {
     e.param = 1, e.index += 1;
     return;
   }
-  e.err = `${E}: invalid Arc flag "${s[t]}", expecting 0 or 1 at index ${t}`;
-}, H = (e) => e >= 48 && e <= 57, U = "Invalid path value", le = (e) => {
+  e.err = `${j}: invalid Arc flag "${s[t]}", expecting 0 or 1 at index ${t}`;
+}, U = (e) => e >= 48 && e <= 57, J = "Invalid path value", ue = (e) => {
   const { max: t, pathValue: s, index: r } = e;
-  let n = r, i = !1, o = !1, a = !1, c = !1, l;
+  let n = r, i = !1, o = !1, l = !1, c = !1, a;
   if (n >= t) {
-    e.err = `${E}: ${U} at index ${n}, "pathValue" is missing param`;
+    e.err = `${j}: ${J} at index ${n}, "pathValue" is missing param`;
     return;
   }
-  if (l = s.charCodeAt(n), (l === 43 || l === 45) && (n += 1, l = s.charCodeAt(n)), !H(l) && l !== 46) {
-    e.err = `${E}: ${U} at index ${n}, "${s[n]}" is not a number`;
+  if (a = s.charCodeAt(n), (a === 43 || a === 45) && (n += 1, a = s.charCodeAt(n)), !U(a) && a !== 46) {
+    e.err = `${j}: ${J} at index ${n}, "${s[n]}" is not a number`;
     return;
   }
-  if (l !== 46) {
-    if (i = l === 48, n += 1, l = s.charCodeAt(n), i && n < t && l && H(l)) {
-      e.err = `${E}: ${U} at index ${r}, "${s[r]}" illegal number`;
+  if (a !== 46) {
+    if (i = a === 48, n += 1, a = s.charCodeAt(n), i && n < t && a && U(a)) {
+      e.err = `${j}: ${J} at index ${r}, "${s[r]}" illegal number`;
       return;
     }
-    for (; n < t && H(s.charCodeAt(n)); )
+    for (; n < t && U(s.charCodeAt(n)); )
       n += 1, o = !0;
-    l = s.charCodeAt(n);
+    a = s.charCodeAt(n);
   }
-  if (l === 46) {
-    for (c = !0, n += 1; H(s.charCodeAt(n)); )
-      n += 1, a = !0;
-    l = s.charCodeAt(n);
+  if (a === 46) {
+    for (c = !0, n += 1; U(s.charCodeAt(n)); )
+      n += 1, l = !0;
+    a = s.charCodeAt(n);
   }
-  if (l === 101 || l === 69) {
-    if (c && !o && !a) {
-      e.err = `${E}: ${U} at index ${n}, "${s[n]}" invalid float exponent`;
+  if (a === 101 || a === 69) {
+    if (c && !o && !l) {
+      e.err = `${j}: ${J} at index ${n}, "${s[n]}" invalid float exponent`;
       return;
     }
-    if (n += 1, l = s.charCodeAt(n), (l === 43 || l === 45) && (n += 1), n < t && H(s.charCodeAt(n)))
-      for (; n < t && H(s.charCodeAt(n)); )
+    if (n += 1, a = s.charCodeAt(n), (a === 43 || a === 45) && (n += 1), n < t && U(s.charCodeAt(n)))
+      for (; n < t && U(s.charCodeAt(n)); )
         n += 1;
     else {
-      e.err = `${E}: ${U} at index ${n}, "${s[n]}" invalid integer exponent`;
+      e.err = `${j}: ${J} at index ${n}, "${s[n]}" invalid integer exponent`;
       return;
     }
   }
   e.index = n, e.param = +e.pathValue.slice(r, n);
-}, ue = (e) => [
+}, me = (e) => [
   // Special spaces
   5760,
   6158,
@@ -486,11 +490,11 @@ const V = {
   11,
   12,
   160
-].includes(e), st = (e) => {
+].includes(e), et = (e) => {
   const { pathValue: t, max: s } = e;
-  for (; e.index < s && ue(t.charCodeAt(e.index)); )
+  for (; e.index < s && me(t.charCodeAt(e.index)); )
     e.index += 1;
-}, me = (e) => {
+}, fe = (e) => {
   switch (e | 32) {
     case 109:
     case 122:
@@ -506,7 +510,7 @@ const V = {
     default:
       return !1;
   }
-}, he = (e) => H(e) || e === 43 || e === 45 || e === 46, fe = (e) => (e | 32) === 97, ye = (e) => {
+}, he = (e) => U(e) || e === 43 || e === 45 || e === 46, ye = (e) => (e | 32) === 97, ge = (e) => {
   switch (e | 32) {
     case 109:
     case 77:
@@ -514,48 +518,48 @@ const V = {
     default:
       return !1;
   }
-}, Et = (e) => {
+}, Dt = (e) => {
   var c;
-  const { max: t, pathValue: s, index: r, segments: n } = e, i = s.charCodeAt(r), o = nt[s[r].toLowerCase()];
-  if (e.segmentStart = r, !me(i)) {
-    e.err = `${E}: ${U} "${s[r]}" is not a path command at index ${r}`;
+  const { max: t, pathValue: s, index: r, segments: n } = e, i = s.charCodeAt(r), o = tt[s[r].toLowerCase()];
+  if (e.segmentStart = r, !fe(i)) {
+    e.err = `${j}: ${J} "${s[r]}" is not a path command at index ${r}`;
     return;
   }
-  const a = n[n.length - 1];
-  if (!ye(i) && ((c = a == null ? void 0 : a[0]) == null ? void 0 : c.toLocaleLowerCase()) === "z") {
-    e.err = `${E}: ${U} "${s[r]}" is not a MoveTo path command at index ${r}`;
+  const l = n[n.length - 1];
+  if (!ge(i) && ((c = l == null ? void 0 : l[0]) == null ? void 0 : c.toLocaleLowerCase()) === "z") {
+    e.err = `${j}: ${J} "${s[r]}" is not a MoveTo path command at index ${r}`;
     return;
   }
-  if (e.index += 1, st(e), e.data = [], !o) {
-    Tt(e);
+  if (e.index += 1, et(e), e.data = [], !o) {
+    qt(e);
     return;
   }
   for (; ; ) {
-    for (let l = o; l > 0; l -= 1) {
-      if (fe(i) && (l === 3 || l === 4) ? ae(e) : le(e), e.err.length)
+    for (let a = o; a > 0; a -= 1) {
+      if (ye(i) && (a === 3 || a === 4) ? ae(e) : ue(e), e.err.length)
         return;
-      e.data.push(e.param), st(e), e.index < t && s.charCodeAt(e.index) === 44 && (e.index += 1, st(e));
+      e.data.push(e.param), et(e), e.index < t && s.charCodeAt(e.index) === 44 && (e.index += 1, et(e));
     }
     if (e.index >= e.max || !he(s.charCodeAt(e.index)))
       break;
   }
-  Tt(e);
+  qt(e);
 };
-class Rt {
+class Ot {
   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 R = (e) => {
+const Q = (e) => {
   if (typeof e != "string")
     return e.slice(0);
-  const t = new Rt(e);
-  for (st(t); t.index < t.max && !t.err.length; )
-    Et(t);
+  const t = new Ot(e);
+  for (et(t); t.index < t.max && !t.err.length; )
+    Dt(t);
   if (t != null && t.err.length)
     throw TypeError(t.err);
   return t.segments;
-}, jt = (e, t, s, r) => {
+}, at = (e, t, s, r) => {
   const [n] = e, i = n.toUpperCase();
   if (t === 0 || i === n) return e;
   if (i === "A")
@@ -574,25 +578,31 @@ const R = (e) => {
   if (i === "H")
     return [i, e[1] + s];
   if (i === "L")
-    return [i, e[1] + s, e[2] + r];
+    return [
+      i,
+      e[1] + s,
+      e[2] + r
+    ];
   {
-    const a = e.slice(1).map((c, l) => c + (l % 2 ? r : s));
-    return [i].concat(a);
-  }
-}, j = (e, t) => {
-  let s = e.length, r, n = "M", i = "M", o = !1, a = 0, c = 0, l = 0, u = 0, m = 0;
-  for (let f = 0; f < s; f += 1) {
-    r = e[f], [n] = r, m = r.length, i = n.toUpperCase(), o = i !== n;
-    const y = t(r, f, a, c);
-    if (y === !1)
+    const l = [], c = e.length;
+    for (let a = 1; a < c; a += 1)
+      l.push(e[a] + (a % 2 ? s : r));
+    return [i].concat(l);
+  }
+}, Z = (e, t) => {
+  let s = e.length, r, n = "M", i = "M", o = !1, l = 0, c = 0, a = 0, u = 0, m = 0;
+  for (let h = 0; h < s; h += 1) {
+    r = e[h], [n] = r, m = r.length, i = n.toUpperCase(), o = i !== n;
+    const g = t(r, h, l, c);
+    if (g === !1)
       break;
-    i === "Z" ? (a = l, c = u) : i === "H" ? a = r[1] + (o ? a : 0) : i === "V" ? c = r[1] + (o ? c : 0) : (a = r[m - 2] + (o ? a : 0), c = r[m - 1] + (o ? c : 0), i === "M" && (l = a, u = c)), y && (e[f] = y, y[0] === "C" && (s = e.length));
+    i === "Z" ? (l = a, c = u) : i === "H" ? l = r[1] + (o ? l : 0) : i === "V" ? c = r[1] + (o ? c : 0) : (l = r[m - 2] + (o ? l : 0), c = r[m - 1] + (o ? c : 0), i === "M" && (a = l, u = c)), g && (e[h] = g, g[0] === "C" && (s = e.length));
   }
   return e;
-}, xt = (e) => {
-  const t = R(e);
-  return j(t, jt);
-}, St = (e, t, s, r) => {
+}, ht = (e) => {
+  const t = Q(e);
+  return Z(t, at);
+}, Bt = (e, t, s, r) => {
   const [n] = e, i = n.toLowerCase();
   if (t === 0 || n === i) return e;
   if (i === "a")
@@ -611,115 +621,155 @@ const R = (e) => {
   if (i === "h")
     return [i, e[1] - s];
   if (i === "l")
-    return [i, e[1] - s, e[2] - r];
+    return [
+      i,
+      e[1] - s,
+      e[2] - r
+    ];
   {
-    const a = e.slice(1).map((c, l) => c - (l % 2 ? r : s));
-    return [i].concat(a);
+    const l = [], c = e.length;
+    for (let a = 1; a < c; a += 1)
+      l.push(e[a] - (a % 2 ? s : r));
+    return [i].concat(l);
   }
-}, Xt = (e) => {
-  const t = R(e);
-  return j(t, St);
-}, ct = (e, t, s) => {
+}, Kt = (e) => {
+  const t = Q(e);
+  return Z(t, Bt);
+}, st = (e, t, s) => {
   const { sin: r, cos: n } = Math, i = e * n(s) - t * r(s), o = e * r(s) + t * n(s);
   return { x: i, y: o };
-}, Dt = (e, t, s, r, n, i, o, a, c, l) => {
-  let u = e, m = t, f = s, y = r, h = a, x = c;
-  const b = Math.PI * 120 / 180, A = Math.PI / 180 * (+n || 0);
-  let w = [], N, M, d, v, L;
-  if (l)
-    [M, d, v, L] = l;
+}, Mt = (e, t, s, r, n, i, o, l, c, a) => {
+  let u = e, m = t, h = s, g = r, f = l, y = c;
+  const p = Math.PI * 120 / 180, M = Math.PI / 180 * (+n || 0);
+  let N = [], x, b, L, C, I;
+  if (a)
+    [b, L, C, I] = a;
   else {
-    N = ct(u, m, -A), u = N.x, m = N.y, N = ct(h, x, -A), h = N.x, x = N.y;
-    const $ = (u - h) / 2, P = (m - x) / 2;
-    let Q = $ * $ / (f * f) + P * P / (y * y);
-    Q > 1 && (Q = Math.sqrt(Q), f *= Q, y *= Q);
-    const F = f * f, D = y * y, Ut = (i === o ? -1 : 1) * Math.sqrt(Math.abs((F * D - F * P * P - D * $ * $) / (F * P * P + D * $ * $)));
-    v = Ut * f * P / y + (u + h) / 2, L = Ut * -y * $ / f + (m + x) / 2, M = Math.asin(((m - L) / y * 10 ** 9 >> 0) / 10 ** 9), d = Math.asin(((x - L) / y * 10 ** 9 >> 0) / 10 ** 9), M = u < v ? Math.PI - M : M, d = h < v ? Math.PI - d : d, M < 0 && (M = Math.PI * 2 + M), d < 0 && (d = Math.PI * 2 + d), o && M > d && (M -= Math.PI * 2), !o && d > M && (d -= Math.PI * 2);
-  }
-  let T = d - M;
-  if (Math.abs(T) > b) {
-    const $ = d, P = h, Q = x;
-    d = M + b * (o && d > M ? 1 : -1), h = v + f * Math.cos(d), x = L + y * Math.sin(d), w = Dt(h, x, f, y, n, 0, o, P, Q, [d, $, v, L]);
-  }
-  T = d - M;
-  const Z = Math.cos(M), k = Math.sin(M), it = Math.cos(d), tt = Math.sin(d), _ = Math.tan(T / 4), et = 4 / 3 * f * _, I = 4 / 3 * y * _, J = [u, m], S = [u + et * k, m - I * Z], Y = [h + et * tt, x - I * it], K = [h, x];
-  if (S[0] = 2 * J[0] - S[0], S[1] = 2 * J[1] - S[1], l)
-    return [S[0], S[1], Y[0], Y[1], K[0], K[1]].concat(w);
-  w = [S[0], S[1], Y[0], Y[1], K[0], K[1]].concat(w);
-  const ot = [];
-  for (let $ = 0, P = w.length; $ < P; $ += 1)
-    ot[$] = $ % 2 ? ct(w[$ - 1], w[$], A).y : ct(w[$], w[$ + 1], A).x;
-  return ot;
+    x = st(u, m, -M), u = x.x, m = x.y, x = st(f, y, -M), f = x.x, y = x.y;
+    const v = (u - f) / 2, O = (m - y) / 2;
+    let X = v * v / (h * h) + O * O / (g * g);
+    X > 1 && (X = Math.sqrt(X), h *= X, g *= X);
+    const Tt = h * h, $t = g * g, Jt = (i === o ? -1 : 1) * Math.sqrt(
+      Math.abs(
+        (Tt * $t - Tt * O * O - $t * v * v) / (Tt * O * O + $t * v * v)
+      )
+    );
+    C = Jt * h * O / g + (u + f) / 2, I = Jt * -g * v / h + (m + y) / 2, b = Math.asin(((m - I) / g * 10 ** 9 >> 0) / 10 ** 9), L = Math.asin(((y - I) / g * 10 ** 9 >> 0) / 10 ** 9), b = u < C ? Math.PI - b : b, L = f < C ? Math.PI - L : L, b < 0 && (b = Math.PI * 2 + b), L < 0 && (L = Math.PI * 2 + L), o && b > L && (b -= Math.PI * 2), !o && L > b && (L -= Math.PI * 2);
+  }
+  let R = L - b;
+  if (Math.abs(R) > p) {
+    const v = L, O = f, X = y;
+    L = b + p * (o && L > b ? 1 : -1), f = C + h * Math.cos(L), y = I + g * Math.sin(L), N = Mt(f, y, h, g, n, 0, o, O, X, [
+      L,
+      v,
+      C,
+      I
+    ]);
+  }
+  R = L - b;
+  const P = Math.cos(b), z = Math.sin(b), D = Math.cos(L), K = Math.sin(L), q = Math.tan(R / 4), w = 4 / 3 * h * q, $ = 4 / 3 * g * q, E = [u, m], B = [u + w * z, m - $ * P], F = [f + w * K, y - $ * D], G = [f, y];
+  if (B[0] = 2 * E[0] - B[0], B[1] = 2 * E[1] - B[1], a)
+    return [B[0], B[1], F[0], F[1], G[0], G[1]].concat(N);
+  N = [B[0], B[1], F[0], F[1], G[0], G[1]].concat(N);
+  const W = [];
+  for (let v = 0, O = N.length; v < O; v += 1)
+    W[v] = v % 2 ? st(N[v - 1], N[v], M).y : st(N[v], N[v + 1], M).x;
+  return W;
 }, xe = (e, t, s, r, n, i) => {
-  const o = 0.3333333333333333, a = 2 / 3;
+  const o = 0.3333333333333333, l = 2 / 3;
   return [
-    o * e + a * s,
+    o * e + l * s,
     // cpx1
-    o * t + a * r,
+    o * t + l * r,
     // cpy1
-    o * n + a * s,
+    o * n + l * s,
     // cpx2
-    o * i + a * r,
+    o * i + l * r,
     // cpy2
     n,
     i
     // x,y
   ];
-}, O = (e, t, s) => {
+}, H = (e, t, s) => {
   const [r, n] = e, [i, o] = t;
   return [r + (i - r) * s, n + (o - n) * s];
-}, Ct = (e, t, s, r) => {
-  const n = O([e, t], [s, r], 0.3333333333333333), i = O([e, t], [s, r], 2 / 3);
+}, Pt = (e, t, s, r) => {
+  const n = H([e, t], [s, r], 0.3333333333333333), i = H([e, t], [s, r], 2 / 3);
   return [n[0], n[1], i[0], i[1], s, r];
-}, Zt = (e, t) => {
-  const [s] = e, r = e.slice(1).map(Number), [n, i] = r, { x1: o, y1: a, x: c, y: l } = t;
+}, pe = (e, t) => {
+  const [s] = e, r = e.slice(1).map(Number), [n, i] = r, { x1: o, y1: l, x: c, y: a } = t;
   return "TQ".includes(s) || (t.qx = null, t.qy = null), s === "M" ? (t.x = n, t.y = i, e) : s === "A" ? ["C"].concat(
-    Dt(o, a, r[0], r[1], r[2], r[3], r[4], r[5], r[6])
+    Mt(
+      o,
+      l,
+      r[0],
+      r[1],
+      r[2],
+      r[3],
+      r[4],
+      r[5],
+      r[6]
+    )
   ) : s === "Q" ? (t.qx = n, t.qy = i, ["C"].concat(
-    xe(o, a, r[0], r[1], r[2], r[3])
-  )) : s === "L" ? ["C"].concat(Ct(o, a, n, i)) : s === "Z" ? ["C"].concat(Ct(o, a, c, l)) : e;
-}, G = (e, t) => {
-  const [s] = e, r = s.toUpperCase(), n = s !== r, { x1: i, y1: o, x2: a, y2: c, x: l, y: u } = t, m = e.slice(1);
-  let f = m.map((y, h) => y + (n ? h % 2 ? u : l : 0));
+    xe(o, l, r[0], r[1], r[2], r[3])
+  )) : s === "L" ? ["C"].concat(
+    Pt(o, l, n, i)
+  ) : s === "Z" ? ["C"].concat(
+    Pt(o, l, c, a)
+  ) : e;
+}, wt = (e, t) => {
+  const [s] = e, r = s.toUpperCase(), n = s !== r, { x1: i, y1: o, x2: l, y2: c, x: a, y: u } = t, m = e.slice(1);
+  let h = m.map((g, f) => g + (n ? f % 2 ? u : a : 0));
   if ("TQ".includes(r) || (t.qx = null, t.qy = null), r === "A")
-    return f = m.slice(0, -2).concat(m[5] + (n ? l : 0), m[6] + (n ? u : 0)), ["A"].concat(f);
+    return h = m.slice(0, -2).concat(
+      m[5] + (n ? a : 0),
+      m[6] + (n ? u : 0)
+    ), ["A"].concat(h);
   if (r === "H")
-    return ["L", e[1] + (n ? l : 0), o];
+    return [
+      "L",
+      e[1] + (n ? a : 0),
+      o
+    ];
   if (r === "V")
-    return ["L", i, e[1] + (n ? u : 0)];
+    return [
+      "L",
+      i,
+      e[1] + (n ? u : 0)
+    ];
   if (r === "L")
     return [
       "L",
-      e[1] + (n ? l : 0),
+      e[1] + (n ? a : 0),
       e[2] + (n ? u : 0)
     ];
   if (r === "M")
     return [
       "M",
-      e[1] + (n ? l : 0),
+      e[1] + (n ? a : 0),
       e[2] + (n ? u : 0)
     ];
   if (r === "C")
-    return ["C"].concat(f);
+    return ["C"].concat(h);
   if (r === "S") {
-    const y = i * 2 - a, h = o * 2 - c;
-    return t.x1 = y, t.y1 = h, ["C", y, h].concat(f);
+    const g = i * 2 - l, f = o * 2 - c;
+    return t.x1 = g, t.y1 = f, ["C", g, f].concat(h);
   } else if (r === "T") {
-    const y = i * 2 - (t.qx ? t.qx : (
+    const g = i * 2 - (t.qx ? t.qx : (
       /* istanbul ignore next */
       0
-    )), h = o * 2 - (t.qy ? t.qy : (
+    )), f = o * 2 - (t.qy ? t.qy : (
       /* istanbul ignore next */
       0
     ));
-    return t.qx = y, t.qy = h, ["Q", y, h].concat(f);
+    return t.qx = g, t.qy = f, ["Q", g, f].concat(h);
   } else if (r === "Q") {
-    const [y, h] = f;
-    return t.qx = y, t.qy = h, ["Q"].concat(f);
+    const [g, f] = h;
+    return t.qx = g, t.qy = f, ["Q"].concat(h);
   } else if (r === "Z")
     return ["Z"];
   return e;
-}, X = {
+}, ut = {
   x1: 0,
   y1: 0,
   x2: 0,
@@ -728,20 +778,24 @@ const R = (e) => {
   y: 0,
   qx: null,
   qy: null
-}, gt = (e) => {
-  const t = { ...X }, s = R(e);
-  return j(s, (r, n, i, o) => {
+}, yt = (e) => {
+  const t = { ...ut }, s = Q(e);
+  return Z(s, (r, n, i, o) => {
     t.x = i, t.y = o;
-    const a = G(r, t);
-    let c = Zt(a, t);
-    c[0] === "C" && c.length > 7 && (s.splice(n + 1, 0, ["C"].concat(c.slice(7))), c = c.slice(0, 7));
+    const l = wt(r, t);
+    let c = pe(l, t);
+    c[0] === "C" && c.length > 7 && (s.splice(
+      n + 1,
+      0,
+      ["C"].concat(c.slice(7))
+    ), c = c.slice(0, 7));
     const u = c.length;
     return t.x1 = +c[u - 2], t.y1 = +c[u - 1], t.x2 = +c[u - 4] || t.x1, t.y2 = +c[u - 3] || t.y1, c;
   });
-}, z = (e, t) => {
+}, k = (e, t) => {
   const s = t >= 1 ? 10 ** t : 1;
   return t > 0 ? Math.round(e * s) / s : Math.round(e);
-}, $t = (e, t) => {
+}, kt = (e, t) => {
   const s = e.length;
   let { round: r } = V, n = e[0], i = "";
   r = t === "off" || typeof t == "number" && t >= 0 ? t : typeof r == "number" && r >= 0 ? r : (
@@ -750,153 +804,182 @@ const R = (e) => {
   );
   for (let o = 0; o < s; o += 1) {
     n = e[o];
-    const [a] = n, c = n.slice(1);
-    if (i += a, r === "off")
+    const [l] = n, c = n.slice(1);
+    if (i += l, r === "off")
       i += c.join(" ");
     else {
-      let l = 0;
+      let a = 0;
       const u = c.length;
-      for (; l < u; )
-        i += z(c[l], r), l !== u - 1 && (i += " "), l += 1;
+      for (; a < u; )
+        i += k(c[a], r), a !== u - 1 && (i += " "), a += 1;
     }
   }
   return i;
-}, Mt = (e, t) => Math.sqrt((e[0] - t[0]) * (e[0] - t[0]) + (e[1] - t[1]) * (e[1] - t[1])), lt = (e, t, s, r) => Mt([e, t], [s, r]), Ot = (e, t, s, r, n) => {
+}, Nt = (e, t) => Math.sqrt(
+  (e[0] - t[0]) * (e[0] - t[0]) + (e[1] - t[1]) * (e[1] - t[1])
+), it = (e, t, s, r) => Nt([e, t], [s, r]), Ht = (e, t, s, r, n) => {
   let i = { x: e, y: t };
   if (typeof n == "number") {
-    const o = Mt([e, t], [s, r]);
+    const o = Nt([e, t], [s, r]);
     if (n <= 0)
       i = { x: e, y: t };
     else if (n >= o)
       i = { x: s, y: r };
     else {
-      const [a, c] = O([e, t], [s, r], n / o);
-      i = { x: a, y: c };
+      const [l, c] = H([e, t], [s, r], n / o);
+      i = { x: l, y: c };
     }
   }
   return i;
-}, zt = (e, t, s, r) => {
+}, It = (e, t, s, r) => {
   const { min: n, max: i } = Math;
-  return {
-    min: {
-      x: n(e, s),
-      y: n(t, r)
-    },
-    max: {
-      x: i(e, s),
-      y: i(t, r)
-    }
-  };
-}, Qt = (e, t, s) => {
-  const r = s / 2, n = Math.sin(r), i = Math.cos(r), o = e ** 2 * n ** 2, a = t ** 2 * i ** 2, c = Math.sqrt(o + a) * s;
+  return [n(e, s), n(t, r), i(e, s), i(t, r)];
+}, Ft = (e, t, s) => {
+  const r = s / 2, n = Math.sin(r), i = Math.cos(r), o = e ** 2 * n ** 2, l = t ** 2 * i ** 2, c = Math.sqrt(o + l) * s;
   return Math.abs(c);
-}, W = (e, t, s, r, n, i) => {
-  const { sin: o, cos: a } = Math, c = a(n), l = o(n), u = s * a(i), m = r * o(i);
-  return {
-    x: e + c * u - l * m,
-    y: t + l * u + c * m
-  };
-}, Pt = (e, t) => {
-  const { x: s, y: r } = e, { x: n, y: i } = t, o = s * n + r * i, a = Math.sqrt((s ** 2 + r ** 2) * (n ** 2 + i ** 2));
-  return (s * i - r * n < 0 ? -1 : 1) * Math.acos(o / a);
-}, wt = (e, t, s, r, n, i, o, a, c) => {
-  const { abs: l, sin: u, cos: m, sqrt: f, PI: y } = Math;
-  let h = l(s), x = l(r);
-  const A = (n % 360 + 360) % 360 * (y / 180);
-  if (e === a && t === c)
+}, Y = (e, t, s, r, n, i) => {
+  const { sin: o, cos: l } = Math, c = l(n), a = o(n), u = s * l(i), m = r * o(i);
+  return [e + c * u - a * m, t + a * u + c * m];
+}, Et = (e, t) => {
+  const { x: s, y: r } = e, { x: n, y: i } = t, o = s * n + r * i, l = Math.sqrt((s ** 2 + r ** 2) * (n ** 2 + i ** 2));
+  return (s * i - r * n < 0 ? -1 : 1) * Math.acos(o / l);
+}, Lt = (e, t, s, r, n, i, o, l, c) => {
+  const { abs: a, sin: u, cos: m, sqrt: h, PI: g } = Math;
+  let f = a(s), y = a(r);
+  const M = (n % 360 + 360) % 360 * (g / 180);
+  if (e === l && t === c)
     return {
-      rx: h,
-      ry: x,
+      rx: f,
+      ry: y,
       startAngle: 0,
       endAngle: 0,
-      center: { x: a, y: c }
+      center: { x: l, y: c }
     };
-  if (h === 0 || x === 0)
+  if (f === 0 || y === 0)
     return {
-      rx: h,
-      ry: x,
+      rx: f,
+      ry: y,
       startAngle: 0,
       endAngle: 0,
-      center: { x: (a + e) / 2, y: (c + t) / 2 }
+      center: { x: (l + e) / 2, y: (c + t) / 2 }
     };
-  const w = (e - a) / 2, N = (t - c) / 2, M = {
-    x: m(A) * w + u(A) * N,
-    y: -u(A) * w + m(A) * N
-  }, d = M.x ** 2 / h ** 2 + M.y ** 2 / x ** 2;
-  d > 1 && (h *= f(d), x *= f(d));
-  const v = h ** 2 * x ** 2 - h ** 2 * M.y ** 2 - x ** 2 * M.x ** 2, L = h ** 2 * M.y ** 2 + x ** 2 * M.x ** 2;
-  let T = v / L;
-  T = T < 0 ? 0 : T;
-  const Z = (i !== o ? 1 : -1) * f(T), k = {
-    x: Z * (h * M.y / x),
-    y: Z * (-(x * M.x) / h)
-  }, it = {
-    x: m(A) * k.x - u(A) * k.y + (e + a) / 2,
-    y: u(A) * k.x + m(A) * k.y + (t + c) / 2
-  }, tt = {
-    x: (M.x - k.x) / h,
-    y: (M.y - k.y) / x
-  }, _ = Pt({ x: 1, y: 0 }, tt), et = {
-    x: (-M.x - k.x) / h,
-    y: (-M.y - k.y) / x
+  const N = (e - l) / 2, x = (t - c) / 2, b = {
+    x: m(M) * N + u(M) * x,
+    y: -u(M) * N + m(M) * x
+  }, L = b.x ** 2 / f ** 2 + b.y ** 2 / y ** 2;
+  L > 1 && (f *= h(L), y *= h(L));
+  const C = f ** 2 * y ** 2 - f ** 2 * b.y ** 2 - y ** 2 * b.x ** 2, I = f ** 2 * b.y ** 2 + y ** 2 * b.x ** 2;
+  let R = C / I;
+  R = R < 0 ? 0 : R;
+  const P = (i !== o ? 1 : -1) * h(R), z = {
+    x: P * (f * b.y / y),
+    y: P * (-(y * b.x) / f)
+  }, D = {
+    x: m(M) * z.x - u(M) * z.y + (e + l) / 2,
+    y: u(M) * z.x + m(M) * z.y + (t + c) / 2
+  }, K = {
+    x: (b.x - z.x) / f,
+    y: (b.y - z.y) / y
+  }, q = Et({ x: 1, y: 0 }, K), w = {
+    x: (-b.x - z.x) / f,
+    y: (-b.y - z.y) / y
   };
-  let I = Pt(tt, et);
-  !o && I > 0 ? I -= 2 * y : o && I < 0 && (I += 2 * y), I %= 2 * y;
-  const J = _ + I;
+  let $ = Et(K, w);
+  !o && $ > 0 ? $ -= 2 * g : o && $ < 0 && ($ += 2 * g), $ %= 2 * g;
+  const E = q + $;
   return {
-    center: it,
-    startAngle: _,
-    endAngle: J,
-    rx: h,
-    ry: x
+    center: D,
+    startAngle: q,
+    endAngle: E,
+    rx: f,
+    ry: y
   };
-}, Bt = (e, t, s, r, n, i, o, a, c) => {
-  const { rx: l, ry: u, startAngle: m, endAngle: f } = wt(e, t, s, r, n, i, o, a, c);
-  return Qt(l, u, f - m);
-}, ge = (e, t, s, r, n, i, o, a, c, l) => {
+}, _t = (e, t, s, r, n, i, o, l, c) => {
+  const { rx: a, ry: u, startAngle: m, endAngle: h } = Lt(
+    e,
+    t,
+    s,
+    r,
+    n,
+    i,
+    o,
+    l,
+    c
+  );
+  return Ft(a, u, h - m);
+}, be = (e, t, s, r, n, i, o, l, c, a) => {
   let u = { x: e, y: t };
-  const { center: m, rx: f, ry: y, startAngle: h, endAngle: x } = wt(e, t, s, r, n, i, o, a, c);
-  if (typeof l == "number") {
-    const b = Qt(f, y, x - h);
-    if (l <= 0)
+  const { center: m, rx: h, ry: g, startAngle: f, endAngle: y } = Lt(
+    e,
+    t,
+    s,
+    r,
+    n,
+    i,
+    o,
+    l,
+    c
+  );
+  if (typeof a == "number") {
+    const p = Ft(h, g, y - f);
+    if (a <= 0)
       u = { x: e, y: t };
-    else if (l >= b)
-      u = { x: a, y: c };
+    else if (a >= p)
+      u = { x: l, y: c };
     else {
-      if (e === a && t === c)
-        return { x: a, y: c };
-      if (f === 0 || y === 0)
-        return Ot(e, t, a, c, l);
-      const { PI: A, cos: w, sin: N } = Math, M = x - h, v = (n % 360 + 360) % 360 * (A / 180), L = h + M * (l / b), T = f * w(L), Z = y * N(L);
+      if (e === l && t === c)
+        return { x: l, y: c };
+      if (h === 0 || g === 0)
+        return Ht(e, t, l, c, a);
+      const { PI: M, cos: N, sin: x } = Math, b = y - f, C = (n % 360 + 360) % 360 * (M / 180), I = f + b * (a / p), R = h * N(I), P = g * x(I);
       u = {
-        x: w(v) * T - N(v) * Z + m.x,
-        y: N(v) * T + w(v) * Z + m.y
+        x: N(C) * R - x(C) * P + m.x,
+        y: x(C) * R + N(C) * P + m.y
       };
     }
   }
   return u;
-}, pe = (e, t, s, r, n, i, o, a, c) => {
-  const { center: l, rx: u, ry: m, startAngle: f, endAngle: y } = wt(e, t, s, r, n, i, o, a, c), h = y - f, { min: x, max: b, tan: A, atan2: w, PI: N } = Math, M = { x: a, y: c }, { x: d, y: v } = l, L = [M], T = n * N / 180, Z = A(T), k = w(-m * Z, u), it = k, tt = k + N, _ = w(m, u * Z), et = _ + N, I = [e, a], J = [t, c], S = x(...I), Y = b(...I), K = x(...J), ot = b(...J), $ = y - h * 1e-3, P = W(d, v, u, m, T, $), Q = y - h * 0.999, F = W(d, v, u, m, T, Q);
-  return (P.x > Y || F.x > Y) && L.push(W(d, v, u, m, T, it)), (P.x < S || F.x < S) && L.push(W(d, v, u, m, T, tt)), (P.y < K || F.y < K) && L.push(W(d, v, u, m, T, et)), (P.y > ot || F.y > ot) && L.push(W(d, v, u, m, T, _)), {
-    min: {
-      x: x(...L.map((D) => D.x)),
-      y: x(...L.map((D) => D.y))
-    },
-    max: {
-      x: b(...L.map((D) => D.x)),
-      y: b(...L.map((D) => D.y))
-    }
-  };
+}, de = (e, t, s, r, n, i, o, l, c) => {
+  const { center: a, rx: u, ry: m, startAngle: h, endAngle: g } = Lt(
+    e,
+    t,
+    s,
+    r,
+    n,
+    i,
+    o,
+    l,
+    c
+  ), f = g - h, { min: y, max: p, tan: M, atan2: N, PI: x } = Math, { x: b, y: L } = a, C = n * x / 180, I = M(C), R = N(-m * I, u), P = R, z = R + x, D = N(m, u * I), K = D + x;
+  let q = y(e, l), w = p(e, l), $ = y(t, c), E = p(t, c);
+  const B = g - f * 1e-3, F = Y(b, L, u, m, C, B), G = g - f * 0.999, W = Y(b, L, u, m, C, G);
+  if (F[0] > w || W[0] > w) {
+    const v = Y(b, L, u, m, C, P);
+    q = y(q, v[0]), $ = y($, v[1]), w = p(w, v[0]), E = p(E, v[1]);
+  }
+  if (F[0] < q || W[0] < q) {
+    const v = Y(b, L, u, m, C, z);
+    q = y(q, v[0]), $ = y($, v[1]), w = p(w, v[0]), E = p(E, v[1]);
+  }
+  if (F[1] < $ || W[1] < $) {
+    const v = Y(b, L, u, m, C, K);
+    q = y(q, v[0]), $ = y($, v[1]), w = p(w, v[0]), E = p(E, v[1]);
+  }
+  if (F[1] > E || W[1] > E) {
+    const v = Y(b, L, u, m, C, D);
+    q = y(q, v[0]), $ = y($, v[1]), w = p(w, v[0]), E = p(E, v[1]);
+  }
+  return [q, $, w, E];
 }, Be = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
-  angleBetween: Pt,
-  arcLength: Qt,
-  arcPoint: W,
-  getArcBBox: pe,
-  getArcLength: Bt,
-  getArcProps: wt,
-  getPointAtArcLength: ge
-}, Symbol.toStringTag, { value: "Module" })), qt = [
+  angleBetween: Et,
+  arcLength: Ft,
+  arcPoint: Y,
+  getArcBBox: de,
+  getArcLength: _t,
+  getArcProps: Lt,
+  getPointAtArcLength: be
+}, Symbol.toStringTag, { value: "Module" })), Rt = [
   -0.06405689286260563,
   0.06405689286260563,
   -0.1911188674736163,
@@ -921,7 +1004,7 @@ const R = (e) => {
   0.9747285559713095,
   -0.9951872199970213,
   0.9951872199970213
-], be = [
+], Ae = [
   0.12793819534675216,
   0.12793819534675216,
   0.1258374563468283,
@@ -946,7 +1029,7 @@ const R = (e) => {
   0.028531388628933663,
   0.0123412297999872,
   0.0123412297999872
-], de = (e) => {
+], Me = (e) => {
   const t = [];
   for (let s = e, r = s.length, n = r - 1; r > 1; r -= 1, n -= 1) {
     const i = [];
@@ -959,7 +1042,7 @@ const R = (e) => {
     t.push(i), s = i;
   }
   return t;
-}, Ae = (e, t) => {
+}, we = (e, t) => {
   if (t === 0)
     return e[0].t = 0, e[0];
   const s = e.length - 1;
@@ -976,112 +1059,118 @@ const R = (e) => {
       t
     };
   const i = r * r, o = t * t;
-  let a = 0, c = 0, l = 0, u = 0;
-  return s === 2 ? (n = [n[0], n[1], n[2], { x: 0, y: 0 }], a = i, c = r * t * 2, l = o) : s === 3 && (a = i * r, c = i * t * 3, l = r * o * 3, u = t * o), {
-    x: a * n[0].x + c * n[1].x + l * n[2].x + u * n[3].x,
-    y: a * n[0].y + c * n[1].y + l * n[2].y + u * n[3].y,
+  let l = 0, c = 0, a = 0, u = 0;
+  return s === 2 ? (n = [n[0], n[1], n[2], { x: 0, y: 0 }], l = i, c = r * t * 2, a = o) : s === 3 && (l = i * r, c = i * t * 3, a = r * o * 3, u = t * o), {
+    x: l * n[0].x + c * n[1].x + a * n[2].x + u * n[3].x,
+    y: l * n[0].y + c * n[1].y + a * n[2].y + u * n[3].y,
     t
   };
-}, Me = (e, t) => {
+}, Ne = (e, t) => {
   const s = e(t), r = s.x * s.x + s.y * s.y;
   return Math.sqrt(r);
-}, we = (e) => {
-  const s = qt.length;
+}, Le = (e) => {
+  const s = Rt.length;
   let r = 0;
   for (let n = 0, i; n < s; n++)
-    i = 0.5 * qt[n] + 0.5, r += be[n] * Me(e, i);
+    i = 0.5 * Rt[n] + 0.5, r += Ae[n] * Ne(e, i);
   return 0.5 * r;
-}, ft = (e) => {
+}, mt = (e) => {
   const t = [];
   for (let r = 0, n = e.length, i = 2; r < n; r += i)
     t.push({
       x: e[r],
       y: e[r + 1]
     });
-  const s = de(t);
-  return we((r) => Ae(s[0], r));
-}, Ne = 1e-8, pt = ([e, t, s]) => {
+  const s = Me(t);
+  return Le((r) => we(s[0], r));
+}, ve = 1e-8, gt = ([e, t, s]) => {
   const r = Math.min(e, s), n = Math.max(e, s);
   if (t >= e ? s >= t : s <= t)
     return [r, n];
   const i = (e * s - t * t) / (e - 2 * t + s);
   return i < r ? [i, n] : [r, i];
-}, kt = ([e, t, s, r]) => {
+}, St = ([e, t, s, r]) => {
   const n = e - 3 * t + 3 * s - r;
-  if (Math.abs(n) < Ne)
-    return e === r && e === t ? [e, r] : pt([e, -0.5 * e + 1.5 * t, e - 3 * t + 3 * s]);
+  if (Math.abs(n) < ve)
+    return e === r && e === t ? [e, r] : gt([e, -0.5 * e + 1.5 * t, e - 3 * t + 3 * s]);
   const i = -e * s + e * r - t * s - t * r + t * t + s * s;
   if (i <= 0)
     return [Math.min(e, r), Math.max(e, r)];
   const o = Math.sqrt(i);
-  let a = Math.min(e, r), c = Math.max(e, r);
-  const l = e - 2 * t + s;
-  for (let u = (l + o) / n, m = 1; m <= 2; u = (l - o) / n, m++)
+  let l = Math.min(e, r), c = Math.max(e, r);
+  const a = e - 2 * t + s;
+  for (let u = (a + o) / n, m = 1; m <= 2; u = (a - o) / n, m++)
     if (u > 0 && u < 1) {
-      const f = e * (1 - u) * (1 - u) * (1 - u) + t * 3 * (1 - u) * (1 - u) * u + s * 3 * (1 - u) * u * u + r * u * u * u;
-      f < a && (a = f), f > c && (c = f);
+      const h = e * (1 - u) * (1 - u) * (1 - u) + t * 3 * (1 - u) * (1 - u) * u + s * 3 * (1 - u) * u * u + r * u * u * u;
+      h < l && (l = h), h > c && (c = h);
     }
-  return [a, c];
-}, Le = ([e, t, s, r, n, i, o, a], c) => {
-  const l = 1 - c;
+  return [l, c];
+}, Ce = ([e, t, s, r, n, i, o, l], c) => {
+  const a = 1 - c;
   return {
-    x: l ** 3 * e + 3 * l ** 2 * c * s + 3 * l * c ** 2 * n + c ** 3 * o,
-    y: l ** 3 * t + 3 * l ** 2 * c * r + 3 * l * c ** 2 * i + c ** 3 * a
+    x: a ** 3 * e + 3 * a ** 2 * c * s + 3 * a * c ** 2 * n + c ** 3 * o,
+    y: a ** 3 * t + 3 * a ** 2 * c * r + 3 * a * c ** 2 * i + c ** 3 * l
   };
-}, _t = (e, t, s, r, n, i, o, a) => ft([e, t, s, r, n, i, o, a]), ve = (e, t, s, r, n, i, o, a, c) => {
-  const l = typeof c == "number";
+}, xt = (e, t, s, r, n, i, o, l) => mt([e, t, s, r, n, i, o, l]), Te = (e, t, s, r, n, i, o, l, c) => {
+  const a = typeof c == "number";
   let u = { x: e, y: t };
-  if (l) {
-    const m = ft([e, t, s, r, n, i, o, a]);
-    c <= 0 || (c >= m ? u = { x: o, y: a } : u = Le([e, t, s, r, n, i, o, a], c / m));
+  if (a) {
+    const m = mt([e, t, s, r, n, i, o, l]);
+    c <= 0 || (c >= m ? u = { x: o, y: l } : u = Ce(
+      [e, t, s, r, n, i, o, l],
+      c / m
+    ));
   }
   return u;
-}, Te = (e, t, s, r, n, i, o, a) => {
-  const c = kt([e, s, n, o]), l = kt([t, r, i, a]);
+}, jt = (e, t, s, r, n, i, o, l) => {
+  const c = St([e, s, n, o]), a = St([t, r, i, l]);
+  return [c[0], a[0], c[1], a[1]];
+}, $e = ([e, t, s, r, n, i], o) => {
+  const l = 1 - o;
   return {
-    min: { x: c[0], y: l[0] },
-    max: { x: c[1], y: l[1] }
+    x: l ** 2 * e + 2 * l * o * s + o ** 2 * n,
+    y: l ** 2 * t + 2 * l * o * r + o ** 2 * i
   };
-}, Ce = ([e, t, s, r, n, i], o) => {
-  const a = 1 - o;
-  return {
-    x: a ** 2 * e + 2 * a * o * s + o ** 2 * n,
-    y: a ** 2 * t + 2 * a * o * r + o ** 2 * i
-  };
-}, Ft = (e, t, s, r, n, i) => ft([e, t, s, r, n, i]), $e = (e, t, s, r, n, i, o) => {
-  const a = typeof o == "number";
+}, pt = (e, t, s, r, n, i) => mt([e, t, s, r, n, i]), ze = (e, t, s, r, n, i, o) => {
+  const l = typeof o == "number";
   let c = { x: e, y: t };
-  if (a) {
-    const l = ft([e, t, s, r, n, i]);
-    o <= 0 || (o >= l ? c = { x: n, y: i } : c = Ce([e, t, s, r, n, i], o / l));
+  if (l) {
+    const a = mt([e, t, s, r, n, i]);
+    o <= 0 || (o >= a ? c = { x: n, y: i } : c = $e(
+      [e, t, s, r, n, i],
+      o / a
+    ));
   }
   return c;
-}, ze = (e, t, s, r, n, i) => {
-  const o = pt([e, s, n]), a = pt([t, r, i]);
-  return {
-    min: { x: o[0], y: a[0] },
-    max: { x: o[1], y: a[1] }
-  };
-}, _e = (e) => {
+}, Qt = (e, t, s, r, n, i) => {
+  const o = gt([e, s, n]), l = gt([t, r, i]);
+  return [o[0], l[0], o[1], l[1]];
+}, He = (e) => {
   const t = e.length;
   let s = -1, r, n = e[t - 1], i = 0;
   for (; ++s < t; )
     r = n, n = e[s], i += r[1] * n[0] - r[0] * n[1];
   return i / 2;
-}, Fe = (e) => e.reduce((t, s, r) => r ? t + Mt(e[r - 1], s) : 0, 0), bt = 1e-5, ut = (e) => {
-  const t = R(e), s = { ...X };
-  return j(t, (r, n, i, o) => {
+}, Fe = (e) => e.reduce((t, s, r) => r ? t + Nt(e[r - 1], s) : 0, 0), bt = 1e-5, ot = (e) => {
+  const t = Q(e), s = { ...ut };
+  return Z(t, (r, n, i, o) => {
     s.x = i, s.y = o;
-    const a = G(r, s), c = a.length;
-    return s.x1 = +a[c - 2], s.y1 = +a[c - 1], s.x2 = +a[c - 4] || s.x1, s.y2 = +a[c - 3] || s.y1, a;
+    const l = wt(r, s), c = l.length;
+    return s.x1 = +l[c - 2], s.y1 = +l[c - 1], s.x2 = +l[c - 4] || s.x1, s.y2 = +l[c - 3] || s.y1, l;
   });
-}, at = (e, t) => {
-  const s = ut(e);
-  let r = !1, n = [], i = "M", o = 0, a = 0, [c, l] = s[0].slice(1);
+}, rt = (e, t) => {
+  const s = ot(e);
+  let r = !1, n = [], i = "M", o = 0, l = 0, [c, a] = s[0].slice(1);
   const u = typeof t == "number";
-  let m = { x: c, y: l }, f = 0, y = m, h = 0;
-  return !u || t < bt ? m : (j(s, (x, b, A, w) => {
-    if ([i] = x, r = i === "M", n = r ? n : [A, w].concat(x.slice(1)), r ? ([, c, l] = x, m = { x: c, y: l }, f = 0) : i === "L" ? (m = Ot(n[0], n[1], n[2], n[3], t - h), f = lt(n[0], n[1], n[2], n[3])) : i === "A" ? (m = ge(
+  let m = { x: c, y: a }, h = 0, g = m, f = 0;
+  return !u || t < bt ? m : (Z(s, (y, p, M, N) => {
+    if ([i] = y, r = i === "M", n = r ? n : [M, N].concat(y.slice(1)), r ? ([, c, a] = y, m = { x: c, y: a }, h = 0) : i === "L" ? (m = Ht(
+      n[0],
+      n[1],
+      n[2],
+      n[3],
+      t - f
+    ), h = it(n[0], n[1], n[2], n[3])) : i === "A" ? (m = be(
       n[0],
       n[1],
       n[2],
@@ -1091,8 +1180,18 @@ const R = (e) => {
       n[6],
       n[7],
       n[8],
-      t - h
-    ), f = Bt(n[0], n[1], n[2], n[3], n[4], n[5], n[6], n[7], n[8])) : i === "C" ? (m = ve(
+      t - f
+    ), h = _t(
+      n[0],
+      n[1],
+      n[2],
+      n[3],
+      n[4],
+      n[5],
+      n[6],
+      n[7],
+      n[8]
+    )) : i === "C" ? (m = Te(
       n[0],
       n[1],
       n[2],
@@ -1101,74 +1200,164 @@ const R = (e) => {
       n[5],
       n[6],
       n[7],
-      t - h
-    ), f = _t(n[0], n[1], n[2], n[3], n[4], n[5], n[6], n[7])) : i === "Q" ? (m = $e(n[0], n[1], n[2], n[3], n[4], n[5], t - h), f = Ft(n[0], n[1], n[2], n[3], n[4], n[5])) : i === "Z" && (n = [A, w, c, l], m = { x: c, y: l }, f = lt(n[0], n[1], n[2], n[3])), [o, a] = n.slice(-2), h < t)
-      y = m;
+      t - f
+    ), h = xt(
+      n[0],
+      n[1],
+      n[2],
+      n[3],
+      n[4],
+      n[5],
+      n[6],
+      n[7]
+    )) : i === "Q" ? (m = ze(
+      n[0],
+      n[1],
+      n[2],
+      n[3],
+      n[4],
+      n[5],
+      t - f
+    ), h = pt(
+      n[0],
+      n[1],
+      n[2],
+      n[3],
+      n[4],
+      n[5]
+    )) : i === "Z" && (n = [M, N, c, a], m = { x: c, y: a }, h = it(n[0], n[1], n[2], n[3])), [o, l] = n.slice(-2), f < t)
+      g = m;
     else
       return !1;
-    h += f;
-  }), t > h - bt ? { x: o, y: a } : y);
-}, rt = (e) => {
-  const t = R(e), s = { ...X };
-  let r = !1, n = [], i = "M", o = 0, a = 0, c = 0;
-  return j(t, (l, u, m, f) => {
-    s.x = m, s.y = f;
-    const y = G(l, s);
-    [i] = y, r = i === "M", n = r ? n : [m, f].concat(y.slice(1)), r ? [, o, a] = y : i === "L" ? c += lt(n[0], n[1], n[2], n[3]) : i === "A" ? c += Bt(n[0], n[1], n[2], n[3], n[4], n[5], n[6], n[7], n[8]) : i === "C" ? c += _t(n[0], n[1], n[2], n[3], n[4], n[5], n[6], n[7]) : i === "Q" ? c += Ft(n[0], n[1], n[2], n[3], n[4], n[5]) : i === "Z" && (n = [m, f, o, a], c += lt(n[0], n[1], n[2], n[3]));
-    const h = y.length;
-    s.x1 = +y[h - 2], s.y1 = +y[h - 1], s.x2 = +y[h - 4] || s.x1, s.y2 = +y[h - 3] || s.y1;
-  }), c;
-}, Ht = (e, t) => {
-  const s = R(e);
-  let r = s.slice(0), n = rt(r), i = r.length - 1, o = 0, a = 0, c = s[0];
+    f += h;
+  }), t > f - bt ? { x: o, y: l } : g);
+}, nt = (e) => {
+  const t = Q(e);
+  let s = 0, r = 0, n = 0, i = 0, o = 0, l = 0, c = "M", a = 0, u = 0, m = 0;
+  return Z(t, (h, g, f, y) => {
+    [c] = h;
+    const p = c.toUpperCase(), N = p !== c ? at(h, g, f, y) : h.slice(0), x = p === "V" ? ["L", f, N[1]] : p === "H" ? ["L", N[1], y] : N;
+    if ([c] = x, "TQ".includes(p) || (o = 0, l = 0), c === "M")
+      [, a, u] = x;
+    else if (c === "L")
+      m += it(
+        f,
+        y,
+        x[1],
+        x[2]
+      );
+    else if (c === "A")
+      m += _t(
+        f,
+        y,
+        x[1],
+        x[2],
+        x[3],
+        x[4],
+        x[5],
+        x[6],
+        x[7]
+      );
+    else if (c === "S") {
+      const b = s * 2 - n, L = r * 2 - i;
+      m += xt(
+        f,
+        y,
+        b,
+        L,
+        x[1],
+        x[2],
+        x[3],
+        x[4]
+      );
+    } else c === "C" ? m += xt(
+      f,
+      y,
+      x[1],
+      x[2],
+      x[3],
+      x[4],
+      x[5],
+      x[6]
+    ) : c === "T" ? (o = s * 2 - o, l = r * 2 - l, m += pt(
+      f,
+      y,
+      o,
+      l,
+      x[1],
+      x[2]
+    )) : c === "Q" ? (o = x[1], l = x[2], m += pt(
+      f,
+      y,
+      x[1],
+      x[2],
+      x[3],
+      x[4]
+    )) : c === "Z" && (m += it(f, y, a, u));
+    [s, r] = c === "Z" ? [a, u] : x.slice(-2), [n, i] = c === "C" ? [x[3], x[4]] : c === "S" ? [x[1], x[2]] : [s, r];
+  }), m;
+}, Ut = (e, t) => {
+  const s = Q(e);
+  let r = s.slice(0), n = nt(r), i = r.length - 1, o = 0, l = 0, c = s[0];
   if (i <= 0 || !t || !Number.isFinite(t))
     return {
       segment: c,
       index: 0,
-      length: a,
+      length: l,
       lengthAtSegment: o
     };
   if (t >= n)
-    return r = s.slice(0, -1), o = rt(r), a = n - o, c = s[i], {
+    return r = s.slice(0, -1), o = nt(r), l = n - o, c = s[i], {
       segment: c,
       index: i,
-      length: a,
+      length: l,
       lengthAtSegment: o
     };
-  const l = [];
+  const a = [];
   for (; i > 0; )
-    c = r[i], r = r.slice(0, -1), o = rt(r), a = n - o, n = o, l.push({
+    c = r[i], r = r.slice(0, -1), o = nt(r), l = n - o, n = o, a.push({
       segment: c,
       index: i,
-      length: a,
+      length: l,
       lengthAtSegment: o
     }), i -= 1;
-  return l.find(({ lengthAtSegment: u }) => u <= t);
-}, Nt = (e, t) => {
-  const s = R(e), r = ut(s), n = rt(r), i = (M) => {
-    const d = M.x - t.x, v = M.y - t.y;
-    return d * d + v * v;
+  return a.find(
+    ({ lengthAtSegment: u }) => u <= t
+  );
+}, vt = (e, t) => {
+  const s = Q(e), r = ot(s), n = nt(r), i = (b) => {
+    const L = b.x - t.x, C = b.y - t.y;
+    return L * L + C * C;
   };
-  let o = 8, a, c = { x: 0, y: 0 }, l = 0, u = 0, m = 1 / 0;
-  for (let M = 0; M <= n; M += o)
-    a = at(r, M), l = i(a), l < m && (c = a, u = M, m = l);
+  let o = 8, l, c = { x: 0, y: 0 }, a = 0, u = 0, m = 1 / 0;
+  for (let b = 0; b <= n; b += o)
+    l = rt(r, b), a = i(l), a < m && (c = l, u = b, m = a);
   o /= 2;
-  let f, y, h = 0, x = 0, b = 0, A = 0;
-  for (; o > 1e-6 && (h = u - o, f = at(r, h), b = i(f), x = u + o, y = at(r, x), A = i(y), h >= 0 && b < m ? (c = f, u = h, m = b) : x <= n && A < m ? (c = y, u = x, m = A) : o /= 2, !(o < 1e-5)); )
+  let h, g, f = 0, y = 0, p = 0, M = 0;
+  for (; o > 1e-6 && (f = u - o, h = rt(r, f), p = i(h), y = u + o, g = rt(r, y), M = i(g), f >= 0 && p < m ? (c = h, u = f, m = p) : y <= n && M < m ? (c = g, u = y, m = M) : o /= 2, !(o < 1e-5)); )
     ;
-  const w = Ht(s, u), N = Math.sqrt(m);
-  return { closest: c, distance: N, segment: w };
-}, He = (e, t) => Nt(e, t).closest, Ue = (e, t, s, r, n, i, o, a) => 3 * ((a - t) * (s + n) - (o - e) * (r + i) + r * (e - n) - s * (t - i) + a * (n + e / 3) - o * (i + t / 3)) / 20, Pe = (e) => {
+  const N = Ut(s, u), x = Math.sqrt(m);
+  return { closest: c, distance: x, segment: N };
+}, _e = (e, t) => vt(e, t).closest, Ue = (e, t, s, r, n, i, o, l) => 3 * ((l - t) * (s + n) - (o - e) * (r + i) + r * (e - n) - s * (t - i) + l * (n + e / 3) - o * (i + t / 3)) / 20, qe = (e) => {
   let t = 0, s = 0, r = 0;
-  return gt(e).map((n) => {
+  return yt(e).map((n) => {
     switch (n[0]) {
       case "M":
         return [, t, s] = n, 0;
       default:
-        return r = Ue(t, s, n[1], n[2], n[3], n[4], n[5], n[6]), [t, s] = n.slice(-2), r;
+        return r = Ue(
+          t,
+          s,
+          n[1],
+          n[2],
+          n[3],
+          n[4],
+          n[5],
+          n[6]
+        ), [t, s] = n.slice(-2), r;
     }
   }).reduce((n, i) => n + i, 0);
-}, Xe = (e) => Pe(gt(e)) >= 0, Jt = (e) => {
+}, Je = (e) => qe(yt(e)) >= 0, Wt = (e) => {
   if (!e)
     return {
       x: 0,
@@ -1181,49 +1370,101 @@ const R = (e) => {
       cy: 0,
       cz: 0
     };
-  const t = R(e);
-  let s = [], r = "M";
-  const n = 0, i = 0;
-  let o = 0, a = 0;
-  const c = [], l = [];
-  let u = { x: n, y: i }, m = { x: n, y: i };
-  const f = { ...X };
-  j(t, (N, M, d, v) => {
-    f.x = d, f.y = v;
-    const L = G(N, f);
-    [r] = L, s = [d, v].concat(L.slice(1)), r === "M" ? ([, o, a] = L, u = { x: o, y: a }, m = { x: o, y: a }) : r === "L" ? { min: u, max: m } = zt(s[0], s[1], s[2], s[3]) : r === "A" ? { min: u, max: m } = pe(s[0], s[1], s[2], s[3], s[4], s[5], s[6], s[7], s[8]) : r === "C" ? { min: u, max: m } = Te(s[0], s[1], s[2], s[3], s[4], s[5], s[6], s[7]) : r === "Q" ? { min: u, max: m } = ze(s[0], s[1], s[2], s[3], s[4], s[5]) : r === "Z" && (s = [d, v, o, a], { min: u, max: m } = zt(s[0], s[1], s[2], s[3])), c.push(u), l.push(m);
-    const T = L.length;
-    f.x1 = +L[T - 2], f.y1 = +L[T - 1], f.x2 = +L[T - 4] || f.x1, f.y2 = +L[T - 3] || f.y1;
+  const t = Q(e);
+  let s = "M", r = 0, n = 0;
+  const { max: i, min: o } = Math;
+  let l = 1 / 0, c = 1 / 0, a = -1 / 0, u = -1 / 0, m = 0, h = 0, g = 0, f = 0, y = 0, p = 0, M = 0, N = 0, x = 0, b = 0;
+  Z(t, (I, R, P, z) => {
+    [s] = I;
+    const D = s.toUpperCase(), q = D !== s ? at(I, R, P, z) : I.slice(0), w = D === "V" ? ["L", P, q[1]] : D === "H" ? ["L", q[1], z] : q;
+    if ([s] = w, "TQ".includes(D) || (x = 0, b = 0), s === "M")
+      [, r, n] = w, m = r, h = n, g = r, f = n;
+    else if (s === "L")
+      [m, h, g, f] = It(
+        P,
+        z,
+        w[1],
+        w[2]
+      );
+    else if (s === "A")
+      [m, h, g, f] = de(
+        P,
+        z,
+        w[1],
+        w[2],
+        w[3],
+        w[4],
+        w[5],
+        w[6],
+        w[7]
+      );
+    else if (s === "S") {
+      const $ = y * 2 - M, E = p * 2 - N;
+      [m, h, g, f] = jt(
+        P,
+        z,
+        $,
+        E,
+        w[1],
+        w[2],
+        w[3],
+        w[4]
+      );
+    } else s === "C" ? [m, h, g, f] = jt(
+      P,
+      z,
+      w[1],
+      w[2],
+      w[3],
+      w[4],
+      w[5],
+      w[6]
+    ) : s === "T" ? (x = y * 2 - x, b = p * 2 - b, [m, h, g, f] = Qt(
+      P,
+      z,
+      x,
+      b,
+      w[1],
+      w[2]
+    )) : s === "Q" ? (x = w[1], b = w[2], [m, h, g, f] = Qt(
+      P,
+      z,
+      w[1],
+      w[2],
+      w[3],
+      w[4]
+    )) : s === "Z" && ([m, h, g, f] = It(P, z, r, n));
+    l = o(m, l), c = o(h, c), a = i(g, a), u = i(f, u), [y, p] = s === "Z" ? [r, n] : w.slice(-2), [M, N] = s === "C" ? [w[3], w[4]] : s === "S" ? [w[1], w[2]] : [y, p];
   });
-  const y = Math.min(...c.map((N) => N.x)), h = Math.max(...l.map((N) => N.x)), x = Math.min(...c.map((N) => N.y)), b = Math.max(...l.map((N) => N.y)), A = h - y, w = b - x;
+  const L = a - l, C = u - c;
   return {
-    width: A,
-    height: w,
-    x: y,
-    y: x,
-    x2: h,
-    y2: b,
-    cx: y + A / 2,
-    cy: x + w / 2,
+    width: L,
+    height: C,
+    x: l,
+    y: c,
+    x2: a,
+    y2: u,
+    cx: l + L / 2,
+    cy: c + C / 2,
     // an estimated guess
-    cz: Math.max(A, w) + Math.min(A, w) / 2
+    cz: Math.max(L, C) + Math.min(L, C) / 2
   };
-}, Je = (e, t) => Ht(e, t).segment, Ye = (e, t) => Nt(e, t).segment, Lt = (e) => Array.isArray(e) && e.every((t) => {
+}, Ke = (e, t) => Ut(e, t).segment, We = (e, t) => vt(e, t).segment, Ct = (e) => Array.isArray(e) && e.every((t) => {
   const s = t[0].toLowerCase();
-  return nt[s] === t.length - 1 && "achlmqstvz".includes(s) && t.slice(1).every(Number.isFinite);
-}) && e.length > 0, qe = (e) => Lt(e) && // `isPathArray` also checks if it's `Array`
-e.every(([t]) => t === t.toUpperCase()), ke = (e) => qe(e) && e.every(([t]) => "ACLMQZ".includes(t)), Ke = (e) => ke(e) && e.every(([t]) => "MC".includes(t)), We = (e, t) => {
-  const { distance: s } = Nt(e, t);
+  return tt[s] === t.length - 1 && "achlmqstvz".includes(s) && t.slice(1).every(Number.isFinite);
+}) && e.length > 0, Pe = (e) => Ct(e) && // `isPathArray` also checks if it's `Array`
+e.every(([t]) => t === t.toUpperCase()), ke = (e) => Pe(e) && e.every(([t]) => "ACLMQZ".includes(t)), Xe = (e) => ke(e) && e.every(([t]) => "MC".includes(t)), Ye = (e, t) => {
+  const { distance: s } = vt(e, t);
   return Math.abs(s) < bt;
-}, Ve = (e) => Lt(e) && // `isPathArray` checks if it's `Array`
+}, Ve = (e) => Ct(e) && // `isPathArray` checks if it's `Array`
 e.slice(1).every(([t]) => t === t.toLowerCase()), Ie = (e) => {
   if (typeof e != "string" || !e.length)
     return !1;
-  const t = new Rt(e);
-  for (st(t); t.index < t.max && !t.err.length; )
-    Et(t);
+  const t = new Ot(e);
+  for (et(t); t.index < t.max && !t.err.length; )
+    Dt(t);
   return !t.err.length && "mM".includes(t.segments[0][0]);
-}, mt = {
+}, ct = {
   line: ["x1", "y1", "x2", "y2"],
   circle: ["cx", "cy", "r"],
   ellipse: ["cx", "cy", "rx", "ry"],
@@ -1273,87 +1514,106 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), Ie = (e) => {
   ]) : [["M", t, s], ["h", r], ["v", n], ["H", t], ["Z"]];
 }, Ee = (e, t) => {
   const r = (t || document).defaultView || /* istanbul ignore next */
-  window, n = Object.keys(mt), i = e instanceof r.SVGElement, o = i ? e.tagName : null;
+  window, n = Object.keys(ct), i = e instanceof r.SVGElement, o = i ? e.tagName : null;
   if (o && [...n, "path"].every((m) => o !== m))
-    throw TypeError(`${E}: "${o}" is not SVGElement`);
-  const a = i ? o : e.type, c = mt[a], l = { type: a };
+    throw TypeError(`${j}: "${o}" is not SVGElement`);
+  const l = i ? o : e.type, c = ct[l], a = { type: l };
   i ? c.forEach((m) => {
-    l[m] = e.getAttribute(m);
-  }) : Object.assign(l, e);
+    a[m] = e.getAttribute(m);
+  }) : Object.assign(a, e);
   let u = [];
-  return a === "circle" ? u = en(l) : a === "ellipse" ? u = nn(l) : ["polyline", "polygon"].includes(a) ? u = tn(l) : a === "rect" ? u = sn(l) : a === "line" ? u = Ge(l) : ["glyph", "path"].includes(a) && (u = R(
+  return l === "circle" ? u = en(a) : l === "ellipse" ? u = nn(a) : ["polyline", "polygon"].includes(l) ? u = tn(a) : l === "rect" ? u = sn(a) : l === "line" ? u = Ge(a) : ["glyph", "path"].includes(l) && (u = Q(
     i ? e.getAttribute("d") || /* istanbul ignore next @preserve */
     "" : e.d || ""
-  )), Lt(u) && u.length ? u : !1;
+  )), Ct(u) && u.length ? u : !1;
 }, rn = (e, t, s) => {
   const r = s || document, n = r.defaultView || /* istanbul ignore next */
-  window, i = Object.keys(mt), o = e instanceof n.SVGElement, a = o ? e.tagName : null;
-  if (a === "path") throw TypeError(`${E}: "${a}" is already SVGPathElement`);
-  if (a && i.every((x) => a !== x)) throw TypeError(`${E}: "${a}" is not SVGElement`);
-  const c = r.createElementNS("http://www.w3.org/2000/svg", "path"), l = o ? a : e.type, u = mt[l], m = { type: l }, f = V.round, y = Ee(e, r), h = y && y.length ? $t(y, f) : "";
-  return o ? (u.forEach((x) => {
-    m[x] = e.getAttribute(x);
-  }), Object.values(e.attributes).forEach(({ name: x, value: b }) => {
-    u.includes(x) || c.setAttribute(x, b);
-  })) : (Object.assign(m, e), Object.keys(m).forEach((x) => {
-    !u.includes(x) && x !== "type" && c.setAttribute(
-      x.replace(/[A-Z]/g, (b) => `-${b.toLowerCase()}`),
-      m[x]
+  window, i = Object.keys(ct), o = e instanceof n.SVGElement, l = o ? e.tagName : null;
+  if (l === "path")
+    throw TypeError(`${j}: "${l}" is already SVGPathElement`);
+  if (l && i.every((y) => l !== y))
+    throw TypeError(`${j}: "${l}" is not SVGElement`);
+  const c = r.createElementNS("http://www.w3.org/2000/svg", "path"), a = o ? l : e.type, u = ct[a], m = { type: a }, h = V.round, g = Ee(e, r), f = g && g.length ? kt(g, h) : "";
+  return o ? (u.forEach((y) => {
+    m[y] = e.getAttribute(y);
+  }), Object.values(e.attributes).forEach(({ name: y, value: p }) => {
+    u.includes(y) || c.setAttribute(y, p);
+  })) : (Object.assign(m, e), Object.keys(m).forEach((y) => {
+    !u.includes(y) && y !== "type" && c.setAttribute(
+      y.replace(/[A-Z]/g, (p) => `-${p.toLowerCase()}`),
+      m[y]
     );
-  })), Ie(h) ? (c.setAttribute("d", h), t && o && (e.before(c, e), e.remove()), c) : !1;
+  })), Ie(f) ? (c.setAttribute("d", f), t && o && (e.before(c, e), e.remove()), c) : !1;
 }, Re = (e) => {
-  let t = new C();
-  const { origin: s } = e, [r, n] = s, { translate: i } = e, { rotate: o } = e, { skew: a } = e, { scale: c } = e;
-  return Array.isArray(i) && i.length >= 2 && i.every((l) => !Number.isNaN(+l)) && i.some((l) => l !== 0) ? t = t.translate(...i) : typeof i == "number" && !Number.isNaN(i) && (t = t.translate(i)), (o || a || c) && (t = t.translate(r, n), Array.isArray(o) && o.length >= 2 && o.every((l) => !Number.isNaN(+l)) && o.some((l) => l !== 0) ? t = t.rotate(...o) : typeof o == "number" && !Number.isNaN(o) && (t = t.rotate(o)), Array.isArray(a) && a.length === 2 && a.every((l) => !Number.isNaN(+l)) && a.some((l) => l !== 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(c) && c.length >= 2 && c.every((l) => !Number.isNaN(+l)) && c.some((l) => l !== 1) ? t = t.scale(...c) : typeof c == "number" && !Number.isNaN(c) && (t = t.scale(c)), t = t.translate(-r, -n)), t;
-}, je = (e, t, s, r) => {
+  let t = new T();
+  const { origin: s } = e, [r, n] = s, { 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, n), 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, -n)), t;
+}, Se = (e, t, s, r) => {
   const [n] = e, { round: i } = V, o = typeof i == "number" ? i : (
     /* istanbul ignore next */
     4
-  ), a = t.slice(1), { x1: c, y1: l, x2: u, y2: m, x: f, y } = s, [h, x] = a.slice(-2), b = e;
+  ), l = t.slice(1), { x1: c, y1: a, x2: u, y2: m, x: h, y: g } = s, [f, y] = l.slice(-2), p = e;
   if ("TQ".includes(n) || (s.qx = null, s.qy = null), n === "L") {
-    if (z(f, o) === z(h, o))
-      return ["V", x];
-    if (z(y, o) === z(x, o))
-      return ["H", h];
+    if (k(h, o) === k(f, o))
+      return ["V", y];
+    if (k(g, o) === k(y, o))
+      return ["H", f];
   } else if (n === "C") {
-    const [A, w] = a;
-    if (s.x1 = A, s.y1 = w, "CS".includes(r) && (z(A, o) === z(c * 2 - u, o) && z(w, o) === z(l * 2 - m, o) || z(c, o) === z(u * 2 - f, o) && z(l, o) === z(m * 2 - y, o)))
-      return ["S", a[2], a[3], a[4], a[5]];
+    const [M, N] = l;
+    if (s.x1 = M, s.y1 = N, "CS".includes(r) && (k(M, o) === k(c * 2 - u, o) && k(N, o) === k(a * 2 - m, o) || k(c, o) === k(u * 2 - h, o) && k(a, o) === k(m * 2 - g, o)))
+      return [
+        "S",
+        l[2],
+        l[3],
+        l[4],
+        l[5]
+      ];
   } else if (n === "Q") {
-    const [A, w] = a;
-    if (s.qx = A, s.qy = w, "QT".includes(r) && z(A, o) === z(c * 2 - u, o) && z(w, o) === z(l * 2 - m, o))
-      return ["T", a[2], a[3]];
+    const [M, N] = l;
+    if (s.qx = M, s.qy = N, "QT".includes(r) && k(M, o) === k(c * 2 - u, o) && k(N, o) === k(a * 2 - m, o))
+      return ["T", l[2], l[3]];
   }
-  return b;
+  return p;
 }, dt = (e, t) => {
-  const s = e.slice(1).map((r) => z(r, t));
+  const s = e.slice(1).map(
+    (r) => k(r, t)
+  );
   return [e[0]].concat(s);
-}, Yt = (e, t) => {
-  const s = xt(e), r = typeof t == "number" && t >= 0 ? t : (
+}, Xt = (e, t) => {
+  const s = ht(e), r = typeof t == "number" && t >= 0 ? t : (
     /* istanbul ignore next @preserve */
     2
-  ), n = { ...X }, i = [];
-  let o = "M", a = "Z";
-  return j(s, (c, l, u, m) => {
+  ), n = { ...ut }, i = [];
+  let o = "M", l = "Z";
+  return Z(s, (c, a, u, m) => {
     n.x = u, n.y = m;
-    const f = G(c, n);
-    let y = c;
-    if ([o] = c, i[l] = o, l) {
-      a = i[l - 1];
-      const x = je(c, f, n, a), b = dt(x, r), A = b.join(""), w = St(x, l, u, m), N = dt(w, r), M = N.join("");
-      y = A.length < M.length ? b : N;
+    const h = wt(c, n);
+    let g = c;
+    if ([o] = c, i[a] = o, a) {
+      l = i[a - 1];
+      const y = Se(
+        c,
+        h,
+        n,
+        l
+      ), p = dt(y, r), M = p.join(""), N = Bt(y, a, u, m), x = dt(N, r), b = x.join("");
+      g = M.length < b.length ? p : x;
     }
-    const h = f.length;
-    return n.x1 = +f[h - 2], n.y1 = +f[h - 1], n.x2 = +f[h - 4] || n.x1, n.y2 = +f[h - 3] || n.y1, y;
+    const f = h.length;
+    return n.x1 = +h[f - 2], n.y1 = +h[f - 1], n.x2 = +h[f - 4] || n.x1, n.y2 = +h[f - 3] || n.y1, g;
   });
 }, on = (e, t) => {
-  let s = C.Translate(t[0], t[1], t[2]);
+  let s = T.Translate(t[0], t[1], t[2]);
   return [, , , s.m44] = t, s = e.multiply(s), [s.m41, s.m42, s.m43, s.m44];
-}, It = (e, t, s) => {
-  const [r, n, i] = s, [o, a, c] = on(e, [t[0], t[1], 0, 1]), l = o - r, u = a - n, m = c - i;
+}, Zt = (e, t, s) => {
+  const [r, n, i] = s, [o, l, c] = on(e, [t[0], t[1], 0, 1]), a = o - r, u = l - n, m = c - i;
   return [
     // protect against division by ZERO
-    l * (Math.abs(i) / Math.abs(m) || 1) + r,
+    a * (Math.abs(i) / Math.abs(m) || 1) + r,
     u * (Math.abs(i) / Math.abs(m) || 1) + n
   ];
 }, cn = (e) => {
@@ -1363,110 +1623,158 @@ e.slice(1).every(([t]) => t === t.toLowerCase()), Ie = (e) => {
   return [["M"].concat(t[0].slice(0, 2))].concat(
     t.map((s) => ["C"].concat(s.slice(2)))
   );
-}, yt = (e) => {
-  const t = xt(e), s = ut(t), r = t.length, n = t[r - 1][0] === "Z", i = j(t, (o, a) => {
-    const c = s[a], l = a && t[a - 1], u = l && l[0], m = t[a + 1], f = m && m[0], [y] = o, [h, x] = s[a ? a - 1 : r - 1].slice(-2);
-    let b = o;
-    switch (y) {
+}, ft = (e) => {
+  const t = ht(e), s = ot(t), r = t.length, n = t[r - 1][0] === "Z", i = Z(t, (o, l) => {
+    const c = s[l], a = l && t[l - 1], u = a && a[0], m = t[l + 1], h = m && m[0], [g] = o, [f, y] = s[l ? l - 1 : r - 1].slice(-2);
+    let p = o;
+    switch (g) {
       case "M":
-        b = n ? ["Z"] : [y, h, x];
+        p = n ? ["Z"] : [g, f, y];
         break;
       case "A":
-        b = [
-          y,
+        p = [
+          g,
           o[1],
           o[2],
           o[3],
           o[4],
           o[5] === 1 ? 0 : 1,
-          h,
-          x
+          f,
+          y
         ];
         break;
       case "C":
-        m && f === "S" ? b = ["S", o[1], o[2], h, x] : b = [y, o[3], o[4], o[1], o[2], h, x];
+        m && h === "S" ? p = ["S", o[1], o[2], f, y] : p = [
+          g,
+          o[3],
+          o[4],
+          o[1],
+          o[2],
+          f,
+          y
+        ];
         break;
       case "S":
-        u && "CS".includes(u) && (!m || f !== "S") ? b = [
+        u && "CS".includes(u) && (!m || h !== "S") ? p = [
           "C",
           c[3],
           c[4],
           c[1],
           c[2],
-          h,
-          x
-        ] : b = [y, c[1], c[2], h, x];
+          f,
+          y
+        ] : p = [
+          g,
+          c[1],
+          c[2],
+          f,
+          y
+        ];
         break;
       case "Q":
-        m && f === "T" ? b = ["T", h, x] : b = [y, o[1], o[2], h, x];
+        m && h === "T" ? p = ["T", f, y] : p = [g, o[1], o[2], f, y];
         break;
       case "T":
-        u && "QT".includes(u) && (!m || f !== "T") ? b = ["Q", c[1], c[2], h, x] : b = [y, h, x];
+        u && "QT".includes(u) && (!m || h !== "T") ? p = [
+          "Q",
+          c[1],
+          c[2],
+          f,
+          y
+        ] : p = [g, f, y];
         break;
       case "Z":
-        b = ["M", h, x];
+        p = ["M", f, y];
         break;
       case "H":
-        b = [y, h];
+        p = [g, f];
         break;
       case "V":
-        b = [y, x];
+        p = [g, y];
         break;
       default:
-        b = [y].concat(o.slice(1, -2), h, x);
+        p = [g].concat(
+          o.slice(1, -2),
+          f,
+          y
+        );
     }
-    return b;
+    return p;
   });
   return n ? i.reverse() : [i[0]].concat(i.slice(1).reverse());
-}, an = (e, t) => {
+}, ln = (e, t) => {
   let { round: s } = V;
   return s = t === "off" || typeof t == "number" && t >= 0 ? t : typeof s == "number" && s >= 0 ? s : (
     /* istanbul ignore next @preserve */
     "off"
-  ), s === "off" ? e.slice(0) : j(e, (r) => dt(r, s));
-}, ln = (e, t = 0.5) => {
-  const s = t, r = e.slice(0, 2), n = e.slice(2, 4), i = e.slice(4, 6), o = e.slice(6, 8), a = O(r, n, s), c = O(n, i, s), l = O(i, o, s), u = O(a, c, s), m = O(c, l, s), f = O(u, m, s);
+  ), s === "off" ? e.slice(0) : Z(e, (r) => dt(r, s));
+}, an = (e, t = 0.5) => {
+  const s = t, r = e.slice(0, 2), n = e.slice(2, 4), i = e.slice(4, 6), o = e.slice(6, 8), l = H(r, n, s), c = H(n, i, s), a = H(i, o, s), u = H(l, c, s), m = H(c, a, s), h = H(u, m, s);
   return [
-    ["C", a[0], a[1], u[0], u[1], f[0], f[1]],
-    ["C", m[0], m[1], l[0], l[1], o[0], o[1]]
+    ["C", l[0], l[1], u[0], u[1], h[0], h[1]],
+    ["C", m[0], m[1], a[0], a[1], o[0], o[1]]
   ];
-}, Kt = (e) => {
+}, Yt = (e) => {
   const t = [];
-  let s, r = -1, n = 0, i = 0, o = 0, a = 0;
-  const c = { ...X };
-  return e.forEach((l) => {
-    const [u] = l, m = u.toUpperCase(), f = u.toLowerCase(), y = u === f, h = l.slice(1);
-    m === "M" ? (r += 1, [n, i] = h, n += y ? c.x : 0, i += y ? c.y : 0, o = n, a = i, s = [y ? [m, o, a] : l]) : (m === "Z" ? (n = o, i = a) : m === "H" ? ([, n] = l, n += y ? c.x : (
+  let s, r = -1, n = 0, i = 0, o = 0, l = 0;
+  const c = { ...ut };
+  return e.forEach((a) => {
+    const [u] = a, m = u.toUpperCase(), h = u.toLowerCase(), g = u === h, f = a.slice(1);
+    m === "M" ? (r += 1, [n, i] = f, n += g ? c.x : 0, i += g ? c.y : 0, o = n, l = i, s = [g ? [m, o, l] : a]) : (m === "Z" ? (n = o, i = l) : m === "H" ? ([, n] = a, n += g ? c.x : (
       /* istanbul ignore next @preserve */
       0
-    )) : m === "V" ? ([, i] = l, i += y ? c.y : (
+    )) : m === "V" ? ([, i] = a, i += g ? c.y : (
       /* istanbul ignore next @preserve */
       0
-    )) : ([n, i] = l.slice(-2), n += y ? c.x : 0, i += y ? c.y : 0), s.push(l)), c.x = n, c.y = i, t[r] = s;
+    )) : ([n, i] = a.slice(-2), n += g ? c.x : 0, i += g ? c.y : 0), s.push(a)), c.x = n, c.y = i, t[r] = s;
   }), t;
-}, Wt = (e, t) => {
-  let s = 0, r = 0, n = 0, i = 0, o = 0, a = 0, c = "M";
-  const l = { ...X }, u = R(e), m = t && Object.keys(t);
-  if (!t || m && !m.length) return u.slice(0);
+}, Vt = (e, t) => {
+  let s = 0, r = 0, n = 0, i = 0, o = 0, l = 0, c = "M";
+  const a = Q(e), u = t && Object.keys(t);
+  if (!t || u && !u.length)
+    return a.slice(0);
   t.origin || Object.assign(t, { origin: V.origin });
-  const f = t.origin, y = Re(t);
-  return y.isIdentity ? u.slice(0) : j(u, (h, x, b, A) => {
-    l.x = b, l.y = A, [c] = h;
-    const w = c.toUpperCase(), M = w !== c ? jt(h, x, b, A) : h.slice(0);
-    let d = w === "A" ? Zt(M, l) : ["V", "H"].includes(w) ? G(M, l) : M;
-    c = d[0];
-    const v = c === "C" && d.length > 7, L = v ? d.slice(0, 7) : d.slice(0);
-    if (v && (u.splice(x + 1, 0, ["C"].concat(d.slice(7))), d = L), c === "L")
-      [n, i] = It(y, [d[1], d[2]], f), s !== n && r !== i ? d = ["L", n, i] : r === i ? d = ["H", n] : s === n && (d = ["V", i]);
+  const m = t.origin, h = Re(t);
+  return h.isIdentity ? a.slice(0) : Z(a, (g, f, y, p) => {
+    [c] = g;
+    const M = c.toUpperCase(), x = M !== c ? at(g, f, y, p) : g.slice(0);
+    let b = M === "A" ? ["C"].concat(
+      Mt(
+        y,
+        p,
+        x[1],
+        x[2],
+        x[3],
+        x[4],
+        x[5],
+        x[6],
+        x[7]
+      )
+    ) : M === "V" ? ["L", y, x[1]] : M === "H" ? ["L", x[1], p] : x;
+    c = b[0];
+    const L = c === "C" && b.length > 7, C = L ? b.slice(0, 7) : b.slice(0);
+    if (L && (a.splice(
+      f + 1,
+      0,
+      ["C"].concat(
+        b.slice(7)
+      )
+    ), b = C), c === "L")
+      [n, i] = Zt(h, [
+        b[1],
+        b[2]
+      ], m), s !== n && r !== i ? b = ["L", n, i] : r === i ? b = ["H", n] : s === n && (b = ["V", i]);
     else
-      for (o = 1, a = d.length; o < a; o += 2)
-        [n, i] = It(y, [+d[o], +d[o + 1]], f), d[o] = n, d[o + 1] = i;
-    s = n, r = i;
-    const T = L.length;
-    return l.x1 = +L[T - 2], l.y1 = +L[T - 1], l.x2 = +L[T - 4] || l.x1, l.y2 = +L[T - 3] || l.y1, d;
+      for (o = 1, l = b.length; o < l; o += 2)
+        [n, i] = Zt(
+          h,
+          [+b[o], +b[o + 1]],
+          m
+        ), b[o] = n, b[o + 1] = i;
+    return s = n, r = i, b;
   });
 };
-class p {
+class A {
   /**
    * @constructor
    * @param pathValue the path string
@@ -1475,27 +1783,29 @@ class p {
   constructor(t, s) {
     const r = s || {}, n = typeof t > "u";
     if (n || !t.length)
-      throw TypeError(`${E}: "pathValue" is ${n ? "undefined" : "empty"}`);
-    this.segments = R(t);
+      throw TypeError(
+        `${j}: "pathValue" is ${n ? "undefined" : "empty"}`
+      );
+    this.segments = Q(t);
     const { round: i, origin: o } = r;
-    let a;
-    Number.isInteger(i) || i === "off" ? a = i : a = V.round;
+    let l;
+    Number.isInteger(i) || i === "off" ? l = i : l = V.round;
     let c = V.origin;
     if (Array.isArray(o) && o.length >= 2) {
-      const [l, u, m] = o.map(Number);
+      const [a, u, m] = o.map(Number);
       c = [
-        Number.isNaN(l) ? 0 : l,
+        Number.isNaN(a) ? 0 : a,
         Number.isNaN(u) ? 0 : u,
         Number.isNaN(m) ? 0 : m
       ];
     }
-    return this.round = a, this.origin = c, this;
+    return this.round = l, this.origin = c, this;
   }
   get bbox() {
-    return Jt(this.segments);
+    return Wt(this.segments);
   }
   get length() {
-    return rt(this.segments);
+    return nt(this.segments);
   }
   /**
    * Returns the path bounding box, equivalent to native `path.getBBox()`.
@@ -1524,7 +1834,7 @@ class p {
    * @returns the requested point
    */
   getPointAtLength(t) {
-    return at(this.segments, t);
+    return rt(this.segments, t);
   }
   /**
    * Convert path to absolute values
@@ -1533,7 +1843,7 @@ class p {
    */
   toAbsolute() {
     const { segments: t } = this;
-    return this.segments = xt(t), this;
+    return this.segments = ht(t), this;
   }
   /**
    * Convert path to relative values
@@ -1542,7 +1852,7 @@ class p {
    */
   toRelative() {
     const { segments: t } = this;
-    return this.segments = Xt(t), this;
+    return this.segments = Kt(t), this;
   }
   /**
    * Convert path to cubic-bezier values. In addition, un-necessary `Z`
@@ -1552,7 +1862,7 @@ class p {
    */
   toCurve() {
     const { segments: t } = this;
-    return this.segments = gt(t), this;
+    return this.segments = yt(t), this;
   }
   /**
    * Reverse the order of the segments and their values.
@@ -1561,10 +1871,9 @@ class p {
    * @public
    */
   reverse(t) {
-    this.toAbsolute();
-    const { segments: s } = this, r = Kt(s), n = r.length > 1 ? r : !1, i = n ? n.map((a, c) => t ? c ? yt(a) : a.slice(0) : yt(a)) : s.slice(0);
+    const { segments: s } = this, r = Yt(s), n = r.length > 1 ? r : !1, i = n ? n.map((l, c) => t ? c ? ft(l) : l.slice(0) : ft(l)) : s.slice(0);
     let o = [];
-    return n ? o = i.flat(1) : o = t ? s : yt(s), this.segments = o.slice(0), this;
+    return n ? o = i.flat(1) : o = t ? s : ft(s), this.segments = o.slice(0), this;
   }
   /**
    * Normalize path in 2 steps:
@@ -1575,7 +1884,7 @@ class p {
    */
   normalize() {
     const { segments: t } = this;
-    return this.segments = ut(t), this;
+    return this.segments = ot(t), this;
   }
   /**
    * Optimize `pathArray` values:
@@ -1587,7 +1896,7 @@ class p {
    */
   optimize() {
     const { segments: t } = this, s = this.round === "off" ? 2 : this.round;
-    return this.segments = Yt(t, s), this;
+    return this.segments = Xt(t, s), this;
   }
   /**
    * Transform path using values from an `Object` defined as `transformObject`.
@@ -1604,15 +1913,19 @@ class p {
       segments: s,
       origin: [r, n, i]
     } = this, o = {};
-    for (const [c, l] of Object.entries(t))
-      c === "skew" && Array.isArray(l) || (c === "rotate" || c === "translate" || c === "origin" || c === "scale") && Array.isArray(l) ? o[c] = l.map(Number) : c !== "origin" && typeof Number(l) == "number" && (o[c] = Number(l));
-    const { origin: a } = o;
-    if (Array.isArray(a) && a.length >= 2) {
-      const [c, l, u] = a.map(Number);
-      o.origin = [Number.isNaN(c) ? r : c, Number.isNaN(l) ? n : l, u || i];
+    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, u] = l.map(Number);
+      o.origin = [
+        Number.isNaN(c) ? r : c,
+        Number.isNaN(a) ? n : a,
+        u || i
+      ];
     } else
       o.origin = [r, n, i];
-    return this.segments = Wt(s, o), this;
+    return this.segments = Vt(s, o), this;
   }
   /**
    * Rotate path 180deg vertically
@@ -1640,22 +1953,45 @@ class p {
    * @return the path string
    */
   toString() {
-    return $t(this.segments, this.round);
+    return kt(this.segments, this.round);
+  }
+  /**
+   * Remove the instance.
+   *
+   * @public
+   * @return void
+   */
+  dispose() {
+    Object.keys(this).forEach((t) => delete this[t]);
   }
 }
-g(p, "CSSMatrix", C), g(p, "pathToAbsolute", xt), g(p, "pathToRelative", Xt), g(p, "pathToCurve", gt), g(p, "pathToString", $t), g(p, "arcTools", Be), g(p, "bezierTools", {
-  Cvalues: be,
-  Tvalues: qt,
-  minmaxC: kt,
-  minmaxQ: pt,
-  getBezierLength: ft,
-  bezierLength: we,
-  calculateBezier: Me,
-  computeBezier: Ae,
-  deriveBezier: de,
-  CBEZIER_MINMAX_EPSILON: Ne
-}), g(p, "cubicTools", { getCubicLength: _t, getCubicBBox: Te, getPointAtCubicLength: ve, getPointAtCubicSegmentLength: Le }), g(p, "lineTools", { getPointAtLineLength: Ot, getLineBBox: zt, getLineLength: lt }), g(p, "quadTools", { getPointAtQuadSegmentLength: Ce, getQuadLength: Ft, getQuadBBox: ze, getPointAtQuadLength: $e }), g(p, "polygonTools", { polygonArea: _e, polygonLength: Fe }), g(p, "distanceSquareRoot", Mt), g(p, "distanceEpsilon", bt), g(p, "midPoint", O), g(p, "rotateVector", ct), g(p, "roundTo", z), g(p, "finalizeSegment", Tt), g(p, "invalidPathValue", U), g(p, "isArcCommand", fe), g(p, "isDigit", H), g(p, "isDigitStart", he), g(p, "isMoveCommand", ye), g(p, "isPathCommand", me), g(p, "isSpace", ue), g(p, "paramsCount", nt), g(p, "paramsParser", X), g(p, "pathParser", Rt), g(p, "scanFlag", ae), g(p, "scanParam", le), g(p, "scanSegment", Et), g(p, "skipSpaces", st), g(p, "getPathBBox", Jt), g(p, "getPathArea", Pe), g(p, "getTotalLength", rt), g(p, "getDrawDirection", Xe), g(p, "getPointAtLength", at), g(p, "getPropertiesAtLength", Ht), g(p, "getPropertiesAtPoint", Nt), g(p, "getClosestPoint", He), g(p, "getSegmentOfPoint", Ye), g(p, "getSegmentAtLength", Je), g(p, "isPointInStroke", We), g(p, "isValidPath", Ie), g(p, "isPathArray", Lt), g(p, "isAbsoluteArray", qe), g(p, "isRelativeArray", Ve), g(p, "isCurveArray", Ke), g(p, "isNormalizedArray", ke), g(p, "shapeToPath", rn), g(p, "shapeToPathArray", Ee), g(p, "shapeParams", mt), g(p, "parsePathString", R), g(p, "absolutizeSegment", jt), g(p, "arcToCubic", Dt), g(p, "getSVGMatrix", Re), g(p, "iterate", j), g(p, "lineToCubic", Ct), g(p, "normalizePath", ut), g(p, "normalizeSegment", G), g(p, "optimizePath", Yt), g(p, "projection2d", It), g(p, "quadToCubic", xe), g(p, "relativizeSegment", St), g(p, "reverseCurve", cn), g(p, "reversePath", yt), g(p, "roundPath", an), g(p, "roundSegment", dt), g(p, "segmentToCubic", Zt), g(p, "shortenSegment", je), g(p, "splitCubic", ln), g(p, "splitPath", Kt), g(p, "transformPath", Wt);
+d(A, "CSSMatrix", T), d(A, "pathToAbsolute", ht), d(A, "pathToRelative", Kt), d(A, "pathToCurve", yt), d(A, "pathToString", kt), d(A, "arcTools", Be), d(A, "bezierTools", {
+  Cvalues: Ae,
+  Tvalues: Rt,
+  minmaxC: St,
+  minmaxQ: gt,
+  getBezierLength: mt,
+  bezierLength: Le,
+  calculateBezier: Ne,
+  computeBezier: we,
+  deriveBezier: Me,
+  CBEZIER_MINMAX_EPSILON: ve
+}), d(A, "cubicTools", {
+  getCubicLength: xt,
+  getCubicBBox: jt,
+  getPointAtCubicLength: Te,
+  getPointAtCubicSegmentLength: Ce
+}), d(A, "lineTools", {
+  getPointAtLineLength: Ht,
+  getLineBBox: It,
+  getLineLength: it
+}), d(A, "quadTools", {
+  getPointAtQuadSegmentLength: $e,
+  getQuadLength: pt,
+  getQuadBBox: Qt,
+  getPointAtQuadLength: ze
+}), d(A, "polygonTools", { polygonArea: He, polygonLength: Fe }), d(A, "distanceSquareRoot", Nt), d(A, "distanceEpsilon", bt), d(A, "midPoint", H), d(A, "rotateVector", st), d(A, "roundTo", k), d(A, "finalizeSegment", qt), d(A, "invalidPathValue", J), d(A, "isArcCommand", ye), d(A, "isDigit", U), d(A, "isDigitStart", he), d(A, "isMoveCommand", ge), d(A, "isPathCommand", fe), d(A, "isSpace", me), d(A, "paramsCount", tt), d(A, "paramsParser", ut), d(A, "pathParser", Ot), d(A, "scanFlag", ae), d(A, "scanParam", ue), d(A, "scanSegment", Dt), d(A, "skipSpaces", et), d(A, "getPathBBox", Wt), d(A, "getPathArea", qe), d(A, "getTotalLength", nt), d(A, "getDrawDirection", Je), d(A, "getPointAtLength", rt), d(A, "getPropertiesAtLength", Ut), d(A, "getPropertiesAtPoint", vt), d(A, "getClosestPoint", _e), d(A, "getSegmentOfPoint", We), d(A, "getSegmentAtLength", Ke), d(A, "isPointInStroke", Ye), d(A, "isValidPath", Ie), d(A, "isPathArray", Ct), d(A, "isAbsoluteArray", Pe), d(A, "isRelativeArray", Ve), d(A, "isCurveArray", Xe), d(A, "isNormalizedArray", ke), d(A, "shapeToPath", rn), d(A, "shapeToPathArray", Ee), d(A, "shapeParams", ct), d(A, "parsePathString", Q), d(A, "absolutizeSegment", at), d(A, "arcToCubic", Mt), d(A, "getSVGMatrix", Re), d(A, "iterate", Z), d(A, "lineToCubic", Pt), d(A, "normalizePath", ot), d(A, "normalizeSegment", wt), d(A, "optimizePath", Xt), d(A, "projection2d", Zt), d(A, "quadToCubic", xe), d(A, "relativizeSegment", Bt), d(A, "reverseCurve", cn), d(A, "reversePath", ft), d(A, "roundPath", ln), d(A, "roundSegment", dt), d(A, "segmentToCubic", pe), d(A, "shortenSegment", Se), d(A, "splitCubic", an), d(A, "splitPath", Yt), d(A, "transformPath", Vt);
 export {
-  p as default
+  A as default
 };
 //# sourceMappingURL=svg-path-commander.mjs.map