replicad-pantograph 0.10.0 → 0.10.1

package/dist/studio/replicad-pantograph.js

@@ -6,7 +6,7 @@ var Me = (r) => {
 };
 var Be = (r, s, t) => s in r ? Oe(r, s, { enumerable: !0, configurable: !0, writable: !0, value: t }) : r[s] = t;
 var q$2 = (r, s, t) => Be(r, typeof s != "symbol" ? s + "" : s, t), oe$1 = (r, s, t) => s.has(r) || Me("Cannot " + t);
-var ht$1 = (r, s, t) => (oe$1(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le$1 = (r, s, t) => s.has(r) ? Me("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt$1 = (r, s, t, e) => (oe$1(r, s, "write to private field"), s.set(r, t), t), he = (r, s, t) => (oe$1(r, s, "access private method"), t);
+var ht$2 = (r, s, t) => (oe$1(r, s, "read from private field"), t ? t.call(r) : s.get(r)), le$1 = (r, s, t) => s.has(r) ? Me("Cannot add the same private member more than once") : s instanceof WeakSet ? s.add(r) : s.set(r, t), Dt$1 = (r, s, t, e) => (oe$1(r, s, "write to private field"), s.set(r, t), t), he = (r, s, t) => (oe$1(r, s, "access private method"), t);
 function zt(r, s, t, e) {
   return r <= e && s >= t;
 }
@@ -85,7 +85,7 @@ function Te(r, s = 1e-9) {
     ).values()
   );
 }
-const fe$1 = Math.PI / 180, Ue = 180 / Math.PI, Z$1 = (r) => `[${r[0]}, ${r[1]}]`, Y$1 = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it$3 = ([r, s], [t, e]) => [r + t, s + e], Q$2 = ([r, s], [t, e]) => [r - t, s - e], It$2 = ([r, s]) => r * r + s * s, an$1 = ([r, s]) => Math.sqrt(It$2([r, s])), nt$2 = ([r, s], t) => [r * t, s * t], Rt$1 = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J$2 = (r, s = [0, 0]) => Math.sqrt(Rt$1(r, s));
+const fe$1 = Math.PI / 180, Ue = 180 / Math.PI, Z$1 = (r) => `[${r[0]}, ${r[1]}]`, Y$2 = ([r, s], [t, e], n = 1e-9) => Math.abs(r - t) <= n && Math.abs(s - e) <= n, it$3 = ([r, s], [t, e]) => [r + t, s + e], Q$2 = ([r, s], [t, e]) => [r - t, s - e], It$2 = ([r, s]) => r * r + s * s, an$1 = ([r, s]) => Math.sqrt(It$2([r, s])), nt$2 = ([r, s], t) => [r * t, s * t], Rt$1 = ([r, s], [t, e] = [0, 0]) => (r - t) ** 2 + (s - e) ** 2, J$3 = (r, s = [0, 0]) => Math.sqrt(Rt$1(r, s));
 function St$2([r, s], [t, e]) {
   return r * e - s * t;
 }
@@ -96,7 +96,7 @@ function un$1([r, s], [t, e] = [0, 0]) {
   return Math.atan2(e * r - s * t, r * t + s * e);
 }
 function H$1([r, s]) {
-  const t = J$2([r, s]);
+  const t = J$3([r, s]);
   return [r / t, s / t];
 }
 function Tt(r, s) {
@@ -107,21 +107,21 @@ function Ye([r, s]) {
   return Math.atan2(s, r);
 }
 function We(r) {
-  const s = J$2(r), t = Ye(r);
+  const s = J$3(r), t = Ye(r);
   return [s, t];
 }
 function Ie(r, s, t = 1e-9) {
   const e = St$2(r, s), n = It$2(r), i = It$2(s);
   return e * e < n * i * t * t;
 }
-function tt$2(r) {
+function tt$3(r) {
   return [-r[1], r[0]];
 }
 function Qt$1(r) {
   return [r[1], -r[0]];
 }
 function Qe(r, s, t) {
-  return Y$1(t, r) || Ie(Q$2(t, r), s);
+  return Y$2(t, r) || Ie(Q$2(t, r), s);
 }
 const Mt$2 = (r, s) => {
   const [t, e, n, i, o, l, h, a, u] = r, [c, g, d, w, p, P, f, M, E] = s;
@@ -153,7 +153,7 @@ const Mt$2 = (r, s) => {
   const [s, t, e, n, i, o, l, h, a] = r;
   return [s, n, l, t, i, h, e, o, a];
 };
-let et$3 = class et {
+let et$4 = class et {
   constructor(s) {
     q$2(this, "_matrix", [1, 0, 0, 0, 1, 0, 0, 0, 1]);
     s && (this._matrix = [...s]);
@@ -209,38 +209,38 @@ let et$3 = class et {
 };
 class Ze {
   translateX(s) {
-    const t = new et$3().translate(s, 0);
+    const t = new et$4().translate(s, 0);
     return this.transform(t);
   }
   translateY(s) {
-    const t = new et$3().translate(0, s);
+    const t = new et$4().translate(0, s);
     return this.transform(t);
   }
   translate(s, t) {
-    const e = new et$3().translate(s, t);
+    const e = new et$4().translate(s, t);
     return this.transform(e);
   }
   translateTo([s, t]) {
-    const e = new et$3().translate(s, t);
+    const e = new et$4().translate(s, t);
     return this.transform(e);
   }
   rotate(s, t) {
-    const e = new et$3().rotate(
+    const e = new et$4().rotate(
       s * fe$1,
       t
     );
     return this.transform(e);
   }
   scale(s, t) {
-    const e = new et$3().scale(s, t);
+    const e = new et$4().scale(s, t);
     return this.transform(e);
   }
   mirrorCenter(s) {
-    const t = new et$3().mirrorCenter(s);
+    const t = new et$4().mirrorCenter(s);
     return this.transform(t);
   }
   mirror(s = "x", t) {
-    const e = new et$3();
+    const e = new et$4();
     return s === "x" ? e.mirrorX() : s === "y" ? e.mirrorY() : e.mirrorLine(s, t), this.transform(e);
   }
 }
@@ -262,7 +262,7 @@ let xt$1 = class xt extends Ze {
     return this.repr;
   }
 };
-let at$2 = class at extends xt$1 {
+let at$3 = class at extends xt$1 {
   constructor() {
     super(...arguments);
     q$2(this, "segmentType", "LINE");
@@ -279,7 +279,7 @@ let at$2 = class at extends xt$1 {
     return it$3(this.firstPoint, nt$2(this.V, t));
   }
   get length() {
-    return J$2(this.firstPoint, this.lastPoint);
+    return J$3(this.firstPoint, this.lastPoint);
   }
   get squareLength() {
     return Rt$1(this.firstPoint, this.lastPoint);
@@ -301,7 +301,7 @@ let at$2 = class at extends xt$1 {
     return it$3(this.firstPoint, nt$2(this.V, 0.5));
   }
   isSame(t) {
-    return t instanceof at ? Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) || Y$1(this.lastPoint, t.firstPoint) && Y$1(this.firstPoint, t.lastPoint) : !1;
+    return t instanceof at ? Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) || Y$2(this.lastPoint, t.firstPoint) && Y$2(this.firstPoint, t.lastPoint) : !1;
   }
   clone() {
     return new at(this.firstPoint, this.lastPoint);
@@ -320,14 +320,14 @@ let at$2 = class at extends xt$1 {
   distanceFrom(t) {
     const e = Q$2(t, this.firstPoint), n = Pe(e, this.V) / this.squareLength;
     if (n < 0)
-      return J$2(t, this.firstPoint);
+      return J$3(t, this.firstPoint);
     if (n > 1)
-      return J$2(t, this.lastPoint);
+      return J$3(t, this.lastPoint);
     const i = this.paramPoint(n);
-    return J$2(t, i);
+    return J$3(t, i);
   }
   isOnSegment(t) {
-    if (Y$1(t, this.firstPoint, this.precision)) return !0;
+    if (Y$2(t, this.firstPoint, this.precision)) return !0;
     const e = Q$2(t, this.firstPoint);
     if (!Ie(this.V, e)) return !1;
     const n = Pe(e, this.V) / this.squareLength;
@@ -341,7 +341,7 @@ let at$2 = class at extends xt$1 {
     return H$1(this.V);
   }
   get normalVector() {
-    return tt$2(H$1(this.V));
+    return tt$3(H$1(this.V));
   }
   get tangentAtFirstPoint() {
     return H$1(this.V);
@@ -411,7 +411,7 @@ function cn$1(r, s, t = !1, e) {
     ).sort((h, a) => h[0] - a[0]);
     if (l.length === 0) return null;
     if (l.length === 1) return null;
-    if (l.length === 2) return new at$2(l[0], l[1]);
+    if (l.length === 2) return new at$3(l[0], l[1]);
     throw console.error(l), new Error(
       "Unexpected number of points while intersecting parallel lines"
     );
@@ -423,7 +423,7 @@ const Ot$1 = (r, s) => {
   const t = Q$2(r, s);
   return We(t);
 };
-let ct$2 = class ct extends xt$1 {
+let ct$3 = class ct extends xt$1 {
   constructor(t, e, n, i = !1, { ignoreChecks: o = !1 } = {}) {
     super(t, e);
     q$2(this, "segmentType", "ARC");
@@ -436,9 +436,9 @@ let ct$2 = class ct extends xt$1 {
     q$2(this, "_lastAngle", null);
     q$2(this, "_boundingBox", null);
     if (this.center = n, this.clockwise = i, !o) {
-      if (Y$1(t, e))
+      if (Y$2(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
-      if (Math.abs(this.radius - J$2(this.lastPoint, this.center)) > this.precision)
+      if (Math.abs(this.radius - J$3(this.lastPoint, this.center)) > this.precision)
         throw new Error(
           `Invalid arc, radius does not match between ${Z$1(
             t
@@ -501,7 +501,7 @@ let ct$2 = class ct extends xt$1 {
     return i;
   }
   get radius() {
-    return this._radius === null && (this._radius = J$2(this.firstPoint, this.center)), this._radius;
+    return this._radius === null && (this._radius = J$3(this.firstPoint, this.center)), this._radius;
   }
   get firstAngle() {
     if (this._firstAngle === null) {
@@ -527,7 +527,7 @@ let ct$2 = class ct extends xt$1 {
     return this.paramPoint(0.5);
   }
   isSame(t) {
-    return !(t instanceof ct) || !Y$1(this.center, t.center) ? !1 : Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y$1(this.lastPoint, t.firstPoint) && Y$1(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
+    return !(t instanceof ct) || !Y$2(this.center, t.center) ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || Y$2(this.lastPoint, t.firstPoint) && Y$2(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
   }
   clone() {
     return new ct(
@@ -567,7 +567,7 @@ let ct$2 = class ct extends xt$1 {
     );
   }
   isOnSegment(t) {
-    if (Y$1(t, this.firstPoint) || Y$1(t, this.lastPoint))
+    if (Y$2(t, this.firstPoint) || Y$2(t, this.lastPoint))
       return !0;
     const [e, n] = Ot$1(t, this.center);
     if (Math.abs(e - this.radius) > this.precision) return !1;
@@ -586,15 +586,15 @@ let ct$2 = class ct extends xt$1 {
     if (!this.isValidParameter(i))
       throw new Error("Point is not on the arc");
     const o = Tt(1, n);
-    return (this.clockwise ? Qt$1 : tt$2)(H$1(o));
+    return (this.clockwise ? Qt$1 : tt$3)(H$1(o));
   }
   get tangentAtFirstPoint() {
     const t = Tt(1, this.firstAngle);
-    return (this.clockwise ? Qt$1 : tt$2)(H$1(t));
+    return (this.clockwise ? Qt$1 : tt$3)(H$1(t));
   }
   get tangentAtLastPoint() {
     const t = Tt(1, this.lastAngle);
-    return (this.clockwise ? Qt$1 : tt$2)(H$1(t));
+    return (this.clockwise ? Qt$1 : tt$3)(H$1(t));
   }
   splitAt(t) {
     let e;
@@ -630,7 +630,7 @@ let ct$2 = class ct extends xt$1 {
   }
 };
 function fn$1(r, s, t) {
-  const e = new at$2(s, r), n = new at$2(s, t), i = tt$2(e.tangentAtFirstPoint), o = tt$2(n.tangentAtLastPoint), l = me(
+  const e = new at$3(s, r), n = new at$3(s, t), i = tt$3(e.tangentAtFirstPoint), o = tt$3(n.tangentAtLastPoint), l = me(
     { firstPoint: e.midPoint, V: i, precision: 1e-9 },
     { firstPoint: n.midPoint, V: o, precision: 1e-9 }
   );
@@ -640,7 +640,7 @@ function fn$1(r, s, t) {
     Q$2(r, s),
     Q$2(t, s)
   ) > 0;
-  return new ct$2(
+  return new ct$3(
     r,
     t,
     it$3(e.midPoint, nt$2(i, l.intersectionParam1)),
@@ -649,11 +649,11 @@ function fn$1(r, s, t) {
   );
 }
 function mn$2(r, s, t) {
-  const e = new at$2(r, s), n = tt$2(e.tangentAtFirstPoint), i = me(
+  const e = new at$3(r, s), n = tt$3(e.tangentAtFirstPoint), i = me(
     { firstPoint: e.midPoint, V: n, precision: 1e-9 },
     {
       firstPoint: r,
-      V: tt$2(t),
+      V: tt$3(t),
       precision: 1e-9
     }
   );
@@ -666,7 +666,7 @@ function mn$2(r, s, t) {
     Q$2(o, r),
     Q$2(o, it$3(r, t))
   ) < 0;
-  return new ct$2(r, s, o, l, {
+  return new ct$3(r, s, o, l, {
     ignoreChecks: !0
   });
 }
@@ -781,7 +781,7 @@ function qe(r) {
     });
   }), t;
 }
-var $ = {};
+var $$1 = {};
 const ts = Object.prototype.toString;
 function Ct$2(r) {
   const s = ts.call(r);
@@ -848,7 +848,7 @@ const os = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
   __proto__: null,
   default: rs
 }, Symbol.toStringTag, { value: "Module" })), ls = /* @__PURE__ */ qe(os);
-Object.defineProperty($, "__esModule", { value: !0 });
+Object.defineProperty($$1, "__esModule", { value: !0 });
 var st$3 = ss, je = ls;
 const Ut$1 = " ".repeat(2), Fe = " ".repeat(4);
 function hs() {
@@ -1299,12 +1299,12 @@ function cs(r, s) {
     return this;
   };
 }
-function ot$3(r, s, t) {
+function ot$4(r, s, t) {
   let e = t ? r.rows : r.rows - 1;
   if (s < 0 || s > e)
     throw new RangeError("Row index out of range");
 }
-function lt$2(r, s, t) {
+function lt$3(r, s, t) {
   let e = t ? r.columns : r.columns - 1;
   if (s < 0 || s > e)
     throw new RangeError("Column index out of range");
@@ -1728,7 +1728,7 @@ let V$1 = class V {
     return this.mulS(-1);
   }
   getRow(s) {
-    ot$3(this, s);
+    ot$4(this, s);
     let t = [];
     for (let e = 0; e < this.columns; e++)
       t.push(this.get(s, e));
@@ -1738,13 +1738,13 @@ let V$1 = class V {
     return _$3.rowVector(this.getRow(s));
   }
   setRow(s, t) {
-    ot$3(this, s), t = Pt$2(this, t);
+    ot$4(this, s), t = Pt$2(this, t);
     for (let e = 0; e < this.columns; e++)
       this.set(s, e, t[e]);
     return this;
   }
   swapRows(s, t) {
-    ot$3(this, s), ot$3(this, t);
+    ot$4(this, s), ot$4(this, t);
     for (let e = 0; e < this.columns; e++) {
       let n = this.get(s, e);
       this.set(s, e, this.get(t, e)), this.set(t, e, n);
@@ -1752,7 +1752,7 @@ let V$1 = class V {
     return this;
   }
   getColumn(s) {
-    lt$2(this, s);
+    lt$3(this, s);
     let t = [];
     for (let e = 0; e < this.rows; e++)
       t.push(this.get(e, s));
@@ -1762,13 +1762,13 @@ let V$1 = class V {
     return _$3.columnVector(this.getColumn(s));
   }
   setColumn(s, t) {
-    lt$2(this, s), t = bt$2(this, t);
+    lt$3(this, s), t = bt$2(this, t);
     for (let e = 0; e < this.rows; e++)
       this.set(e, s, t[e]);
     return this;
   }
   swapColumns(s, t) {
-    lt$2(this, s), lt$2(this, t);
+    lt$3(this, s), lt$3(this, t);
     for (let e = 0; e < this.rows; e++) {
       let n = this.get(e, s);
       this.set(e, s, this.get(e, t)), this.set(e, t, n);
@@ -1832,13 +1832,13 @@ let V$1 = class V {
     return this;
   }
   mulRow(s, t) {
-    ot$3(this, s);
+    ot$4(this, s);
     for (let e = 0; e < this.columns; e++)
       this.set(s, e, this.get(s, e) * t);
     return this;
   }
   mulColumn(s, t) {
-    lt$2(this, s);
+    lt$3(this, s);
     for (let e = 0; e < this.rows; e++)
       this.set(e, s, this.get(e, s) * t);
     return this;
@@ -1918,7 +1918,7 @@ let V$1 = class V {
     return t;
   }
   maxRow(s) {
-    if (ot$3(this, s), this.isEmpty())
+    if (ot$4(this, s), this.isEmpty())
       return NaN;
     let t = this.get(s, 0);
     for (let e = 1; e < this.columns; e++)
@@ -1926,14 +1926,14 @@ let V$1 = class V {
     return t;
   }
   maxRowIndex(s) {
-    ot$3(this, s), yt$2(this);
+    ot$4(this, s), yt$2(this);
     let t = this.get(s, 0), e = [s, 0];
     for (let n = 1; n < this.columns; n++)
       this.get(s, n) > t && (t = this.get(s, n), e[1] = n);
     return e;
   }
   minRow(s) {
-    if (ot$3(this, s), this.isEmpty())
+    if (ot$4(this, s), this.isEmpty())
       return NaN;
     let t = this.get(s, 0);
     for (let e = 1; e < this.columns; e++)
@@ -1941,14 +1941,14 @@ let V$1 = class V {
     return t;
   }
   minRowIndex(s) {
-    ot$3(this, s), yt$2(this);
+    ot$4(this, s), yt$2(this);
     let t = this.get(s, 0), e = [s, 0];
     for (let n = 1; n < this.columns; n++)
       this.get(s, n) < t && (t = this.get(s, n), e[1] = n);
     return e;
   }
   maxColumn(s) {
-    if (lt$2(this, s), this.isEmpty())
+    if (lt$3(this, s), this.isEmpty())
       return NaN;
     let t = this.get(0, s);
     for (let e = 1; e < this.rows; e++)
@@ -1956,14 +1956,14 @@ let V$1 = class V {
     return t;
   }
   maxColumnIndex(s) {
-    lt$2(this, s), yt$2(this);
+    lt$3(this, s), yt$2(this);
     let t = this.get(0, s), e = [0, s];
     for (let n = 1; n < this.rows; n++)
       this.get(n, s) > t && (t = this.get(n, s), e[0] = n);
     return e;
   }
   minColumn(s) {
-    if (lt$2(this, s), this.isEmpty())
+    if (lt$3(this, s), this.isEmpty())
       return NaN;
     let t = this.get(0, s);
     for (let e = 1; e < this.rows; e++)
@@ -1971,7 +1971,7 @@ let V$1 = class V {
     return t;
   }
   minColumnIndex(s) {
-    lt$2(this, s), yt$2(this);
+    lt$3(this, s), yt$2(this);
     let t = this.get(0, s), e = [0, s];
     for (let n = 1; n < this.rows; n++)
       this.get(n, s) < t && (t = this.get(n, s), e[0] = n);
@@ -2466,13 +2466,13 @@ let _$3 = (dt$1 = class extends V$1 {
     return this.data[t][e];
   }
   removeRow(t) {
-    return ot$3(this, t), this.data.splice(t, 1), this.rows -= 1, this;
+    return ot$4(this, t), this.data.splice(t, 1), this.rows -= 1, this;
   }
   addRow(t, e) {
-    return e === void 0 && (e = t, t = this.rows), ot$3(this, t, !0), e = Float64Array.from(Pt$2(this, e)), this.data.splice(t, 0, e), this.rows += 1, this;
+    return e === void 0 && (e = t, t = this.rows), ot$4(this, t, !0), e = Float64Array.from(Pt$2(this, e)), this.data.splice(t, 0, e), this.rows += 1, this;
   }
   removeColumn(t) {
-    lt$2(this, t);
+    lt$3(this, t);
     for (let e = 0; e < this.rows; e++) {
       const n = new Float64Array(this.columns - 1);
       for (let i = 0; i < t; i++)
@@ -2484,7 +2484,7 @@ let _$3 = (dt$1 = class extends V$1 {
     return this.columns -= 1, this;
   }
   addColumn(t, e) {
-    typeof e > "u" && (e = t, t = this.columns), lt$2(this, t, !0), e = bt$2(this, e);
+    typeof e > "u" && (e = t, t = this.columns), lt$3(this, t, !0), e = bt$2(this, e);
     for (let n = 0; n < this.rows; n++) {
       const i = new Float64Array(this.columns + 1);
       let o = 0;
@@ -2510,7 +2510,7 @@ ue$1 = function(t, e) {
   this.rows = t, this.columns = e;
 }, dt$1);
 cs(V$1, _$3);
-var K$2;
+var K$3;
 const Jt = class Jt extends V$1 {
   /**
    * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize
@@ -2519,27 +2519,27 @@ const Jt = class Jt extends V$1 {
   constructor(t) {
     super();
     /** @type {Matrix} */
-    le$1(this, K$2);
+    le$1(this, K$3);
     if (_$3.isMatrix(t)) {
       if (!t.isSymmetric())
         throw new TypeError("not symmetric data");
-      Dt$1(this, K$2, _$3.copy(
+      Dt$1(this, K$3, _$3.copy(
         t,
         new _$3(t.rows, t.rows)
       ));
     } else if (Number.isInteger(t) && t >= 0)
-      Dt$1(this, K$2, new _$3(t, t));
-    else if (Dt$1(this, K$2, new _$3(t)), !this.isSymmetric())
+      Dt$1(this, K$3, new _$3(t, t));
+    else if (Dt$1(this, K$3, new _$3(t)), !this.isSymmetric())
       throw new TypeError("not symmetric data");
   }
   get size() {
-    return ht$1(this, K$2).size;
+    return ht$2(this, K$3).size;
   }
   get rows() {
-    return ht$1(this, K$2).rows;
+    return ht$2(this, K$3).rows;
   }
   get columns() {
-    return ht$1(this, K$2).columns;
+    return ht$2(this, K$3).columns;
   }
   get diagonalSize() {
     return this.rows;
@@ -2578,18 +2578,18 @@ const Jt = class Jt extends V$1 {
     return new _$3(this);
   }
   get(t, e) {
-    return ht$1(this, K$2).get(t, e);
+    return ht$2(this, K$3).get(t, e);
   }
   set(t, e, n) {
-    return ht$1(this, K$2).set(t, e, n), ht$1(this, K$2).set(e, t, n), this;
+    return ht$2(this, K$3).set(t, e, n), ht$2(this, K$3).set(e, t, n), this;
   }
   removeCross(t) {
-    return ht$1(this, K$2).removeRow(t), ht$1(this, K$2).removeColumn(t), this;
+    return ht$2(this, K$3).removeRow(t), ht$2(this, K$3).removeColumn(t), this;
   }
   addCross(t, e) {
     e === void 0 && (e = t, t = this.diagonalSize);
     const n = e.slice();
-    return n.splice(t, 1), ht$1(this, K$2).addRow(t, n), ht$1(this, K$2).addColumn(t, e), this;
+    return n.splice(t, 1), ht$2(this, K$3).addRow(t, n), ht$2(this, K$3).addColumn(t, e), this;
   }
   /**
    * @param {Mask[]} mask
@@ -2669,7 +2669,7 @@ const Jt = class Jt extends V$1 {
       yield this.get(t, e), ++e >= this.diagonalSize && (e = ++t);
   }
 };
-K$2 = new WeakMap();
+K$3 = new WeakMap();
 let pt$1 = Jt;
 pt$1.prototype.klassType = "SymmetricMatrix";
 let te$1 = class te extends pt$1 {
@@ -2755,7 +2755,7 @@ let ft$2 = class ft extends V$1 {
 };
 class Cs extends ft$2 {
   constructor(s, t) {
-    lt$2(s, t), super(s, s.rows, 1), this.column = t;
+    lt$3(s, t), super(s, s.rows, 1), this.column = t;
   }
   set(s, t, e) {
     return this.matrix.set(s, this.column, e), this;
@@ -2799,7 +2799,7 @@ class xs extends ft$2 {
 }
 class As extends ft$2 {
   constructor(s, t) {
-    ot$3(s, t), super(s, 1, s.columns), this.row = t;
+    ot$4(s, t), super(s, 1, s.columns), this.row = t;
   }
   set(s, t, e) {
     return this.matrix.set(this.row, t, e), this;
@@ -2885,7 +2885,7 @@ class Ae extends V$1 {
     return s * this.columns + t;
   }
 }
-let rt$3 = class rt extends V$1 {
+let rt$4 = class rt extends V$1 {
   constructor(s) {
     super(), this.data = s, this.rows = s.length, this.columns = s[0].length;
   }
@@ -2898,12 +2898,12 @@ let rt$3 = class rt extends V$1 {
 };
 function Ls(r, s) {
   if (st$3.isAnyArray(r))
-    return r[0] && st$3.isAnyArray(r[0]) ? new rt$3(r) : new Ae(r, s);
+    return r[0] && st$3.isAnyArray(r[0]) ? new rt$4(r) : new Ae(r, s);
   throw new Error("the argument is not an array");
 }
 let ee$1 = class ee {
   constructor(s) {
-    s = rt$3.checkMatrix(s);
+    s = rt$4.checkMatrix(s);
     let t = s.clone(), e = t.rows, n = t.columns, i = new Float64Array(e), o = 1, l, h, a, u, c, g, d, w, p;
     for (l = 0; l < e; l++)
       i[l] = l;
@@ -2989,7 +2989,7 @@ function ut(r, s) {
 }
 class pe {
   constructor(s) {
-    s = rt$3.checkMatrix(s);
+    s = rt$4.checkMatrix(s);
     let t = s.clone(), e = s.rows, n = s.columns, i = new Float64Array(n), o, l, h, a;
     for (h = 0; h < n; h++) {
       let u = 0;
@@ -3065,7 +3065,7 @@ class pe {
 }
 let vt$2 = class vt {
   constructor(s, t = {}) {
-    if (s = rt$3.checkMatrix(s), s.isEmpty())
+    if (s = rt$4.checkMatrix(s), s.isEmpty())
       throw new Error("Matrix must be non-empty");
     let e = s.rows, n = s.columns;
     const {
@@ -3343,10 +3343,10 @@ let vt$2 = class vt {
   }
 };
 function Ds(r, s = !1) {
-  return r = rt$3.checkMatrix(r), s ? new vt$2(r).inverse() : Ve(r, _$3.eye(r.rows));
+  return r = rt$4.checkMatrix(r), s ? new vt$2(r).inverse() : Ve(r, _$3.eye(r.rows));
 }
 function Ve(r, s, t = !1) {
-  return r = rt$3.checkMatrix(r), s = rt$3.checkMatrix(s), t ? new vt$2(r).solve(s) : r.isSquare() ? new ee$1(r).solve(s) : new pe(r).solve(s);
+  return r = rt$4.checkMatrix(r), s = rt$4.checkMatrix(s), t ? new vt$2(r).solve(s) : r.isSquare() ? new ee$1(r).solve(s) : new pe(r).solve(s);
 }
 function Xt$1(r) {
   if (r = _$3.checkMatrix(r), r.isSquare()) {
@@ -3433,7 +3433,7 @@ function Ws(r, s = r, t = {}) {
 let Ne = class {
   constructor(s, t = {}) {
     const { assumeSymmetric: e = !1 } = t;
-    if (s = rt$3.checkMatrix(s), !s.isSquare())
+    if (s = rt$4.checkMatrix(s), !s.isSquare())
       throw new Error("Matrix is not a square matrix");
     if (s.isEmpty())
       throw new Error("Matrix must be non-empty");
@@ -3696,7 +3696,7 @@ function Wt(r, s, t, e) {
 }
 class $e {
   constructor(s) {
-    if (s = rt$3.checkMatrix(s), !s.isSymmetric())
+    if (s = rt$4.checkMatrix(s), !s.isSymmetric())
       throw new Error("Matrix is not symmetric");
     let t = s, e = t.rows, n = new _$3(e, e), i = !0, o, l, h;
     for (l = 0; l < e; l++) {
@@ -3716,7 +3716,7 @@ class $e {
     return this.positiveDefinite;
   }
   solve(s) {
-    s = rt$3.checkMatrix(s);
+    s = rt$4.checkMatrix(s);
     let t = this.L, e = t.rows;
     if (s.rows !== e)
       throw new Error("Matrix dimensions do not match");
@@ -3743,7 +3743,7 @@ class $e {
 }
 class Le {
   constructor(s, t = {}) {
-    s = rt$3.checkMatrix(s);
+    s = rt$4.checkMatrix(s);
     let { Y: e } = t;
     const {
       scaleScores: n = !1,
@@ -3752,7 +3752,7 @@ class Le {
     } = t;
     let l;
     if (e) {
-      if (st$3.isAnyArray(e) && typeof e[0] == "number" ? e = _$3.columnVector(e) : e = rt$3.checkMatrix(e), e.rows !== s.rows)
+      if (st$3.isAnyArray(e) && typeof e[0] == "number" ? e = _$3.columnVector(e) : e = rt$4.checkMatrix(e), e.rows !== s.rows)
         throw new Error("Y should have the same number of rows as X");
       l = e.getColumnVector(0);
     } else
@@ -3771,42 +3771,42 @@ class Le {
       this.w = c.transpose(), this.s = a.transpose().mmul(a).sqrt(), n ? this.t = a.clone().div(this.s.get(0, 0)) : this.t = a, this.xResidual = s.sub(a.mmul(c.transpose()));
   }
 }
-$.AbstractMatrix = V$1;
-$.CHO = $e;
-$.CholeskyDecomposition = $e;
-$.DistanceMatrix = te$1;
-$.EVD = Ne;
-var Js = $.EigenvalueDecomposition = Ne;
-$.LU = ee$1;
-$.LuDecomposition = ee$1;
-var De = $.Matrix = _$3;
-$.MatrixColumnSelectionView = qs;
-$.MatrixColumnView = Cs;
-$.MatrixFlipColumnView = Fs;
-$.MatrixFlipRowView = xs;
-$.MatrixRowSelectionView = Vs;
-$.MatrixRowView = As;
-$.MatrixSelectionView = Gt$1;
-$.MatrixSubView = Ns;
-$.MatrixTransposeView = $s;
-$.NIPALS = Le;
-$.Nipals = Le;
-$.QR = pe;
-$.QrDecomposition = pe;
-$.SVD = vt$2;
-$.SingularValueDecomposition = vt$2;
-$.SymmetricMatrix = pt$1;
-$.WrapperMatrix1D = Ae;
-$.WrapperMatrix2D = rt$3;
-$.correlation = Ws;
-$.covariance = Ys;
-var Re = $.default = _$3;
-$.determinant = Xt$1;
-$.inverse = Ds;
-$.linearDependencies = Bs;
-$.pseudoInverse = Us;
-$.solve = Ve;
-$.wrap = Ls;
+$$1.AbstractMatrix = V$1;
+$$1.CHO = $e;
+$$1.CholeskyDecomposition = $e;
+$$1.DistanceMatrix = te$1;
+$$1.EVD = Ne;
+var Js = $$1.EigenvalueDecomposition = Ne;
+$$1.LU = ee$1;
+$$1.LuDecomposition = ee$1;
+var De = $$1.Matrix = _$3;
+$$1.MatrixColumnSelectionView = qs;
+$$1.MatrixColumnView = Cs;
+$$1.MatrixFlipColumnView = Fs;
+$$1.MatrixFlipRowView = xs;
+$$1.MatrixRowSelectionView = Vs;
+$$1.MatrixRowView = As;
+$$1.MatrixSelectionView = Gt$1;
+$$1.MatrixSubView = Ns;
+$$1.MatrixTransposeView = $s;
+$$1.NIPALS = Le;
+$$1.Nipals = Le;
+$$1.QR = pe;
+$$1.QrDecomposition = pe;
+$$1.SVD = vt$2;
+$$1.SingularValueDecomposition = vt$2;
+$$1.SymmetricMatrix = pt$1;
+$$1.WrapperMatrix1D = Ae;
+$$1.WrapperMatrix2D = rt$4;
+$$1.correlation = Ws;
+$$1.covariance = Ys;
+var Re = $$1.default = _$3;
+$$1.determinant = Xt$1;
+$$1.inverse = Ds;
+$$1.linearDependencies = Bs;
+$$1.pseudoInverse = Us;
+$$1.solve = Ve;
+$$1.wrap = Ls;
 const Ks = Js, Hs = De;
 Re.Matrix && Re.Matrix;
 function qt(r, s, t) {
@@ -4036,7 +4036,7 @@ let Et$1 = class Et extends xt$1 {
     );
   }
   get alignedCurve() {
-    const t = [-this.firstPoint[0], -this.firstPoint[1]], e = Q$2(this.lastPoint, this.firstPoint), n = Math.atan2(e[1], e[0]), i = new et$3();
+    const t = [-this.firstPoint[0], -this.firstPoint[1]], e = Q$2(this.lastPoint, this.firstPoint), n = Math.atan2(e[1], e[0]), i = new et$4();
     return i.translate(t[0], t[1]), i.rotate(-n), this.transform(i);
   }
   getInflexionParameters() {
@@ -4067,13 +4067,13 @@ let Et$1 = class Et extends xt$1 {
     );
   }
   isSame(t) {
-    return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) && Y$1(this.firstControlPoint, t.firstControlPoint) && Y$1(this.lastControlPoint, t.lastControlPoint);
+    return t.segmentType !== "CUBIC_BEZIER" ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && Y$2(this.firstControlPoint, t.firstControlPoint) && Y$2(this.lastControlPoint, t.lastControlPoint);
   }
   distanceFrom(t) {
     const n = Ce((i) => Rt$1(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
-      J$2(this.firstPoint, t),
-      J$2(this.lastPoint, t)
+      J$3(this.firstPoint, t),
+      J$3(this.lastPoint, t)
     ) : Math.sqrt(n.fMin);
   }
   isOnSegment(t) {
@@ -4109,13 +4109,13 @@ let Et$1 = class Et extends xt$1 {
   }
   normalAt(t) {
     const e = this.tangentAt(t);
-    return tt$2(e);
+    return tt$3(e);
   }
   get normalAtFirstPoint() {
-    return tt$2(this.tangentAtFirstPoint);
+    return tt$3(this.tangentAtFirstPoint);
   }
   get normalAtLastPoint() {
-    return tt$2(this.tangentAtLastPoint);
+    return tt$3(this.tangentAtLastPoint);
   }
   splitAtParameters(t, e = null) {
     const n = [...t];
@@ -4203,8 +4203,8 @@ let Et$1 = class Et extends xt$1 {
     return ze(e - t, n, i, o).filter((l) => l >= -this.precision && l <= 1 + this.precision);
   }
   pointToParam(t) {
-    if (Y$1(t, this.firstPoint, this.precision)) return 0;
-    if (Y$1(t, this.lastPoint, this.precision)) return 1;
+    if (Y$2(t, this.firstPoint, this.precision)) return 0;
+    if (Y$2(t, this.lastPoint, this.precision)) return 1;
     const e = this.paramsAtY(t[1]);
     if (e.length === 0)
       throw new Error("Point is not on the curve");
@@ -4247,7 +4247,7 @@ let jt$1 = class jt extends xt$1 {
     if (this.tiltAngle = wt$2(
       c ? g : g + Math.PI / 2
     ), this.clockwise = h, !a) {
-      if (Y$1(t, e))
+      if (Y$2(t, e))
         throw new Error("Invalid arc, cannot be a full circle");
       if (!this.isPointOnEllipse(t))
         throw new Error(
@@ -4370,7 +4370,7 @@ let jt$1 = class jt extends xt$1 {
     return 1 - t >= -this.precision && t >= -this.precision;
   }
   isSame(t) {
-    return Y$1(this.center, t.center) && Math.abs(this.majorRadius - t.majorRadius) < this.precision && Math.abs(this.minorRadius - t.minorRadius) < this.precision && (Math.abs(this.tiltAngle - t.tiltAngle) < this.precision || Math.abs(Math.abs(this.tiltAngle - t.tiltAngle) - Math.PI) < this.precision) && (Y$1(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || Y$1(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
+    return Y$2(this.center, t.center) && Math.abs(this.majorRadius - t.majorRadius) < this.precision && Math.abs(this.minorRadius - t.minorRadius) < this.precision && (Math.abs(this.tiltAngle - t.tiltAngle) < this.precision || Math.abs(Math.abs(this.tiltAngle - t.tiltAngle) - Math.PI) < this.precision) && (Y$2(this.firstPoint, t.firstPoint) && this.clockwise === t.clockwise || Y$2(this.firstPoint, t.lastPoint) && this.clockwise !== t.clockwise);
   }
   pointTheta(t) {
     const e = this.ellipseReferenceFrameTransform.transform(t), n = Math.atan2(
@@ -4383,7 +4383,7 @@ let jt$1 = class jt extends xt$1 {
     return Zt(this.firstAngle, wt$2(t), this.clockwise) / this.deltaAngle;
   }
   isPointOnEllipse(t) {
-    const [e, n] = this.focals, i = J$2(t, e), o = J$2(t, n);
+    const [e, n] = this.focals, i = J$3(t, e), o = J$3(t, n);
     return Math.abs(2 * this.majorRadius - i - o) < this.precision;
   }
   isOnSegment(t) {
@@ -4391,9 +4391,9 @@ let jt$1 = class jt extends xt$1 {
   }
   distanceFrom(t) {
     let e;
-    if (Y$1(t, this.center) ? e = it$3(
+    if (Y$2(t, this.center) ? e = it$3(
       this.center,
-      nt$2(tt$2(this.majorAxis), this.minorRadius)
+      nt$2(tt$3(this.majorAxis), this.minorRadius)
     ) : e = this.reverseEllipseReferenceFrameTransform.transform(
       ln$1(
         this.majorRadius,
@@ -4401,27 +4401,27 @@ let jt$1 = class jt extends xt$1 {
         this.ellipseReferenceFrameTransform.transform(t)
       )
     ), this.isValidParameter(this.thetaToParam(this.pointTheta(t))))
-      return J$2(t, e);
+      return J$3(t, e);
     if (Qe(t, this.majorAxis, this.center)) {
       const n = wt$2(
         2 * Math.PI - this.pointTheta(t)
       ), i = this.thetaToParam(n);
       if (this.isValidParameter(i))
-        return J$2(t, this.paramPoint(i));
+        return J$3(t, this.paramPoint(i));
     }
     return Math.min(
-      J$2(t, this.firstPoint),
-      J$2(t, this.lastPoint)
+      J$3(t, this.firstPoint),
+      J$3(t, this.lastPoint)
     );
   }
   get ellipseReferenceFrameTransform() {
-    return this._ellipseReferenceFrameTransform === void 0 && (this._ellipseReferenceFrameTransform = new et$3().translate(-this.center[0], -this.center[1]).rotate(-this.tiltAngle)), this._ellipseReferenceFrameTransform;
+    return this._ellipseReferenceFrameTransform === void 0 && (this._ellipseReferenceFrameTransform = new et$4().translate(-this.center[0], -this.center[1]).rotate(-this.tiltAngle)), this._ellipseReferenceFrameTransform;
   }
   get reverseEllipseReferenceFrameTransform() {
-    return this._reverseEllipseReferenceFrameTransform === void 0 && (this._reverseEllipseReferenceFrameTransform = new et$3().rotate(this.tiltAngle).translate(this.center[0], this.center[1])), this._reverseEllipseReferenceFrameTransform;
+    return this._reverseEllipseReferenceFrameTransform === void 0 && (this._reverseEllipseReferenceFrameTransform = new et$4().rotate(this.tiltAngle).translate(this.center[0], this.center[1])), this._reverseEllipseReferenceFrameTransform;
   }
   get rotateFromEllipseReferenceFrame() {
-    return this._rotateFromEllipseReferenceFrame === void 0 && (this._rotateFromEllipseReferenceFrame = new et$3().rotate(
+    return this._rotateFromEllipseReferenceFrame === void 0 && (this._rotateFromEllipseReferenceFrame = new et$4().rotate(
       this.tiltAngle
     )), this._rotateFromEllipseReferenceFrame;
   }
@@ -4440,7 +4440,7 @@ let jt$1 = class jt extends xt$1 {
   }
   normalAt(t) {
     const e = this.tangentAt(t);
-    return this.clockwise ? tt$2(e) : Qt$1(e);
+    return this.clockwise ? tt$3(e) : Qt$1(e);
   }
   gradientAt(t) {
     const e = this.firstAngle + t * this.deltaAngle * (this.clockwise ? -1 : 1), n = -this.majorRadius * this.deltaAngle * Math.sin(e), i = this.minorRadius * this.deltaAngle * Math.cos(e), o = this.clockwise ? [-n, -i] : [n, i];
@@ -4510,7 +4510,7 @@ function pn$1(r, s, t, e, n, i, o) {
     !i,
     o
   );
-  return Math.abs(h - a) < 1e-9 ? new ct$2(r, s, l, o) : new jt$1(r, s, l, h, a, n, o);
+  return Math.abs(h - a) < 1e-9 ? new ct$3(r, s, l, o) : new jt$1(r, s, l, h, a, n, o);
 }
 function on$1([r, s], [t, e], n, i, o, l, h) {
   if (n < 0 && (n = -n), i < 0 && (i = -i), n == 0 || i == 0)
@@ -4592,13 +4592,13 @@ let _t$1 = class _t extends xt$1 {
     );
   }
   isSame(t) {
-    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y$1(this.firstPoint, t.firstPoint) && Y$1(this.lastPoint, t.lastPoint) && Y$1(this.controlPoint, t.controlPoint);
+    return t.segmentType !== "QUADRATIC_BEZIER" ? !1 : Y$2(this.firstPoint, t.firstPoint) && Y$2(this.lastPoint, t.lastPoint) && Y$2(this.controlPoint, t.controlPoint);
   }
   distanceFrom(t) {
     const n = Ce((i) => Rt$1(this.paramPoint(i), t), this.precision);
     return n.argMin < -this.precision || n.argMin > 1 + this.precision ? Math.min(
-      J$2(this.firstPoint, t),
-      J$2(this.lastPoint, t)
+      J$3(this.firstPoint, t),
+      J$3(this.lastPoint, t)
     ) : Math.sqrt(n.fMin);
   }
   isOnSegment(t) {
@@ -4639,13 +4639,13 @@ let _t$1 = class _t extends xt$1 {
   }
   normalAt(t) {
     const e = this.tangentAt(t);
-    return tt$2(e);
+    return tt$3(e);
   }
   get normalAtFirstPoint() {
-    return tt$2(this.tangentAtFirstPoint);
+    return tt$3(this.tangentAtFirstPoint);
   }
   get normalAtLastPoint() {
-    return tt$2(this.tangentAtLastPoint);
+    return tt$3(this.tangentAtLastPoint);
   }
   splitAtParameters(t, e = null) {
     const n = [...t];
@@ -4742,8 +4742,8 @@ function dn$1(t, n) {
   const e = Q$2(n, t.firstPoint), s = Pe(e, t.V) / t.squareLength;
   return t.paramPoint(s);
 }
-function K$1(t, n, e) {
-  const s = e || t.precision, i = dn$1(t, n.center), o = J$2(i, n.center);
+function K$2(t, n, e) {
+  const s = e || t.precision, i = dn$1(t, n.center), o = J$3(i, n.center);
   if (o > n.radius + s) return [];
   if (Math.abs(o - n.radius) < s) {
     const c = i;
@@ -4758,7 +4758,7 @@ function K$1(t, n, e) {
 }
 const mn$1 = (t) => {
   const { firstPoint: n, lastPoint: e, center: s, clockwise: i } = t;
-  return new ct$2(e, n, s, i, {
+  return new ct$3(e, n, s, i, {
     ignoreChecks: !0
   });
 }, gn$1 = (t, n) => {
@@ -4777,11 +4777,11 @@ const mn$1 = (t) => {
   if (e.length === 0) return [];
   if (e.length === 1) return [];
   if (e.length === 2)
-    return t.isSame(mn$1(n)) ? [] : [new ct$2(e[0], e[1], t.center, t.clockwise)];
+    return t.isSame(mn$1(n)) ? [] : [new ct$3(e[0], e[1], t.center, t.clockwise)];
   if (e.length === 3) {
-    const s = Y$1(e[0], n.lastPoint) || Y$1(e[0], n.firstPoint) ? 1 : 0;
+    const s = Y$2(e[0], n.lastPoint) || Y$2(e[0], n.firstPoint) ? 1 : 0;
     return [
-      new ct$2(
+      new ct$3(
         e[0 + s],
         e[1 + s],
         t.center,
@@ -4790,13 +4790,13 @@ const mn$1 = (t) => {
     ];
   } else if (e.length === 4)
     return [
-      new ct$2(e[0], e[1], t.center, t.clockwise),
-      new ct$2(e[2], e[3], t.center, t.clockwise)
+      new ct$3(e[0], e[1], t.center, t.clockwise),
+      new ct$3(e[2], e[3], t.center, t.clockwise)
     ];
   throw new Error("Bug in the arc arc overlap algorithm");
 };
 function Dt(t, n, e = !1, s) {
-  const i = s || t.precision, o = J$2(t.center, n.center), l = t.radius + n.radius;
+  const i = s || t.precision, o = J$3(t.center, n.center), l = t.radius + n.radius;
   if (o > l + i)
     return [];
   const r = Math.abs(t.radius - n.radius);
@@ -4821,7 +4821,7 @@ function Dt(t, n, e = !1, s) {
     nt$2(u, f)
   ), h = Math.sqrt(
     t.radius * t.radius - f * f
-  ), p = tt$2(u), d = it$3(c, nt$2(p, h)), m = it$3(c, nt$2(p, -h)), x = [];
+  ), p = tt$3(u), d = it$3(c, nt$2(p, h)), m = it$3(c, nt$2(p, -h)), x = [];
   return t.isOnSegment(d) && n.isOnSegment(d) && x.push(d), t.isOnSegment(m) && n.isOnSegment(m) && x.push(m), x;
 }
 function st$2(t, n, e = 1e-9) {
@@ -4931,7 +4931,7 @@ const Pn$1 = (t) => {
   if (s.length === 2)
     return t.isSame(Pn$1(n)) ? [] : [e(s[0], s[1])];
   if (s.length === 3) {
-    const i = Y$1(s[0], n.lastPoint) || Y$1(s[0], n.firstPoint) ? 1 : 0;
+    const i = Y$2(s[0], n.lastPoint) || Y$2(s[0], n.firstPoint) ? 1 : 0;
     return [e(s[0 + i], s[1 + i])];
   } else if (s.length === 4)
     return [e(s[0], s[1]), e(s[2], s[3])];
@@ -4939,10 +4939,10 @@ const Pn$1 = (t) => {
 };
 function xn$1(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
-  return Y$1(t.center, n.center) && Math.abs(t.majorRadius - n.majorRadius) < s && Math.abs(t.minorRadius - n.minorRadius) < s && (Math.abs(t.tiltAngle - n.tiltAngle) < s || Math.abs(Math.abs(t.tiltAngle - n.tiltAngle) - Math.PI) < s) ? e ? wn$1(t, n) : [] : Rt(t, n).filter((l) => t.isOnSegment(l) && n.isOnSegment(l));
+  return Y$2(t.center, n.center) && Math.abs(t.majorRadius - n.majorRadius) < s && Math.abs(t.minorRadius - n.minorRadius) < s && (Math.abs(t.tiltAngle - n.tiltAngle) < s || Math.abs(Math.abs(t.tiltAngle - n.tiltAngle) - Math.PI) < s) ? e ? wn$1(t, n) : [] : Rt(t, n).filter((l) => t.isOnSegment(l) && n.isOnSegment(l));
 }
 function Pt$1(t, n) {
-  const [e, s] = t.firstPoint, [i, o] = t.lastPoint, l = new et$3().translate(-e, -s).rotate(-Math.atan2(o - s, i - e)), r = l.clone().inverse(), u = n.transform(l);
+  const [e, s] = t.firstPoint, [i, o] = t.lastPoint, l = new et$4().translate(-e, -s).rotate(-Math.atan2(o - s, i - e)), r = l.clone().inverse(), u = n.transform(l);
   return u.paramsAtY(0).map((a) => u.paramPoint(a)).map((a) => r.transform(a)).filter((a) => t.isOnSegment(a));
 }
 const Sn$1 = (t, n = 1e-9) => {
@@ -4974,7 +4974,7 @@ function E(t, { firstPoint: n, lastPoint: e }, s = 1e-9) {
   const i = Q$2(e, n);
   return Math.abs(i[0]) < s ? i[1] > 0 ? n[0] - t[0] : t[0] - n[0] : Math.abs(i[1]) < s ? i[0] > 0 ? t[1] - n[1] : n[1] - t[1] : St$2(i, Q$2(t, n)) / an$1(i);
 }
-let ct$1 = class ct {
+let ct$2 = class ct {
   constructor(n, e, s, i) {
     this.firstPoint = n, this.lastPoint = e, this.negativeThickness = s, this.positiveThickness = i;
   }
@@ -4985,7 +4985,7 @@ let ct$1 = class ct {
 const Cn$1 = 3 / 4, Mn$1 = 4 / 9;
 function In$1(t) {
   const n = E(t.firstControlPoint, t), e = E(t.lastControlPoint, t), s = n * e > 0 ? Cn$1 : Mn$1;
-  return new ct$1(
+  return new ct$2(
     t.firstPoint,
     t.lastPoint,
     s * Math.min(0, n, e),
@@ -4994,7 +4994,7 @@ function In$1(t) {
 }
 function An$1(t) {
   const n = E(t.controlPoint, t);
-  return new ct$1(
+  return new ct$2(
     t.firstPoint,
     t.lastPoint,
     Math.min(0, n / 2),
@@ -5009,7 +5009,7 @@ function En(t) {
   throw new Error("Not implemented");
 }
 function Fn(t) {
-  const n = t.paramPoint(0.5), e = tt$2(Q$2(n, t.firstPoint)), s = it$3(n, e), i = {
+  const n = t.paramPoint(0.5), e = tt$3(Q$2(n, t.firstPoint)), s = it$3(n, e), i = {
     firstPoint: n,
     lastPoint: s
   }, o = [
@@ -5019,7 +5019,7 @@ function Fn(t) {
   return t instanceof Et$1 ? o.push(
     E(t.firstControlPoint, i),
     E(t.lastControlPoint, i)
-  ) : t instanceof _t$1 && o.push(E(t.controlPoint, i)), new ct$1(
+  ) : t instanceof _t$1 && o.push(E(t.controlPoint, i)), new ct$2(
     n,
     s,
     Math.min(...o),
@@ -5044,7 +5044,7 @@ function St$1(t, n) {
   }
   return e;
 }
-class Y {
+let Y$1 = class Y {
   constructor(n, e) {
     this.from = n, this.to = e;
   }
@@ -5054,7 +5054,7 @@ class Y {
   clipCurve(n) {
     return this.from === "start" ? this.to === "end" ? n : n.splitAtParameters([this.to])[0] : this.to === "end" ? n.splitAtParameters([this.from])[1] : n.splitAtParameters([this.from, this.to])[1];
   }
-}
+};
 function vn(t, n) {
   if (t instanceof Et$1)
     return new kn([
@@ -5117,15 +5117,15 @@ function yt$1(t, n) {
     t.positiveThickness
   ), o = e.endDistance >= t.negativeThickness && e.endDistance <= t.positiveThickness;
   if (!s.length && !i.length)
-    return o ? new Y("start", "end") : null;
+    return o ? new Y$1("start", "end") : null;
   if (s.length === 1 && i.length === 1)
-    return new Y(s[0], i[0]);
+    return new Y$1(s[0], i[0]);
   if (s.length === 2 && i.length === 2)
     throw new Error(
       "Bug in the clipping algorithm, unexpected number of crossing points"
     );
   const l = s.length ? s : i;
-  return l.length === 2 ? new Y(l[0], l[1]) : o ? new Y(l[0], "end") : new Y("start", l[0]);
+  return l.length === 2 ? new Y$1(l[0], l[1]) : o ? new Y$1(l[0], "end") : new Y$1("start", l[0]);
 }
 function bt$1(t, n) {
   const e = En(t), s = yt$1(e, n);
@@ -5137,23 +5137,23 @@ function bt$1(t, n) {
   );
   return o ? s.size > o.size ? o.clipCurve(n) : s.clipCurve(n) : null;
 }
-const W$2 = (t) => t instanceof _t$1 ? It$2(Q$2(t.controlPoint, t.firstPoint)) + It$2(Q$2(t.controlPoint, t.lastPoint)) : It$2(Q$2(t.firstControlPoint, t.firstPoint)) + It$2(Q$2(t.lastControlPoint, t.firstControlPoint)) + It$2(Q$2(t.lastControlPoint, t.lastPoint));
+const W$3 = (t) => t instanceof _t$1 ? It$2(Q$2(t.controlPoint, t.firstPoint)) + It$2(Q$2(t.controlPoint, t.lastPoint)) : It$2(Q$2(t.firstControlPoint, t.firstPoint)) + It$2(Q$2(t.lastControlPoint, t.firstControlPoint)) + It$2(Q$2(t.lastControlPoint, t.lastPoint));
 function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
   const i = Math.max(e * e, Number.EPSILON * 10);
-  let o = t, l = n, r = W$2(o), u = W$2(l);
+  let o = t, l = n, r = W$3(o), u = W$3(l);
   for (let a = 0; a < s; a++) {
     const f = r > i ? bt$1(l, o) : o;
     if (!f) return [];
-    const c = W$2(f), h = u > i ? bt$1(f, l) : l;
+    const c = W$3(f), h = u > i ? bt$1(f, l) : l;
     if (!h) return [];
-    const p = W$2(h);
+    const p = W$3(h);
     if (c <= i && p <= i)
       return [
         f.boundingBox.intersection(h.boundingBox).center
       ];
-    if (Y$1(f.firstPoint, f.lastPoint) && h.isOnSegment(f.firstPoint))
+    if (Y$2(f.firstPoint, f.lastPoint) && h.isOnSegment(f.firstPoint))
       return [f.firstPoint];
-    if (Y$1(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
+    if (Y$2(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
       return [h.firstPoint];
     if (c > 0.8 * r && p > 0.8 * u)
       if (c / r > p / u) {
@@ -5205,7 +5205,7 @@ function On$1(t, n) {
   if (e.length === 2)
     return [t.splitAt(e)[1]];
   if (e.length === 3)
-    return Y$1(e[0], t.firstPoint) && Y$1(e[1], t.lastPoint) ? [t] : [n];
+    return Y$2(e[0], t.firstPoint) && Y$2(e[1], t.lastPoint) ? [t] : [n];
   if (e.length === 4)
     return [t];
 }
@@ -5232,7 +5232,7 @@ function Tn$1(t, n) {
   if (e.length === 2)
     return [t.splitAt(e)[1]];
   if (e.length === 3)
-    return Y$1(e[0], t.firstPoint) && Y$1(e[1], t.lastPoint) ? [t] : [n];
+    return Y$2(e[0], t.firstPoint) && Y$2(e[1], t.lastPoint) ? [t] : [n];
   if (e.length === 4)
     return [t];
 }
@@ -5246,7 +5246,7 @@ function Ln(t, n, e = !1) {
   return D(t, n, s);
 }
 function de(t, n, e) {
-  if (t instanceof at$2 && n instanceof at$2) {
+  if (t instanceof at$3 && n instanceof at$3) {
     const s = cn$1(
       t,
       n,
@@ -5255,42 +5255,42 @@ function de(t, n, e) {
     );
     return s === null ? [] : [s];
   }
-  if (t instanceof at$2 && n instanceof ct$2)
-    return K$1(t, n, e);
-  if (t instanceof ct$2 && n instanceof at$2)
-    return K$1(n, t, e);
-  if (t instanceof ct$2 && n instanceof ct$2)
+  if (t instanceof at$3 && n instanceof ct$3)
+    return K$2(t, n, e);
+  if (t instanceof ct$3 && n instanceof at$3)
+    return K$2(n, t, e);
+  if (t instanceof ct$3 && n instanceof ct$3)
     return Dt(t, n, !1, e);
   throw new Error("Not implemented");
 }
 function Z(t, n, e) {
-  if (t instanceof at$2 && n instanceof at$2) {
+  if (t instanceof at$3 && n instanceof at$3) {
     const s = cn$1(
       t,
       n,
       !0,
       e
     );
-    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof at$2 ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
+    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof at$3 ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
   }
   if (!t.boundingBox.overlaps(n.boundingBox))
     return { intersections: [], overlaps: [], count: 0 };
-  if (t instanceof at$2 && n instanceof ct$2) {
-    const s = K$1(t, n, e);
+  if (t instanceof at$3 && n instanceof ct$3) {
+    const s = K$2(t, n, e);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof ct$2 && n instanceof at$2) {
-    const s = K$1(n, t, e);
+  if (t instanceof ct$3 && n instanceof at$3) {
+    const s = K$2(n, t, e);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof ct$2 && n instanceof ct$2) {
+  if (t instanceof ct$3 && n instanceof ct$3) {
     const s = Dt(
       t,
       n,
       !0,
       e
     );
-    return s.length ? s[0] instanceof ct$2 ? {
+    return s.length ? s[0] instanceof ct$3 ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -5300,7 +5300,7 @@ function Z(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof at$2 && n instanceof jt$1) {
+  if (t instanceof at$3 && n instanceof jt$1) {
     const s = st$2(
       t,
       n,
@@ -5308,7 +5308,7 @@ function Z(t, n, e) {
     );
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof at$2 && t instanceof jt$1) {
+  if (n instanceof at$3 && t instanceof jt$1) {
     const s = st$2(
       n,
       t,
@@ -5316,11 +5316,11 @@ function Z(t, n, e) {
     );
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof ct$2 && n instanceof jt$1) {
+  if (t instanceof ct$3 && n instanceof jt$1) {
     const s = gt(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof ct$2 && t instanceof jt$1) {
+  if (n instanceof ct$3 && t instanceof jt$1) {
     const s = gt(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
@@ -5340,27 +5340,27 @@ function Z(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof at$2 && (n instanceof Et$1 || n instanceof _t$1)) {
+  if (t instanceof at$3 && (n instanceof Et$1 || n instanceof _t$1)) {
     const s = Pt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof at$2 && (t instanceof Et$1 || t instanceof _t$1)) {
+  if (n instanceof at$3 && (t instanceof Et$1 || t instanceof _t$1)) {
     const s = Pt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((t instanceof ct$2 || t instanceof jt$1) && n instanceof _t$1) {
+  if ((t instanceof ct$3 || t instanceof jt$1) && n instanceof _t$1) {
     const s = xt(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((n instanceof ct$2 || n instanceof jt$1) && t instanceof _t$1) {
+  if ((n instanceof ct$3 || n instanceof jt$1) && t instanceof _t$1) {
     const s = xt(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((t instanceof ct$2 || t instanceof jt$1) && n instanceof Et$1) {
+  if ((t instanceof ct$3 || t instanceof jt$1) && n instanceof Et$1) {
     const s = wt$1(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((n instanceof ct$2 || n instanceof jt$1) && t instanceof Et$1) {
+  if ((n instanceof ct$3 || n instanceof jt$1) && t instanceof Et$1) {
     const s = wt$1(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
@@ -5469,22 +5469,22 @@ function qn(t, n = "Stroke") {
       if (l.count !== 0) {
         if (l.count === 1 && !l.overlaps.length) {
           const u = e - s, a = l.intersections[0];
-          if (u === 1 && Y$1(i.firstPoint, a, r) || u === -1 && Y$1(i.lastPoint, a, r) || u === t.length - 1 && Y$1(i.lastPoint, a, r) && Y$1(o.firstPoint, a, r) || -u === t.length - 1 && Y$1(i.firstPoint, a, r) && Y$1(o.lastPoint, a, r))
+          if (u === 1 && Y$2(i.firstPoint, a, r) || u === -1 && Y$2(i.lastPoint, a, r) || u === t.length - 1 && Y$2(i.lastPoint, a, r) && Y$2(o.firstPoint, a, r) || -u === t.length - 1 && Y$2(i.firstPoint, a, r) && Y$2(o.lastPoint, a, r))
             return;
         }
-        if (!(l.count === 2 && t.length === 2 && (Y$1(
+        if (!(l.count === 2 && t.length === 2 && (Y$2(
           i.firstPoint,
           l.intersections[0],
           r
-        ) && Y$1(
+        ) && Y$2(
           i.lastPoint,
           l.intersections[1],
           r
-        ) || Y$1(
+        ) || Y$2(
           i.firstPoint,
           l.intersections[1],
           r
-        ) && Y$1(
+        ) && Y$2(
           i.lastPoint,
           l.intersections[0],
           r
@@ -5503,7 +5503,7 @@ function jt(t, n = "Stroke") {
     throw new Error(`${n} must have at least one segment`);
   Kt([t.slice(0, -1), t.slice(1)]).forEach(
     ([e, s]) => {
-      if (!Y$1(e.lastPoint, s.firstPoint))
+      if (!Y$2(e.lastPoint, s.firstPoint))
         throw new Error(
           `${n} segments must be connected, but ${e.info} and ${s.info} are not`
         );
@@ -5511,13 +5511,13 @@ function jt(t, n = "Stroke") {
   ), qn(t, n);
 }
 function Ct$1(t, n) {
-  return !!(t instanceof at$2 && n instanceof at$2 && Ie(t.V, n.V) || t instanceof ct$2 && n instanceof ct$2 && Y$1(t.center, n.center) && t.radius - n.radius < t.precision);
+  return !!(t instanceof at$3 && n instanceof at$3 && Ie(t.V, n.V) || t instanceof ct$3 && n instanceof ct$3 && Y$2(t.center, n.center) && t.radius - n.radius < t.precision);
 }
 function Mt$1(t, n) {
-  if (t instanceof at$2 && n instanceof at$2)
-    return new at$2(t.firstPoint, n.lastPoint);
-  if (t instanceof ct$2 && n instanceof ct$2)
-    return new ct$2(
+  if (t instanceof at$3 && n instanceof at$3)
+    return new at$3(t.firstPoint, n.lastPoint);
+  if (t instanceof ct$3 && n instanceof ct$3)
+    return new ct$3(
       t.firstPoint,
       n.lastPoint,
       t.center,
@@ -5536,7 +5536,7 @@ function Ht(t) {
     const i = e[e.length - 1];
     Ct$1(i, s) ? (n = !0, e.pop(), e.push(Mt$1(i, s))) : e.push(s);
   }
-  if (Y$1(t.firstPoint, t.lastPoint) && Ct$1(
+  if (Y$2(t.firstPoint, t.lastPoint) && Ct$1(
     e[0],
     e[e.length - 1]
   )) {
@@ -5546,7 +5546,7 @@ function Ht(t) {
   }
   return n ? e : null;
 }
-let B$2 = class B extends Ut {
+let B$3 = class B extends Ut {
   constructor() {
     super(...arguments);
     C(this, "strokeType", "STRAND");
@@ -5562,7 +5562,7 @@ let B$2 = class B extends Ut {
     );
   }
   extend(e) {
-    if (!Y$1(this.lastPoint, e.firstPoint))
+    if (!Y$2(this.lastPoint, e.firstPoint))
       throw console.error(this.repr, e.repr), new Error("Cannot extend strand: connection point is not the same");
     return new B([...this.segments, ...e.segments]);
   }
@@ -5593,14 +5593,14 @@ const zn$1 = (t, n) => {
   }
   return 1;
 };
-let at$1 = class at {
+let at$2 = class at {
   constructor(n) {
     C(this, "_count", 0);
     C(this, "segment");
     this.segment = n;
   }
   update(n, e = !1) {
-    !e && !this.segment.isOnSegment(n) || (Y$1(n, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : Y$1(n, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
+    !e && !this.segment.isOnSegment(n) || (Y$2(n, this.segment.firstPoint) ? this._count += this.segment.tangentAtFirstPoint[1] > 0 ? 1 : 0 : Y$2(n, this.segment.lastPoint) ? this._count += this.segment.tangentAtLastPoint[1] > 0 ? 0 : 1 : this._count += 1);
   }
   get count() {
     return this._count;
@@ -5616,15 +5616,15 @@ const Dn$1 = (t, n) => {
   if (r && n.center[0] < t[0]) return 0;
   const u = Math.sqrt(
     n.radius * n.radius - s * s
-  ), a = new at$1(n);
+  ), a = new at$2(n);
   return a.update([n.center[0] + u, t[1]]), r && a.update([n.center[0] - u, t[1]]), a.count;
 }, Rn$1 = (t, n) => {
-  const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new at$2(t, [e, t[1]]), i = new at$1(n);
+  const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new at$3(t, [e, t[1]]), i = new at$2(n);
   return st$2(s, n).forEach((o) => {
     i.update(o, !0);
   }), i.count;
 }, Vn = (t, n) => {
-  const e = new at$1(n);
+  const e = new at$2(n);
   return n.paramsAtY(t[1]).map((s) => {
     try {
       return n.paramPoint(s);
@@ -5639,9 +5639,9 @@ const Dn$1 = (t, n) => {
   }), e.count;
 };
 function Nn(t, n) {
-  if (n instanceof at$2)
+  if (n instanceof at$3)
     return zn$1(t, n);
-  if (n instanceof ct$2)
+  if (n instanceof ct$3)
     return Dn$1(t, n);
   if (n instanceof jt$1)
     return Rn$1(t, n);
@@ -5658,7 +5658,7 @@ let _$2 = class _ extends Ut {
   }
   get clockwise() {
     if (this._clockwise === null) {
-      const e = this.segments.flatMap((i) => i instanceof at$2 ? [i.firstPoint] : [i.firstPoint, i.paramPoint(0.5)]), s = e.map((i, o) => {
+      const e = this.segments.flatMap((i) => i instanceof at$3 ? [i.firstPoint] : [i.firstPoint, i.paramPoint(0.5)]), s = e.map((i, o) => {
         const l = e[(o + 1) % e.length];
         return (l[0] - i[0]) * (l[1] + i[1]);
       }).reduce((i, o) => i + o, 0);
@@ -5691,12 +5691,12 @@ let _$2 = class _ extends Ut {
   }
 };
 function Un(t) {
-  if (jt(t, "Loop"), !Y$1(t[0].firstPoint, t[t.length - 1].lastPoint))
+  if (jt(t, "Loop"), !Y$2(t[0].firstPoint, t[t.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
 const jn = [
-  at$2,
-  ct$2,
+  at$3,
+  ct$3,
   jt$1,
   _t$1,
   Et$1
@@ -5705,13 +5705,13 @@ function Hn(t) {
   return jn.some((n) => t instanceof n);
 }
 function $t(t) {
-  if (t instanceof at$2)
+  if (t instanceof at$3)
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
       lastPoint: t.lastPoint
     };
-  if (t instanceof ct$2)
+  if (t instanceof ct$3)
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -5747,7 +5747,7 @@ function $t(t) {
     };
   throw new Error("Unknown segment type");
 }
-function ot$2(t) {
+function ot$3(t) {
   return {
     type: "LOOP",
     segments: t.segments.map($t)
@@ -5756,8 +5756,8 @@ function ot$2(t) {
 function Yt(t) {
   return {
     type: "FIGURE",
-    contour: ot$2(t.contour),
-    holes: t.holes.map(ot$2)
+    contour: ot$3(t.contour),
+    holes: t.holes.map(ot$3)
   };
 }
 function $n$1(t) {
@@ -5767,12 +5767,12 @@ function $n$1(t) {
   };
 }
 function It$1(t) {
-  if (t instanceof O$1)
+  if (t instanceof O$2)
     return $n$1(t);
-  if (t instanceof v$1)
+  if (t instanceof v$2)
     return Yt(t);
   if (t instanceof _$2)
-    return ot$2(t);
+    return ot$3(t);
   if (Hn(t))
     return $t(t);
   throw new Error("Unknown shape type");
@@ -5823,7 +5823,7 @@ class Yn {
     this.ids.length = this.values.length = this.length;
   }
 }
-const At$1 = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], et$2 = 3;
+const At$1 = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], et$3 = 3;
 let ft$1 = class ft {
   /**
    * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
@@ -5840,8 +5840,8 @@ let ft$1 = class ft {
     if (s !== 251)
       throw new Error("Data does not appear to be in a Flatbush format.");
     const o = i >> 4;
-    if (o !== et$2)
-      throw new Error(`Got v${o} data when expected v${et$2}.`);
+    if (o !== et$3)
+      throw new Error(`Got v${o} data when expected v${et$3}.`);
     const l = At$1[i & 15];
     if (!l)
       throw new Error("Unrecognized array type.");
@@ -5870,7 +5870,7 @@ let ft$1 = class ft {
     const a = At$1.indexOf(this.ArrayType), f = u * 4 * this.ArrayType.BYTES_PER_ELEMENT;
     if (a < 0)
       throw new Error(`Unexpected typed array class: ${s}.`);
-    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, l + 8, u * 4), this._indices = new this.IndexArrayType(this.data, l + 8 + f, u), this._pos = u * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + f + u * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, u * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, u), this._pos = 0, this.minX = 1 / 0, this.minY = 1 / 0, this.maxX = -1 / 0, this.maxY = -1 / 0, new Uint8Array(this.data, 0, 2).set([251, (et$2 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new Yn();
+    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, l + 8, u * 4), this._indices = new this.IndexArrayType(this.data, l + 8 + f, u), this._pos = u * 4, this.minX = this._boxes[this._pos - 4], this.minY = this._boxes[this._pos - 3], this.maxX = this._boxes[this._pos - 2], this.maxY = this._boxes[this._pos - 1]) : (this.data = new i(8 + f + u * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, u * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, u), this._pos = 0, this.minX = 1 / 0, this.minY = 1 / 0, this.maxX = -1 / 0, this.maxY = -1 / 0, new Uint8Array(this.data, 0, 2).set([251, (et$3 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new Yn();
   }
   /**
    * Add a given rectangle to the index.
@@ -5898,7 +5898,7 @@ let ft$1 = class ft {
       const u = n[r++], a = n[r++], f = n[r++], c = n[r++], h = Math.floor(o * ((u + f) / 2 - this.minX) / e), p = Math.floor(o * ((a + c) / 2 - this.minY) / s);
       i[l] = Gn(h, p);
     }
-    rt$2(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
+    rt$3(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
     for (let l = 0, r = 0; l < this._levelBounds.length - 1; l++) {
       const u = this._levelBounds[l];
       for (; r < u; ) {
@@ -5973,7 +5973,7 @@ function Ft(t, n) {
   }
   return n[e];
 }
-function rt$2(t, n, e, s, i, o) {
+function rt$3(t, n, e, s, i, o) {
   if (Math.floor(s / o) >= Math.floor(i / o)) return;
   const l = t[s + i >> 1];
   let r = s - 1, u = i + 1;
@@ -5987,7 +5987,7 @@ function rt$2(t, n, e, s, i, o) {
     if (r >= u) break;
     Xn(t, n, e, r, u);
   }
-  rt$2(t, n, e, s, u, o), rt$2(t, n, e, u + 1, i, o);
+  rt$3(t, n, e, s, u, o), rt$3(t, n, e, u + 1, i, o);
 }
 function Xn(t, n, e, s, i) {
   const o = t[s];
@@ -6040,7 +6040,7 @@ function Xt(t, n = 1e-7) {
     }
   }), s;
 }
-let v$1 = class v extends Ze {
+let v$2 = class v extends Ze {
   constructor(e, s = [], { ignoreChecks: i = !1 } = {}) {
     super();
     C(this, "contour");
@@ -6078,7 +6078,7 @@ let v$1 = class v extends Ze {
   }
   overlappingStrands(e) {
     const s = e instanceof v ? e.allLoops : [e], i = this.allLoops.flatMap((o) => s.flatMap((l) => o.overlappingSegments(l)));
-    return Xt(i).map((o) => new B$2(o));
+    return Xt(i).map((o) => new B$3(o));
   }
 };
 function Qn(t, n = []) {
@@ -6094,9 +6094,9 @@ function Qn(t, n = []) {
     if (e.contains(s.firstPoint))
       throw console.error(It$1(e), It$1(s)), new Error("Holes must not be inside other holes");
 }
-const J$1 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
+const J$2 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
   const e = t.boundingBox, s = n.boundingBox;
-  return J$1(e.xMin, s.xMin) && J$1(e.yMin, s.yMin) && J$1(e.xMax, s.xMax) && J$1(e.yMax, s.yMax);
+  return J$2(e.xMin, s.xMin) && J$2(e.yMin, s.yMin) && J$2(e.xMax, s.xMax) && J$2(e.yMax, s.yMax);
 }, Jn = (t, n) => {
   if (t.segmentsCount !== n.segmentsCount || !Wn(t, n)) return !1;
   const e = t.segments, s = n.segments, i = e.length, o = (l, r) => {
@@ -6129,27 +6129,27 @@ const J$1 = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
     loop: n,
     isIn: o
   };
-}), te = (t, n) => t.flatMap(({ loop: e }) => ht(
+}), te = (t, n) => t.flatMap(({ loop: e }) => ht$1(
   n.filter(
     ({ loop: s, isIn: i }) => s === e || i.indexOf(e) !== -1
   )
 )), ne = (t, n) => {
-  const e = n.filter(({ isIn: i }) => i.length <= 1), s = ht(
+  const e = n.filter(({ isIn: i }) => i.length <= 1), s = ht$1(
     Gt(t.map(({ loop: i }) => i))
   );
   return [e, ...s];
-}, ht = (t) => {
+}, ht$1 = (t) => {
   if (!t.length) return [];
   const n = t.filter(({ isIn: s }) => !s.length), e = t.filter(({ isIn: s }) => s.length > 1);
   return n.length === 1 && e.length === 0 ? [t] : n.length > 1 ? te(n, t) : ne(e, t);
 };
-function X$1(t) {
+function X$2(t) {
   const n = Kn(t);
-  return Zn(n).map(Gt).flatMap(ht).map((s) => {
-    if (s.length === 1) return new v$1(s[0].loop);
+  return Zn(n).map(Gt).flatMap(ht$1).map((s) => {
+    if (s.length === 1) return new v$2(s[0].loop);
     s.sort((l, r) => l.isIn.length - r.isIn.length);
     const [i, ...o] = s.map(({ loop: l }) => l);
-    return new v$1(i, o);
+    return new v$2(i, o);
   });
 }
 function ee(t, n) {
@@ -6160,18 +6160,18 @@ function ee(t, n) {
   return e;
 }
 function* vt$1(t, n, e) {
-  const s = (r) => n.some((u) => Y$1(u, r.lastPoint)), i = (r, u) => r.segmentType !== u.segmentType || !u.isOnSegment(r.firstPoint) || !u.isOnSegment(r.lastPoint) ? !1 : r.segmentType !== "LINE" ? u.isOnSegment(r.midPoint) : !0, o = (r) => e.some((u) => r.isSame(u) || i(r, u));
+  const s = (r) => n.some((u) => Y$2(u, r.lastPoint)), i = (r, u) => r.segmentType !== u.segmentType || !u.isOnSegment(r.firstPoint) || !u.isOnSegment(r.lastPoint) ? !1 : r.segmentType !== "LINE" ? u.isOnSegment(r.midPoint) : !0, o = (r) => e.some((u) => r.isSame(u) || i(r, u));
   let l = [];
   for (const r of t)
-    s(r) ? (l.push(r), yield new B$2(l, { ignoreChecks: !0 }), l = []) : o(r) ? (l.length && (yield new B$2(l, { ignoreChecks: !0 }), l = []), yield new B$2([r], { ignoreChecks: !0 })) : l.push(r);
-  l.length && (yield new B$2(l, { ignoreChecks: !0 }));
+    s(r) ? (l.push(r), yield new B$3(l, { ignoreChecks: !0 }), l = []) : o(r) ? (l.length && (yield new B$3(l, { ignoreChecks: !0 }), l = []), yield new B$3([r], { ignoreChecks: !0 })) : l.push(r);
+  l.length && (yield new B$3(l, { ignoreChecks: !0 }));
 }
 const Bt = (t, n) => {
-  const e = t.findIndex((o) => Y$1(n, o.firstPoint)), s = t.slice(0, e);
+  const e = t.findIndex((o) => Y$2(n, o.firstPoint)), s = t.slice(0, e);
   return t.slice(e).concat(s);
 }, kt = (t, n) => {
   let e = t;
-  const s = (r) => Y$1(r.firstPoint, n.firstPoint) && Y$1(r.lastPoint, n.lastPoint);
+  const s = (r) => Y$2(r.firstPoint, n.firstPoint) && Y$2(r.lastPoint, n.lastPoint);
   let i = t.findIndex(s);
   if (i === -1) {
     const r = t.map((u) => u.reverse());
@@ -6187,7 +6187,7 @@ const Bt = (t, n) => {
 };
 function se(t, n, e) {
   return t.filter((s) => {
-    const i = n.filter((r) => Y$1(r.firstPoint, s) || Y$1(r.lastPoint, s));
+    const i = n.filter((r) => Y$2(r.firstPoint, s) || Y$2(r.lastPoint, s));
     if (i.length % 2)
       throw new Error("Bug in the intersection algo on non crossing point");
     const o = i.map((r) => e.contains(r.midPoint));
@@ -6245,10 +6245,10 @@ function ie(t, n, e, s = !1) {
       o
     )
   );
-  return (!Y$1(
+  return (!Y$2(
     h[0].lastPoint,
     c[0].lastPoint
-  ) || o.length > 0 && h[0].segmentsCount !== 1) && (h = h.map((p) => p.reverse()).reverse(), Y$1(h[0].lastPoint, c[0].lastPoint) || (c = c.map((p) => p.reverse()).reverse())), Kt([c, h]).map(([p, d]) => {
+  ) || o.length > 0 && h[0].segmentsCount !== 1) && (h = h.map((p) => p.reverse()).reverse(), Y$2(h[0].lastPoint, c[0].lastPoint) || (c = c.map((p) => p.reverse()).reverse())), Kt([c, h]).map(([p, d]) => {
     if (s) {
       if (((x) => x.segments.every(
         (g) => o.some(
@@ -6265,7 +6265,7 @@ function Ot(t) {
   let n = t[0];
   for (const e of t.slice(1))
     n = n.extend(e);
-  if (!Y$1(n.firstPoint, n.lastPoint))
+  if (!Y$2(n.firstPoint, n.lastPoint))
     throw console.error(
       Z$1(n.firstPoint),
       Z$1(n.lastPoint)
@@ -6288,19 +6288,19 @@ function re(t) {
   let e = t.map((i) => i.lastPoint);
   e = e.slice(-1).concat(e.slice(0, -1));
   const s = Kt([n, e]).flatMap(
-    ([i, o], l) => Y$1(i, o) ? [] : l
+    ([i, o], l) => Y$2(i, o) ? [] : l
   );
   try {
     return oe(t, s);
   } catch {
-    return Xt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => Y$1(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new _$2(o));
+    return Xt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => Y$2(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new _$2(o));
   }
 }
 const _t = (t, n) => {
   if (t.length === 0) return [n];
   const e = t.at(-1);
-  return Y$1(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : Y$1(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
-}, le = (t, n) => t.length === 0 ? [n] : Y$1(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
+  return Y$2(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : Y$2(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
+}, le = (t, n) => t.length === 0 ? [n] : Y$2(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
 function pt(t, n, {
   firstInside: e,
   secondInside: s,
@@ -6354,7 +6354,7 @@ const ue = (t, n, e) => {
     ...e
   });
   return Array.isArray(s) ? s : s.identical ? [t] : s.firstCurveInSecond ? [n] : s.secondCurveInFirst ? [t] : [t, n];
-}, tt$1 = (t, n, e) => {
+}, tt$2 = (t, n, e) => {
   const s = pt(t, n, {
     firstInside: "remove",
     secondInside: "keep",
@@ -6395,10 +6395,10 @@ function ce(t) {
   }), e.flatMap(({ current: s }) => s);
 }
 function Qt(t, n) {
-  const e = ue(t.contour, n.contour), s = n.holes.flatMap((l) => tt$1(l, t.contour)), i = t.holes.flatMap((l) => tt$1(l, n.contour)), o = ee(t.holes, n.holes).flatMap(
+  const e = ue(t.contour, n.contour), s = n.holes.flatMap((l) => tt$2(l, t.contour)), i = t.holes.flatMap((l) => tt$2(l, n.contour)), o = ee(t.holes, n.holes).flatMap(
     ([l, r]) => dt(l, r)
   );
-  return X$1([
+  return X$2([
     ...e,
     ...s,
     ...i,
@@ -6407,39 +6407,39 @@ function Qt(t, n) {
 }
 function nt$1(t, n) {
   if (t.isFull && n.isFull)
-    return X$1(tt$1(t.contour, n.contour));
+    return X$2(tt$2(t.contour, n.contour));
   if (t.isFull) {
-    const s = tt$1(t.contour, n.contour), i = n.holes.flatMap(
+    const s = tt$2(t.contour, n.contour), i = n.holes.flatMap(
       (o) => dt(o, t.contour, { firstBoundaryInside: !0 })
     );
-    return X$1([...s, ...i]);
+    return X$2([...s, ...i]);
   } else if (n.isFull && !t.contour.intersects(n.contour))
     if (t.contour.contains(n.contour.firstPoint)) {
       const s = G(
-        t.holes.map((i) => new v$1(i)),
+        t.holes.map((i) => new v$2(i)),
         [n]
       );
-      return X$1([
+      return X$2([
         t.contour,
         ...s.flatMap((i) => i.allLoops)
       ]);
     } else
       return [t];
-  let e = nt$1(new v$1(t.contour), n);
+  let e = nt$1(new v$2(t.contour), n);
   return t.holes.forEach((s) => {
-    e = e.flatMap((i) => nt$1(i, new v$1(s)));
+    e = e.flatMap((i) => nt$1(i, new v$2(s)));
   }), e;
 }
 function ae(t, n) {
   const e = dt(t.contour, n.contour);
   if (!e.length) return [];
-  let s = X$1(e);
+  let s = X$2(e);
   return s = Q$1(
     s,
-    t.holes.map((i) => new v$1(i))
+    t.holes.map((i) => new v$2(i))
   ), Q$1(
     s,
-    n.holes.map((i) => new v$1(i))
+    n.holes.map((i) => new v$2(i))
   );
 }
 function G(t, n) {
@@ -6467,10 +6467,10 @@ function Q$1(t, n) {
     e = Q$1(e, [s]);
   }), e;
 }
-function lt$1(t, n) {
-  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? ae(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => lt$1([e], n)) : n.flatMap((e) => lt$1(t, [e]));
+function lt$2(t, n) {
+  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? ae(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => lt$2([e], n)) : n.flatMap((e) => lt$2(t, [e]));
 }
-let O$1 = class O extends Ze {
+let O$2 = class O extends Ze {
   constructor(e = [], { ignoreChecks: s = !1 } = {}) {
     super();
     C(this, "figures");
@@ -6518,7 +6518,7 @@ let O$1 = class O extends Ze {
     return new O(Q$1(this.figures, e.figures));
   }
   intersect(e) {
-    return new O(lt$1(this.figures, e.figures));
+    return new O(lt$2(this.figures, e.figures));
   }
 };
 function fe(t) {
@@ -6527,10 +6527,10 @@ function fe(t) {
       throw new Error("Diagram figures must not intersect");
 }
 
-var W$1 = Object.defineProperty;
-var q$1 = (e, t, n) => t in e ? W$1(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
-var m = (e, t, n) => q$1(e, typeof t != "symbol" ? t + "" : t, n);
-const B$1 = (e, t, n) => {
+var W$2 = Object.defineProperty;
+var q$1 = (e, t, n) => t in e ? W$2(e, t, { enumerable: !0, configurable: !0, writable: !0, value: n }) : e[t] = n;
+var m$1 = (e, t, n) => q$1(e, typeof t != "symbol" ? t + "" : t, n);
+const B$2 = (e, t, n) => {
   const r = St$2(e.V, t.V), i = e.precision * t.precision;
   if (r * r < i)
     return "parallel";
@@ -6543,33 +6543,33 @@ class S {
   }
 }
 function y(e, t) {
-  if (e instanceof at$2)
-    return et$1(e, t);
-  if (e instanceof ct$2)
-    return rt$1(e, t);
+  if (e instanceof at$3)
+    return et$2(e, t);
+  if (e instanceof ct$3)
+    return rt$2(e, t);
   if (e instanceof _t$1 || e instanceof Et$1)
     return it$1(e, t);
   throw new Error("Not implemented");
 }
-function et$1(e, t) {
+function et$2(e, t) {
   const { firstPoint: n, lastPoint: r } = e, i = e.normalVector;
-  return new at$2(
+  return new at$3(
     it$3(n, nt$2(i, t)),
     it$3(r, nt$2(i, t))
   );
 }
-function rt$1(e, t) {
+function rt$2(e, t) {
   const n = it$3(
     e.firstPoint,
-    nt$2(tt$2(e.tangentAtFirstPoint), t)
+    nt$2(tt$3(e.tangentAtFirstPoint), t)
   ), r = it$3(
     e.lastPoint,
-    nt$2(tt$2(e.tangentAtLastPoint), t)
+    nt$2(tt$3(e.tangentAtLastPoint), t)
   ), i = t * (e.clockwise ? 1 : -1);
-  return e.radius + i < e.precision ? new S(n, r) : new ct$2(n, r, e.center, e.clockwise);
+  return e.radius + i < e.precision ? new S(n, r) : new ct$3(n, r, e.center, e.clockwise);
 }
 function b(e, t, n, r, i) {
-  const s = B$1(
+  const s = B$2(
     {
       V: n,
       firstPoint: r,
@@ -6588,7 +6588,7 @@ function b(e, t, n, r, i) {
   return s;
 }
 function it$1(e, t) {
-  const { firstPoint: n, lastPoint: r, normalAtFirstPoint: i, normalAtLastPoint: s } = e, o = B$1(
+  const { firstPoint: n, lastPoint: r, normalAtFirstPoint: i, normalAtLastPoint: s } = e, o = B$2(
     { V: i, firstPoint: n, precision: e.precision },
     { V: s, firstPoint: r, precision: e.precision }
   ), a = it$3(
@@ -6601,8 +6601,8 @@ function it$1(e, t) {
   if (o === "parallel")
     throw new Error("Parallel lines not expected in safe bezier offset");
   if (Pe(Q$2(o, n), i) * t > 0 && Math.min(
-    J$2(n, o),
-    J$2(r, o)
+    J$3(n, o),
+    J$3(r, o)
   ) < t)
     return new S(a, h);
   if (e instanceof _t$1) {
@@ -6686,7 +6686,7 @@ function _$1(e, t, n) {
       t.repr
     ), [e, t];
   const { first: i, second: s } = r;
-  return [i, new at$2(i.lastPoint, s.firstPoint), s];
+  return [i, new at$3(i.lastPoint, s.firstPoint), s];
 }
 const st$1 = (e) => {
   let t;
@@ -6702,15 +6702,15 @@ const st$1 = (e) => {
   let a;
   return typeof s == "number" ? a = Tt(1, s * fe$1) : a = s, { endTangent: o, startFactor: r, endFactor: i, startTangent: a };
 };
-function z$1(e, { ignoreChecks: t = !1 } = {}) {
-  return new O$1([new v$1(new _$2([...e], { ignoreChecks: t }))]);
+function z$2(e, { ignoreChecks: t = !1 } = {}) {
+  return new O$2([new v$2(new _$2([...e], { ignoreChecks: t }))]);
 }
-let ot$1 = class ot {
+let ot$2 = class ot {
   constructor(t = [0, 0]) {
-    m(this, "pointer");
-    m(this, "firstPoint");
-    m(this, "pendingSegments");
-    m(this, "_nextCorner");
+    m$1(this, "pointer");
+    m$1(this, "firstPoint");
+    m$1(this, "pendingSegments");
+    m$1(this, "_nextCorner");
     this.pointer = t, this.firstPoint = t, this.pendingSegments = [], this._nextCorner = null;
   }
   movePointerTo(t) {
@@ -6721,7 +6721,7 @@ let ot$1 = class ot {
     return this.pointer = t, this.firstPoint = t, this;
   }
   saveSegment(t) {
-    if (Y$1(t.firstPoint, t.lastPoint))
+    if (Y$2(t.firstPoint, t.lastPoint))
       throw new Error(`Segment has no length, ${t.repr}`);
     if (!this._nextCorner)
       return this.pendingSegments.push(t), this;
@@ -6733,7 +6733,7 @@ let ot$1 = class ot {
     ), this._nextCorner = null, this;
   }
   lineTo(t) {
-    const n = new at$2(this.pointer, t);
+    const n = new at$3(this.pointer, t);
     return this.pointer = t, this.saveSegment(n);
   }
   line(t, n) {
@@ -6778,7 +6778,7 @@ let ot$1 = class ot {
   }
   sagittaArcTo(t, n) {
     if (!n) return this.lineTo(t);
-    const r = new at$2(this.pointer, t), i = tt$2(r.tangentAtFirstPoint), s = it$3(r.midPoint, nt$2(i, n));
+    const r = new at$3(this.pointer, t), i = tt$3(r.tangentAtFirstPoint), s = it$3(r.midPoint, nt$2(i, n));
     return this.threePointsArcTo(t, s);
   }
   sagittaArc(t, n, r) {
@@ -6795,7 +6795,7 @@ let ot$1 = class ot {
   }
   bulgeArcTo(t, n) {
     if (!n) return this.lineTo(t);
-    const r = J$2(this.pointer, t) / 2, i = -n * r;
+    const r = J$3(this.pointer, t) / 2, i = -n * r;
     return this.sagittaArcTo(t, i);
   }
   bulgeArc(t, n, r) {
@@ -6867,7 +6867,7 @@ let ot$1 = class ot {
     return this.saveSegment(new _t$1(this.pointer, t, n)), this.pointer = t, this;
   }
   smoothCurveTo(t, n) {
-    const { endTangent: r, startTangent: i, startFactor: s, endFactor: o } = st$1(n), a = this.pendingSegments.length ? this.pendingSegments[this.pendingSegments.length - 1] : null, h = J$2(this.pointer, t) / 3;
+    const { endTangent: r, startTangent: i, startFactor: s, endFactor: o } = st$1(n), a = this.pendingSegments.length ? this.pendingSegments[this.pendingSegments.length - 1] : null, h = J$3(this.pointer, t) / 3;
     let c;
     i ? c = i : a ? c = a.tangentAtLastPoint : c = [1, 0], c = H$1(c);
     const p = [
@@ -6904,66 +6904,425 @@ let ot$1 = class ot {
   close(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
     const n = this.pendingSegments[0], r = this.pendingSegments.at(-1);
-    return Y$1(n.firstPoint, r.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
+    return Y$2(n.firstPoint, r.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
       this._nextCorner.radius,
       this._nextCorner.mode
-    ), this._nextCorner = null), z$1(this.pendingSegments, { ignoreChecks: t });
+    ), this._nextCorner = null), z$2(this.pendingSegments, { ignoreChecks: t });
   }
   closeWithMirror(t = !1) {
     if (!this.pendingSegments.length) throw new Error("No segments to close");
     const n = this.pendingSegments[0], r = this.pendingSegments.at(-1), i = Q$2(
       r.lastPoint,
       n.firstPoint
-    ), s = new et$3().mirrorLine(
+    ), s = new et$4().mirrorLine(
       i,
       n.firstPoint
     ), o = this.pendingSegments.map(
       (a) => a.transform(s).reverse()
     );
-    return o.reverse(), z$1(
+    return o.reverse(), z$2(
       [...this.pendingSegments, ...o],
       { ignoreChecks: t }
     );
   }
   asStrand() {
-    return new B$2([...this.pendingSegments]);
+    return new B$3([...this.pendingSegments]);
   }
   get isClosed() {
     var t;
-    return Y$1(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
+    return Y$2(this.pointer, (t = this.pendingSegments[0]) == null ? void 0 : t.firstPoint);
   }
 };
-function lt(e = [0, 0]) {
-  return new ot$1(e);
+function lt$1(e = [0, 0]) {
+  return new ot$2(e);
 }
 
-function R$1(e) {
-  return lt([-e, 0]).sagittaArc(2 * e, 0, e).sagittaArc(-2 * e, 0, e).close();
-}
-function x$1(e, a, f = 0) {
-  const { rx: m = 0, ry: p = 0 } = typeof f == "number" ? { ry: f, rx: f } : f;
-  let n = Math.min(m ?? f ?? 0, e / 2), t = Math.min(p ?? f ?? 0, a / 2);
-  const r = n && t;
-  r || (n = 0, t = 0);
-  const u = n === t, c = lt([Math.min(0, -(e / 2 - n)), -a / 2]), o = (i, l) => {
-    r && (u ? c.tangentArc(i, l) : c.ellipse(i, l, n, t, 0, !1, !1));
+function ct$1(c) {
+  return lt$1([-c, 0]).sagittaArc(2 * c, 0, c).sagittaArc(-2 * c, 0, c).close();
+}
+function ot$1(c, e, t = 0) {
+  const { rx: a = 0, ry: o = 0 } = typeof t == "number" ? { ry: t, rx: t } : t;
+  let n = Math.min(a ?? t ?? 0, c / 2), r = Math.min(o ?? t ?? 0, e / 2);
+  const s = n && r;
+  s || (n = 0, r = 0);
+  const h = n === r, f = lt$1([Math.min(0, -(c / 2 - n)), -e / 2]), l = (k, i) => {
+    s && (h ? f.tangentArc(k, i) : f.ellipse(k, i, n, r, 0, !1, !1));
   };
-  return n < e / 2 && c.hLine(e - 2 * n), o(n, t), t < a / 2 && c.vLine(a - 2 * t), o(-n, t), n < e / 2 && c.hLine(-(e - 2 * n)), o(-n, -t), t < a / 2 && c.vLine(-(a - 2 * t)), o(n, -t), c.close();
+  return n < c / 2 && f.hLine(c - 2 * n), l(n, r), r < e / 2 && f.vLine(e - 2 * r), l(-n, r), n < c / 2 && f.hLine(-(c - 2 * n)), l(-n, -r), r < e / 2 && f.vLine(-(e - 2 * r)), l(n, -r), f.close();
+}
+function rt$1(c, e) {
+  const t = lt$1([-c, 0]);
+  return t.halfEllipse(2 * c, 0, e), t.halfEllipse(-2 * c, 0, e), t.close();
+}
+function lt(c, e, t) {
+  const a = Je(e).map((n) => {
+    const r = -(Math.PI * 2 / e) * n;
+    return [c * Math.sin(r), c * Math.cos(r)];
+  });
+  let o = lt$1(a[a.length - 1]);
+  for (const n of a)
+    t ? o = o.sagittaArcTo(n, t) : o = o.lineTo(n);
+  return o.close();
+}
+const N = 0, $ = 1, B$1 = 2, m = { A: 7, a: 7, C: 6, c: 6, H: 1, h: 1, L: 2, l: 2, M: 2, m: 2, Q: 4, q: 4, S: 4, s: 4, T: 2, t: 2, V: 1, v: 1, Z: 0, z: 0 };
+function U(c) {
+  const e = new Array();
+  for (; c !== ""; )
+    if (c.match(/^([ \t\r\n,]+)/))
+      c = c.substr(RegExp.$1.length);
+    else if (c.match(/^([aAcChHlLmMqQsStTvVzZ])/))
+      e[e.length] = { type: N, text: RegExp.$1 }, c = c.substr(RegExp.$1.length);
+    else if (c.match(/^(([-+]?[0-9]+(\.[0-9]*)?|[-+]?\.[0-9]+)([eE][-+]?[0-9]+)?)/))
+      e[e.length] = { type: $, text: `${parseFloat(RegExp.$1)}` }, c = c.substr(RegExp.$1.length);
+    else
+      return [];
+  return e[e.length] = { type: B$1, text: "" }, e;
+}
+function z$1(c, e) {
+  return c.type === e;
+}
+function O$1(c) {
+  const e = [], t = U(c);
+  let a = "BOD", o = 0, n = t[o];
+  for (; !z$1(n, B$1); ) {
+    let r = 0;
+    const s = [];
+    if (a === "BOD")
+      if (n.text === "M" || n.text === "m")
+        o++, r = m[n.text], a = n.text;
+      else
+        return O$1("M0,0" + c);
+    else z$1(n, $) ? r = m[a] : (o++, r = m[n.text], a = n.text);
+    if (o + r < t.length) {
+      for (let h = o; h < o + r; h++) {
+        const f = t[h];
+        if (z$1(f, $))
+          s[s.length] = +f.text;
+        else
+          throw new Error("Param not a number: " + a + "," + f.text);
+      }
+      if (typeof m[a] == "number") {
+        const h = { key: a, data: s };
+        e.push(h), o += r, n = t[o], a === "M" && (a = "L"), a === "m" && (a = "l");
+      } else
+        throw new Error("Bad segment: " + a);
+    } else
+      throw new Error("Path data ended short");
+  }
+  return e;
+}
+function X$1(c) {
+  const e = [];
+  for (const { key: t, data: a } of c)
+    switch (e.push(t), t) {
+      case "C":
+      case "c":
+        e.push(a[0], `${a[1]},`, a[2], `${a[3]},`, a[4], a[5]);
+        break;
+      case "S":
+      case "s":
+      case "Q":
+      case "q":
+        e.push(a[0], `${a[1]},`, a[2], a[3]);
+        break;
+      default:
+        e.push(...a);
+        break;
+    }
+  return e.join(" ");
+}
+function Y(c) {
+  let e = 0, t = 0, a = 0, o = 0;
+  const n = [];
+  for (const { key: r, data: s } of c)
+    switch (r) {
+      case "M":
+        n.push({ key: "M", data: [...s] }), [e, t] = s, [a, o] = s;
+        break;
+      case "m":
+        e += s[0], t += s[1], n.push({ key: "M", data: [e, t] }), a = e, o = t;
+        break;
+      case "L":
+        n.push({ key: "L", data: [...s] }), [e, t] = s;
+        break;
+      case "l":
+        e += s[0], t += s[1], n.push({ key: "L", data: [e, t] });
+        break;
+      case "C":
+        n.push({ key: "C", data: [...s] }), e = s[4], t = s[5];
+        break;
+      case "c": {
+        const h = s.map((f, l) => l % 2 ? f + t : f + e);
+        n.push({ key: "C", data: h }), e = h[4], t = h[5];
+        break;
+      }
+      case "Q":
+        n.push({ key: "Q", data: [...s] }), e = s[2], t = s[3];
+        break;
+      case "q": {
+        const h = s.map((f, l) => l % 2 ? f + t : f + e);
+        n.push({ key: "Q", data: h }), e = h[2], t = h[3];
+        break;
+      }
+      case "A":
+        n.push({ key: "A", data: [...s] }), e = s[5], t = s[6];
+        break;
+      case "a":
+        e += s[5], t += s[6], n.push({ key: "A", data: [s[0], s[1], s[2], s[3], s[4], e, t] });
+        break;
+      case "H":
+        n.push({ key: "H", data: [...s] }), e = s[0];
+        break;
+      case "h":
+        e += s[0], n.push({ key: "H", data: [e] });
+        break;
+      case "V":
+        n.push({ key: "V", data: [...s] }), t = s[0];
+        break;
+      case "v":
+        t += s[0], n.push({ key: "V", data: [t] });
+        break;
+      case "S":
+        n.push({ key: "S", data: [...s] }), e = s[2], t = s[3];
+        break;
+      case "s": {
+        const h = s.map((f, l) => l % 2 ? f + t : f + e);
+        n.push({ key: "S", data: h }), e = h[2], t = h[3];
+        break;
+      }
+      case "T":
+        n.push({ key: "T", data: [...s] }), e = s[0], t = s[1];
+        break;
+      case "t":
+        e += s[0], t += s[1], n.push({ key: "T", data: [e, t] });
+        break;
+      case "Z":
+      case "z":
+        n.push({ key: "Z", data: [] }), e = a, t = o;
+        break;
+    }
+  return n;
+}
+function J$1(c) {
+  const e = [];
+  let t = "", a = 0, o = 0, n = 0, r = 0, s = 0, h = 0;
+  for (const { key: f, data: l } of c) {
+    switch (f) {
+      case "M":
+        e.push({ key: "M", data: [...l] }), [a, o] = l, [n, r] = l;
+        break;
+      case "C":
+        e.push({ key: "C", data: [...l] }), a = l[4], o = l[5], s = l[2], h = l[3];
+        break;
+      case "L":
+        e.push({ key: "L", data: [...l] }), [a, o] = l;
+        break;
+      case "H":
+        a = l[0], e.push({ key: "L", data: [a, o] });
+        break;
+      case "V":
+        o = l[0], e.push({ key: "L", data: [a, o] });
+        break;
+      case "S": {
+        let k = 0, i = 0;
+        t === "C" || t === "S" ? (k = a + (a - s), i = o + (o - h)) : (k = a, i = o), e.push({ key: "C", data: [k, i, ...l] }), s = l[0], h = l[1], a = l[2], o = l[3];
+        break;
+      }
+      case "T": {
+        const [k, i] = l;
+        let u = 0, y = 0;
+        t === "Q" || t === "T" ? (u = a + (a - s), y = o + (o - h)) : (u = a, y = o);
+        const M = a + 2 * (u - a) / 3, p = o + 2 * (y - o) / 3, d = k + 2 * (u - k) / 3, g = i + 2 * (y - i) / 3;
+        e.push({ key: "C", data: [M, p, d, g, k, i] }), s = u, h = y, a = k, o = i;
+        break;
+      }
+      case "Q": {
+        const [k, i, u, y] = l, M = a + 2 * (k - a) / 3, p = o + 2 * (i - o) / 3, d = u + 2 * (k - u) / 3, g = y + 2 * (i - y) / 3;
+        e.push({ key: "C", data: [M, p, d, g, u, y] }), s = k, h = i, a = u, o = y;
+        break;
+      }
+      case "A": {
+        const k = Math.abs(l[0]), i = Math.abs(l[1]), u = l[2], y = l[3], M = l[4], p = l[5], d = l[6];
+        k === 0 || i === 0 ? (e.push({ key: "C", data: [a, o, p, d, p, d] }), a = p, o = d) : (a !== p || o !== d) && (F(a, o, p, d, k, i, u, y, M).forEach(function(L) {
+          e.push({ key: "C", data: L });
+        }), a = p, o = d);
+        break;
+      }
+      case "Z":
+        e.push({ key: "Z", data: [] }), a = n, o = r;
+        break;
+    }
+    t = f;
+  }
+  return e;
+}
+function K$1(c) {
+  return Math.PI * c / 180;
+}
+function T$1(c, e, t) {
+  const a = c * Math.cos(t) - e * Math.sin(t), o = c * Math.sin(t) + e * Math.cos(t);
+  return [a, o];
+}
+function F(c, e, t, a, o, n, r, s, h, f) {
+  const l = K$1(r);
+  let k = [], i = 0, u = 0, y = 0, M = 0;
+  if (f)
+    [i, u, y, M] = f;
+  else {
+    [c, e] = T$1(c, e, -l), [t, a] = T$1(t, a, -l);
+    const x = (c - t) / 2, b = (e - a) / 2;
+    let w = x * x / (o * o) + b * b / (n * n);
+    w > 1 && (w = Math.sqrt(w), o = w * o, n = w * n);
+    const S = s === h ? -1 : 1, A = o * o, R = n * n, j = A * R - A * b * b - R * x * x, D = A * b * b + R * x * x, Z = S * Math.sqrt(Math.abs(j / D));
+    y = Z * o * b / n + (c + t) / 2, M = Z * -n * x / o + (e + a) / 2, i = Math.asin(parseFloat(((e - M) / n).toFixed(9))), u = Math.asin(parseFloat(((a - M) / n).toFixed(9))), c < y && (i = Math.PI - i), t < y && (u = Math.PI - u), i < 0 && (i = Math.PI * 2 + i), u < 0 && (u = Math.PI * 2 + u), h && i > u && (i = i - Math.PI * 2), !h && u > i && (u = u - Math.PI * 2);
+  }
+  let p = u - i;
+  if (Math.abs(p) > Math.PI * 120 / 180) {
+    const x = u, b = t, w = a;
+    h && u > i ? u = i + Math.PI * 120 / 180 * 1 : u = i + Math.PI * 120 / 180 * -1, t = y + o * Math.cos(u), a = M + n * Math.sin(u), k = F(t, a, b, w, o, n, r, 0, h, [u, x, y, M]);
+  }
+  p = u - i;
+  const d = Math.cos(i), g = Math.sin(i), L = Math.cos(u), _ = Math.sin(u), I = Math.tan(p / 4), Q = 4 / 3 * o * I, V = 4 / 3 * n * I, q = [c, e], C = [c + Q * g, e - V * d], H = [t + Q * _, a - V * L], P = [t, a];
+  if (C[0] = 2 * q[0] - C[0], C[1] = 2 * q[1] - C[1], f)
+    return [C, H, P].concat(k);
+  {
+    k = [C, H, P].concat(k);
+    const x = [];
+    for (let b = 0; b < k.length; b += 3) {
+      const w = T$1(k[b][0], k[b][1], l), S = T$1(k[b + 1][0], k[b + 1][1], l), A = T$1(k[b + 2][0], k[b + 2][1], l);
+      x.push([w[0], w[1], S[0], S[1], A[0], A[1]]);
+    }
+    return x;
+  }
+}
+const W$1 = /* @__PURE__ */ Object.freeze(/* @__PURE__ */ Object.defineProperty({
+  __proto__: null,
+  absolutize: Y,
+  normalize: J$1,
+  parsePath: O$1,
+  serialize: X$1
+}, Symbol.toStringTag, { value: "Module" })), { parsePath: v$1, absolutize: tt$1 } = W$1, et$1 = (c, e, t) => {
+  let a, o = null, n = null;
+  if (c.key === "M") {
+    const [r, s] = c.data;
+    return a = [r, s], { p: a };
+  }
+  if (c.key === "H") {
+    const [r] = c.data;
+    return a = [r, (e == null ? void 0 : e[1]) || 0], { p: a };
+  }
+  if (c.key === "V") {
+    const [r] = c.data;
+    return a = [(e == null ? void 0 : e[0]) || 0, r], { p: a };
+  }
+  if (c.key === "L") {
+    const [r, s] = c.data;
+    return a = [r, s], { p: a };
+  }
+  if (c.key === "C") {
+    const [r, s, h, f, l, k] = c.data;
+    return a = [l, k], o = [r, s], n = [h, f], {
+      p: a,
+      control1: o,
+      control2: n
+    };
+  }
+  if (c.key === "S") {
+    const [r, s, h, f] = c.data;
+    if (a = [h, f], n = [r, s], !e)
+      throw new Error("S command without previous point");
+    if (o = e, t.control2) {
+      const l = e;
+      o = [
+        l[0] + (l[0] - t.control2[0]),
+        l[1] + (l[1] - t.control2[1])
+      ];
+    }
+    return {
+      p: a,
+      control1: o,
+      control2: n
+    };
+  }
+  if (c.key === "Q") {
+    const [r, s, h, f] = c.data;
+    return a = [h, f], o = [r, s], {
+      p: a,
+      control1: o
+    };
+  }
+  if (c.key === "T") {
+    const [r, s] = c.data;
+    if (a = [r, s], !e)
+      throw new Error("T command without previous point");
+    if (o = e, t.control1 && !t.control2) {
+      const h = e;
+      o = [
+        h[0] + (h[0] - t.control1[0]),
+        h[1] + (h[1] - t.control1[1])
+      ];
+    }
+  }
+  if (c.key === "A") {
+    const [r, s, h = 0, f = 0, l = 0, k, i] = c.data;
+    if (a = [k, i], !e)
+      throw new Error("A command without previous point");
+    const u = Math.sqrt(
+      (e[0] - k) ** 2 + (e[1] - i) ** 2
+    ), y = Math.max(r, s);
+    let M = r, p = s;
+    if (y < u / 2) {
+      const d = u / 2 / y;
+      M = r * d, p = s * d;
+    }
+    return {
+      p: a,
+      arcConfig: [M, p, h, !!f, !!l]
+    };
+  }
+  throw new Error(`Unknown command ${c.key}`);
+};
+function* at$1(c) {
+  const e = tt$1(v$1(c));
+  let t = null, a = null, o = { control1: null, control2: null };
+  for (const n of e) {
+    if (n.key === "Z") {
+      t && (yield t.close(!0)), t = null;
+      continue;
+    }
+    const r = et$1(n, a, o), s = r.p, h = "control1" in r ? r.control1 : null, f = "control1" in r ? r.control2 : null, l = "arcConfig" in r ? r.arcConfig : null;
+    if (n.key === "M") {
+      t && (yield t.isClosed ? t.close() : t.asStrand()), t = lt$1(s), a = s;
+      continue;
+    }
+    if (a && Math.abs(s[0] - a[0]) < 1e-9 && Math.abs(s[1] - a[1]) < 1e-9) {
+      a = s, o = { control1: h, control2: f };
+      continue;
+    }
+    (n.key === "L" || n.key === "H" || n.key === "V") && (t == null || t.lineTo(s)), (n.key === "C" || n.key === "S") && (t == null || t.cubicBezierCurveTo(s, h, f)), (n.key === "Q" || n.key === "T") && (t == null || t.quadraticBezierCurveTo(s, h)), n.key === "A" && (t == null || t.ellipseTo(s, ...l)), a = s, o = { control1: h, control2: f };
+  }
+  t && (yield t.isClosed ? t.close() : t.asStrand());
+}
+function ht(c) {
+  return Array.from(at$1(c));
 }
 
 var drawShape = /*#__PURE__*/Object.freeze({
   __proto__: null,
-  drawCircle: R$1,
-  drawRect: x$1
+  drawCircle: ct$1,
+  drawEllipse: rt$1,
+  drawPolysides: lt,
+  drawRect: ot$1,
+  drawSVGPath: ht
 });
 
 function i([t, n]) {
   return `${t} ${n}`;
 }
 function s(t) {
-  if (t instanceof at$2)
+  if (t instanceof at$3)
     return `L ${i(t.lastPoint)}`;
-  if (t instanceof ct$2)
+  if (t instanceof ct$3)
     return `A ${t.radius} ${t.radius} 0 ${t.angularLength > Math.PI ? "1" : "0"} ${t.clockwise ? "0" : "1"} ${i(t.lastPoint)}`;
   if (t instanceof jt$1)
     return `A ${t.majorRadius} ${t.minorRadius} ${t.tiltAngle * Ue} ${t.deltaAngle > Math.PI ? "1" : "0"} ${t.clockwise ? "0" : "1"} ${i(t.lastPoint)}`;
@@ -7013,11 +7372,11 @@ var yt = Object.defineProperty;
 var Ct = (n, t, e) => t in n ? yt(n, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : n[t] = e;
 var P = (n, t, e) => Ct(n, typeof t != "symbol" ? t + "" : t, e);
 function L(n) {
-  if (n instanceof v$1)
+  if (n instanceof v$2)
     return [n];
   if (n instanceof _$2)
-    return [new v$1(n)];
-  if (n instanceof O$1)
+    return [new v$2(n)];
+  if (n instanceof O$2)
     return n.figures;
   throw new Error("Unknown shape");
 }
@@ -7083,32 +7442,32 @@ function j(n, t, e = !1) {
   }), s;
 }
 function sn(n, t) {
-  return new O$1(
+  return new O$2(
     G(L(n), L(t))
   );
 }
 function z(n) {
   return n.reduce(
     (t, e) => sn(t, e),
-    new O$1()
+    new O$2()
   );
 }
 function Pt(n, t) {
-  return new O$1(
+  return new O$2(
     Q$1(L(n), L(t))
   );
 }
 function yn(n, t) {
-  return new O$1(
-    lt$1(L(n), L(t))
+  return new O$2(
+    lt$2(L(n), L(t))
   );
 }
 function Cn(n, t, e = !0) {
   if (t instanceof _$2)
     return J(n, t, e);
-  if (t instanceof v$1)
+  if (t instanceof v$2)
     return W(n, t, e);
-  let s = [new B$2([...n.segments])];
+  let s = [new B$3([...n.segments])];
   return t.figures.forEach((r) => {
     s = s.flatMap((i) => W(i, r, e));
   }), s;
@@ -7116,9 +7475,9 @@ function Cn(n, t, e = !0) {
 function xn(n, t, e = !1) {
   if (t instanceof _$2)
     return Q(n, t, e);
-  if (t instanceof v$1)
+  if (t instanceof v$2)
     return j(n, t, e);
-  let s = [new B$2([...n.segments])];
+  let s = [new B$3([...n.segments])];
   return t.figures.forEach((r) => {
     s = s.flatMap((i) => j(i, r, e));
   }), s;
@@ -7148,21 +7507,21 @@ function rn(n, t) {
   if (o === "between" && i !== "between")
     return nt(t, n, i);
   if (i === "before" && o === "before")
-    return J$2(n.firstPoint, t.firstPoint);
+    return J$3(n.firstPoint, t.firstPoint);
   if (i === "after" && o === "after")
-    return J$2(n.lastPoint, t.lastPoint);
+    return J$3(n.lastPoint, t.lastPoint);
   if (i === "before" && o === "after")
-    return J$2(n.firstPoint, t.lastPoint);
+    return J$3(n.firstPoint, t.lastPoint);
   if (i === "after" && o === "before")
-    return J$2(n.lastPoint, t.firstPoint);
+    return J$3(n.lastPoint, t.firstPoint);
   throw new Error("Invalid position");
 }
 function et(n, t) {
-  if (K$1(n, t).length > 0)
+  if (K$2(n, t).length > 0)
     return 0;
   const e = dn$1(n, t.center);
   if (n.isOnSegment(e)) {
-    const s = J$2(e, t.center);
+    const s = J$3(e, t.center);
     if (Math.abs(s - t.radius) < n.precision && t.isOnSegment(e))
       return 0;
     if (s - t.radius > n.precision) {
@@ -7173,7 +7532,7 @@ function et(n, t) {
         nt$2(r, t.radius)
       );
       if (t.isOnSegment(i))
-        return J$2(i, e);
+        return J$3(i, e);
     }
   }
   return Math.min(
@@ -7191,14 +7550,14 @@ const on = (n, t) => {
 };
 function an(n, t) {
   if (Dt(n, t, !0).length > 0) return 0;
-  const e = J$2(n.center, t.center);
+  const e = J$3(n.center, t.center);
   if (e < n.precision && on(n, t))
     return Math.abs(n.radius - t.radius);
   const s = H$1(Q$2(t.center, n.center)), r = e - Math.abs(n.radius - t.radius) < n.precision;
   let i = Ye(s);
   r && t.radius > n.radius && (i += Math.PI);
   const o = r ? i : i + Math.PI, a = n.angleToParam(i), f = t.angleToParam(o);
-  return n.isValidParameter(a) && t.isValidParameter(f) ? J$2(n.paramPoint(a), t.paramPoint(f)) : Math.min(
+  return n.isValidParameter(a) && t.isValidParameter(f) ? J$3(n.paramPoint(a), t.paramPoint(f)) : Math.min(
     n.distanceFrom(t.firstPoint),
     n.distanceFrom(t.lastPoint),
     t.distanceFrom(n.firstPoint),
@@ -7352,14 +7711,14 @@ function pn(n, t, e = 1e-9) {
   return Math.sqrt(s.fMin);
 }
 function dn(n, t) {
-  return n instanceof at$2 && t instanceof at$2 ? rn(n, t) : n instanceof at$2 && t instanceof ct$2 ? et(n, t) : n instanceof ct$2 && t instanceof at$2 ? et(t, n) : n instanceof ct$2 && t instanceof ct$2 ? an(n, t) : pn(n, t);
+  return n instanceof at$3 && t instanceof at$3 ? rn(n, t) : n instanceof at$3 && t instanceof ct$3 ? et(n, t) : n instanceof ct$3 && t instanceof at$3 ? et(t, n) : n instanceof ct$3 && t instanceof ct$3 ? an(n, t) : pn(n, t);
 }
 function wt(n) {
   if (n instanceof Et$1) {
     const r = Q$2(n.lastPoint, n.firstPoint), i = Q$2(n.firstControlPoint, n.firstPoint), o = Q$2(n.lastControlPoint, n.firstPoint), a = un$1(r, i), f = un$1(r, o);
     if (a > 0 && f < 0 || a < 0 && f > 0) return !1;
   }
-  const t = tt$2(n.tangentAtFirstPoint), e = tt$2(n.tangentAtLastPoint);
+  const t = tt$3(n.tangentAtFirstPoint), e = tt$3(n.tangentAtLastPoint);
   let s = Pe(t, e);
   return Math.abs(Math.acos(s)) < Math.PI / 3;
 }
@@ -7380,7 +7739,7 @@ function mn(n) {
     (f, c) => n.firstAngle + c * s * i
   );
   return o.slice(0, -1).map((f, c) => [f, o[c + 1]]).map(([f, c]) => {
-    const l = Math.cos(f), p = Math.sin(f), g = Math.cos(c), d = Math.sin(c), [u, S] = n.center, M = n.minorRadius, v = n.majorRadius, k = new et$3().rotate(
+    const l = Math.cos(f), p = Math.sin(f), g = Math.cos(c), d = Math.sin(c), [u, S] = n.center, M = n.minorRadius, v = n.majorRadius, k = new et$4().rotate(
       n.tiltAngle,
       n.center
     ), C = (Ft) => k.transform(Ft), D = C([u + v * l, S + M * p]), G = C([
@@ -7393,9 +7752,9 @@ function mn(n) {
     return new Et$1(D, Et, G, kt);
   });
 }
-const X = 1e-8, Mt = (n) => n.flatMap((t) => t instanceof at$2 ? [t] : t instanceof ct$2 ? [t] : t instanceof jt$1 ? mn(t).flatMap(
+const X = 1e-8, Mt = (n) => n.flatMap((t) => t instanceof at$3 ? [t] : t instanceof ct$3 ? [t] : t instanceof jt$1 ? mn(t).flatMap(
   (e) => st(e)
-) : t instanceof _t$1 || t instanceof Et$1 ? st(t) : [new at$2(t.firstPoint, t.lastPoint)]);
+) : t instanceof _t$1 || t instanceof Et$1 ? st(t) : [new at$3(t.firstPoint, t.lastPoint)]);
 function q(n, t, e = !0) {
   const s = n.map((c) => ({
     offset: y(c, t),
@@ -7404,8 +7763,8 @@ function q(n, t, e = !0) {
   let i = e ? null : s.at(-1), o = e ? s.at(-1) : null;
   if (r.length === 1) return r;
   const a = (c) => {
-    i ? c.offset instanceof S ? Y$1(c.offset.firstPoint, c.offset.lastPoint) || r.push(
-      new at$2(c.offset.firstPoint, c.offset.lastPoint)
+    i ? c.offset instanceof S ? Y$2(c.offset.firstPoint, c.offset.lastPoint) || r.push(
+      new at$3(c.offset.firstPoint, c.offset.lastPoint)
     ) : r.push(c.offset) : i = c;
   }, f = function* () {
     for (const c of s.slice(0, -1))
@@ -7419,7 +7778,7 @@ function q(n, t, e = !0) {
       continue;
     }
     const l = o.offset.lastPoint, p = c.offset.firstPoint;
-    if (Y$1(l, p)) {
+    if (Y$2(l, p)) {
       a(o), o = c;
       continue;
     }
@@ -7456,7 +7815,7 @@ function q(n, t, e = !0) {
     const d = o.original.lastPoint, u = St$2(
       Q$2(p, d),
       Q$2(l, d)
-    ) > 0, S$1 = new ct$2(l, p, d, u);
+    ) > 0, S$1 = new ct$3(l, p, d, u);
     a(o), r.push(S$1), o = c;
   }
   return o && a(o), r;
@@ -7472,7 +7831,7 @@ function It(n) {
         ...a,
         ...f.flatMap((l) => [l.firstPoint, l.lastPoint])
       ].filter((l) => {
-        const p = Y$1(l, s.firstPoint) || Y$1(l, s.lastPoint), g = Y$1(l, i.firstPoint) || Y$1(l, i.lastPoint);
+        const p = Y$2(l, s.firstPoint) || Y$2(l, s.lastPoint), g = Y$2(l, i.firstPoint) || Y$2(l, i.lastPoint);
         return !(p && g);
       });
       c.length && (e(r, c), e(o + r + 1, c));
@@ -7491,19 +7850,19 @@ function bt(n, t, e) {
 }
 function T(n, t) {
   const e = n.clockwise ? t : -t, s = Mt(n.segments), r = q(s, e);
-  if (r.length < 2) return new O$1();
+  if (r.length < 2) return new O$2();
   const i = It(r);
   if (!i.size) {
     const l = new _$2(r);
-    return new O$1([new v$1(l)]);
+    return new O$2([new v$2(l)]);
   }
   const o = St(
     i,
     r
   ), a = bt(o, n, t);
-  if (!a.length) return new O$1();
-  const c = Xt(a).filter((l) => l.length > 1).filter((l) => Y$1(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new _$2(l));
-  return c.length ? new O$1(c.map((l) => new v$1(l))) : new O$1();
+  if (!a.length) return new O$2();
+  const c = Xt(a).filter((l) => l.length > 1).filter((l) => Y$2(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new _$2(l));
+  return c.length ? new O$2(c.map((l) => new v$2(l))) : new O$2();
 }
 function Pn(n, t, e = "round") {
   const s = t / 2, r = Mt(n.segments), i = q(r, s, !1), o = q(
@@ -7516,7 +7875,7 @@ function Pn(n, t, e = "round") {
     u.lastPoint,
     S.firstPoint,
     u.tangentAtLastPoint
-  ) : new at$2(u.lastPoint, S.firstPoint), f = [
+  ) : new at$3(u.lastPoint, S.firstPoint), f = [
     ...i,
     a(
       i[i.length - 1],
@@ -7530,15 +7889,15 @@ function Pn(n, t, e = "round") {
   ], c = It(f);
   if (!c.size) {
     const u = new _$2(f);
-    return new O$1([new v$1(u)]);
+    return new O$2([new v$2(u)]);
   }
   const l = St(
     c,
     f
   ), p = bt(l, n, s);
-  if (!p.length) return new O$1();
-  const d = Xt(p).filter((u) => u.length > 1).filter((u) => Y$1(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new _$2(u));
-  return d.length ? new O$1(d.map((u) => new v$1(u))) : new O$1();
+  if (!p.length) return new O$2();
+  const d = Xt(p).filter((u) => u.length > 1).filter((u) => Y$2(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new _$2(u));
+  return d.length ? new O$2(d.map((u) => new v$2(u))) : new O$2();
 }
 function wn(n, t) {
   const e = n.map((s) => {
@@ -7561,7 +7920,7 @@ function Dn(n, t) {
   return wn(L(n), t);
 }
 function On(n, t, { endCap: e = "round" } = {}) {
-  return n instanceof B$2 ? Pn(n, t, e) : Mn(L(n), t);
+  return n instanceof B$3 ? Pn(n, t, e) : Mn(L(n), t);
 }
 class In {
   constructor() {
@@ -7614,7 +7973,7 @@ class x extends In {
    *
    */
   inList(t) {
-    const e = ({ element: s }) => !!t.find((r) => Y$1(r, s.point));
+    const e = ({ element: s }) => !!t.find((r) => Y$2(r, s.point));
     return this.filters.push(e), this;
   }
   /**
@@ -7623,7 +7982,7 @@ class x extends In {
    */
   atDistance(t, e = [0, 0]) {
     function s({ element: r }) {
-      return Math.abs(J$2(e, r.point) - t) < 1e-9;
+      return Math.abs(J$3(e, r.point) - t) < 1e-9;
     }
     return this.filters.push(s), this;
   }
@@ -7634,7 +7993,7 @@ class x extends In {
    */
   atPoint(t) {
     function e({ element: s }) {
-      return Y$1(t, s.point);
+      return Y$2(t, s.point);
     }
     return this.filters.push(e), this;
   }
@@ -7711,33 +8070,33 @@ function At(n, t, e, s = () => !0) {
       throw new Error("Bug in the filletting algo");
     return i(a, f), new _$2(r, { ignoreChecks: !0 });
   } else
-    return new B$2(r, { ignoreChecks: !0 });
+    return new B$3(r, { ignoreChecks: !0 });
 }
 function B(n, t, e) {
   const s = typeof e == "function" ? e(new x()) : e, r = s && s.asFilterFun();
-  if (n instanceof _$2 || n instanceof B$2)
+  if (n instanceof _$2 || n instanceof B$3)
     return At(V, n, t, r);
-  if (n instanceof v$1) {
+  if (n instanceof v$2) {
     const i = B(n.contour, t, s), o = n.holes.map((a) => B(a, t, s));
-    return new v$1(i, o, { ignoreChecks: !0 });
+    return new v$2(i, o, { ignoreChecks: !0 });
   }
-  if (n instanceof O$1) {
+  if (n instanceof O$2) {
     const i = n.figures.map((o) => B(o, t, s));
-    return new O$1(i, { ignoreChecks: !0 });
+    return new O$2(i, { ignoreChecks: !0 });
   }
   throw new Error("invalid shape to fillet");
 }
 function R(n, t, e) {
   const s = typeof e == "function" ? e(new x()) : e, r = s && s.asFilterFun();
-  if (n instanceof _$2 || n instanceof B$2)
+  if (n instanceof _$2 || n instanceof B$3)
     return At(V, n, t, r);
-  if (n instanceof v$1) {
+  if (n instanceof v$2) {
     const i = R(n.contour, t, s), o = n.holes.map((a) => R(a, t, s));
-    return new v$1(i, o, { ignoreChecks: !0 });
+    return new v$2(i, o, { ignoreChecks: !0 });
   }
-  if (n instanceof O$1) {
+  if (n instanceof O$2) {
     const i = n.figures.map((o) => R(o, t, s));
-    return new O$1(i, { ignoreChecks: !0 });
+    return new O$2(i, { ignoreChecks: !0 });
   }
   throw new Error("invalid shape to chamfer");
 }
@@ -7756,13 +8115,13 @@ function Bn(n) {
   return new Sn(n);
 }
 function it(n) {
-  if (n instanceof O$1)
+  if (n instanceof O$2)
     return d(n);
-  if (n instanceof v$1)
+  if (n instanceof v$2)
     return p(n);
   if (n instanceof _$2)
     return `<path d="${w(n)}" />`;
-  if (n instanceof B$2)
+  if (n instanceof B$3)
     return `<path d="${j$1(n)}" />`;
   if (Hn(n))
     return `<path d="${`M ${n.firstPoint.join(" ")}`} ${s(
@@ -7795,9 +8154,9 @@ function Rn(n, {
 }
 const vt = (n) => {
   if (n.type === "LINE")
-    return new at$2(n.firstPoint, n.lastPoint);
+    return new at$3(n.firstPoint, n.lastPoint);
   if (n.type === "ARC")
-    return new ct$2(
+    return new ct$3(
       n.firstPoint,
       n.lastPoint,
       n.center,
@@ -7833,10 +8192,10 @@ const vt = (n) => {
   return new _$2(t);
 }, Lt = (n) => {
   const t = H(n.contour), e = n.holes.map(H);
-  return new v$1(t, e);
+  return new v$2(t, e);
 }, bn = (n) => {
   const t = n.figures.map(Lt);
-  return new O$1(t);
+  return new O$2(t);
 };
 function zn(n) {
   if (n.type === "DIAGRAM")
@@ -7862,13 +8221,13 @@ function $n([n, t]) {
 var pantograph = /*#__PURE__*/Object.freeze({
   __proto__: null,
   DEG2RAD: ft,
-  DrawingPen: ot$1,
+  DrawingPen: ot$2,
   RAD2DEG: An,
   cartesianToPolar: $n,
   chamfer: R,
   confineStrand: xn,
   cut: Pt,
-  draw: lt,
+  draw: lt$1,
   eraseStrand: Cn,
   exportJSON: It$1,
   exportSVG: Rn,
@@ -7885,12 +8244,12 @@ var pantograph = /*#__PURE__*/Object.freeze({
 });
 
 function sketchSegment(segment, plane) {
-    if (segment instanceof at$2) {
+    if (segment instanceof at$3) {
         const firstPoint = plane.toWorldCoords(segment.firstPoint);
         const lastPoint = plane.toWorldCoords(segment.lastPoint);
         return makeLine(firstPoint, lastPoint);
     }
-    if (segment instanceof ct$2) {
+    if (segment instanceof ct$3) {
         return makeThreePointArc(plane.toWorldCoords(segment.firstPoint), plane.toWorldCoords(segment.midPoint), plane.toWorldCoords(segment.lastPoint));
     }
     if (segment instanceof jt$1) {
@@ -7945,17 +8304,17 @@ function sketchOnPlane(pantographObject, planeInput = "XY", origin = [0, 0, 0])
     const plane = planeInput instanceof Plane
         ? makePlane(planeInput)
         : makePlane(planeInput, origin);
-    if (pantographObject instanceof O$1) {
+    if (pantographObject instanceof O$2) {
         return sketchDiagram(pantographObject, plane);
     }
-    if (pantographObject instanceof v$1) {
+    if (pantographObject instanceof v$2) {
         return sketchFigure(pantographObject, plane);
     }
     if (pantographObject instanceof _$2) {
         return sketchStroke(pantographObject, plane);
     }
-    if (pantographObject instanceof at$2 ||
-        pantographObject instanceof ct$2 ||
+    if (pantographObject instanceof at$3 ||
+        pantographObject instanceof ct$3 ||
         pantographObject instanceof jt$1 ||
         pantographObject instanceof _t$1 ||
         pantographObject instanceof Et$1) {
@@ -7964,16 +8323,16 @@ function sketchOnPlane(pantographObject, planeInput = "XY", origin = [0, 0, 0])
     throw new Error(`Unsupported object type "${pantographObject.constructor.name}"`);
 }
 function svgPathsForShape(shape) {
-    if (shape instanceof O$1) {
+    if (shape instanceof O$2) {
         return shape.figures.flatMap(svgPathsForShape);
     }
-    else if (shape instanceof v$1) {
+    else if (shape instanceof v$2) {
         return shape.allLoops.map((loop) => w(loop));
     }
     else if (shape instanceof _$2) {
         return [w(shape)];
     }
-    else if (shape instanceof B$2) {
+    else if (shape instanceof B$3) {
         return [j$1(shape)];
     }
     else if (Hn(shape)) {
@@ -7988,8 +8347,8 @@ function toSVGViewBox(shape) {
 function wrapPantograph(pantographObject) {
     const isPantograph = Hn(pantographObject) ||
         pantographObject instanceof _$2 ||
-        pantographObject instanceof v$1 ||
-        pantographObject instanceof O$1 ||
+        pantographObject instanceof v$2 ||
+        pantographObject instanceof O$2 ||
         pantographObject instanceof Drawing;
     if (!isPantograph)
         return pantographObject;
@@ -8008,7 +8367,7 @@ function initStudioIntegration() {
 }
 class Drawing {
     diagram;
-    constructor(diagram = new O$1()) {
+    constructor(diagram = new O$2()) {
         this.diagram = diagram;
     }
     clone() {
@@ -8084,7 +8443,7 @@ class Drawing {
         return new Drawing(Dn(this.diagram, distance));
     }
 }
-class ReDrawingPen extends ot$1 {
+class ReDrawingPen extends ot$2 {
     // @ts-expect-error forcing a different type
     close() {
         return new Drawing(super.close());
@@ -8097,5 +8456,14 @@ class ReDrawingPen extends ot$1 {
 function redraw(p) {
     return new ReDrawingPen(p);
 }
+function wrapDrawing(fn) {
+    return function (...args) {
+        return new Drawing(fn.apply(this, args));
+    };
+}
+const drawCircle = wrapDrawing(ct$1);
+const drawRect = wrapDrawing(ot$1);
+const drawEllipse = wrapDrawing(rt$1);
+const drawPolysides = wrapDrawing(lt);
 
-export { Drawing, ReDrawingPen, drawShape, initStudioIntegration, pantograph, redraw, sketchDiagram, sketchFigure, sketchOnPlane, sketchSegment, sketchStroke };
+export { Drawing, ReDrawingPen, drawCircle, drawEllipse, drawPolysides, drawRect, drawShape, initStudioIntegration, pantograph, redraw, sketchDiagram, sketchFigure, sketchOnPlane, sketchSegment, sketchStroke, wrapDrawing };