pantograph2d 0.10.1 → 0.11.1

package/dist/{models-CFd5lRKc.js → models-BHeLX0dj.js}

@@ -1,34 +1,34 @@
-var nn = Object.defineProperty;
-var en = (t, n, e) => n in t ? nn(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var C = (t, n, e) => en(t, typeof n != "symbol" ? n + "" : n, e);
-import { b as k, d as sn, e as Tt, a as z, s as V, n as on, p as Lt, l as U, A as S, g as P, v as qt, E as M, T as rn, w as ln, Q as I, x as $, C as A, c as un, y as cn, L as b, F as zt, G as ut, z as N, H as an, m as fn, q as hn, I as mt, B as pn } from "./QuadraticBezier-DCa0WGs0.js";
-function dn(t, n) {
-  const e = k(n, t.firstPoint), s = sn(e, t.V) / t.squareLength;
+var on = Object.defineProperty;
+var ln = (t, n, e) => n in t ? on(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
+var b = (t, n, e) => ln(t, typeof n != "symbol" ? n + "" : n, e);
+import { b as k, d as un, e as Dt, a as z, s as N, n as cn, p as Rt, l as j, A as x, g as P, w as Nt, E as C, T as an, x as fn, Q as M, y as $, C as A, c as hn, v as pn, L as y, F as Vt, G as ut, z as V, H as dn, m as mn, q as gn, I as mt, B as Pn } from "./QuadraticBezier-BeY2TXKH.js";
+function In(t, n) {
+  const e = k(n, t.firstPoint), s = un(e, t.V) / t.squareLength;
   return t.paramPoint(s);
 }
 function K(t, n, e) {
-  const s = e || t.precision, i = dn(t, n.center), o = Tt(i, n.center);
-  if (o > n.radius + s) return [];
-  if (Math.abs(o - n.radius) < s) {
+  const s = e || t.precision, i = In(t, n.center), r = Dt(i, n.center);
+  if (r > n.radius + s) return [];
+  if (Math.abs(r - n.radius) < s) {
     const c = i;
     return t.isOnSegment(c) && n.isOnSegment(c) ? [c] : [];
   }
-  const l = [], r = Math.sqrt(
-    n.radius * n.radius - o * o
-  ), u = t.tangentAtFirstPoint, a = z(i, V(u, r));
+  const l = [], o = Math.sqrt(
+    n.radius * n.radius - r * r
+  ), u = t.tangentAtFirstPoint, a = z(i, N(u, o));
   t.isOnSegment(a) && n.isOnSegment(a) && l.push(a);
-  const f = z(i, V(u, -r));
+  const f = z(i, N(u, -o));
   return t.isOnSegment(f) && n.isOnSegment(f) && l.push(f), l;
 }
-const mn = (t) => {
+const wn = (t) => {
   const { firstPoint: n, lastPoint: e, center: s, clockwise: i } = t;
-  return new S(e, n, s, i, {
+  return new x(e, n, s, i, {
     ignoreChecks: !0
   });
-}, gn = (t, n) => {
+}, xn = (t, n) => {
   if (t.isSame(n))
     return [t];
-  const e = U(
+  const e = j(
     [
       n.isOnSegment(t.firstPoint) ? t.firstPoint : null,
       n.isOnSegment(t.lastPoint) ? t.lastPoint : null,
@@ -41,11 +41,11 @@ const mn = (t) => {
   if (e.length === 0) return [];
   if (e.length === 1) return [];
   if (e.length === 2)
-    return t.isSame(mn(n)) ? [] : [new S(e[0], e[1], t.center, t.clockwise)];
+    return t.isSame(wn(n)) ? [] : [new x(e[0], e[1], t.center, t.clockwise)];
   if (e.length === 3) {
     const s = P(e[0], n.lastPoint) || P(e[0], n.firstPoint) ? 1 : 0;
     return [
-      new S(
+      new x(
         e[0 + s],
         e[1 + s],
         t.center,
@@ -54,133 +54,133 @@ const mn = (t) => {
     ];
   } else if (e.length === 4)
     return [
-      new S(e[0], e[1], t.center, t.clockwise),
-      new S(e[2], e[3], t.center, t.clockwise)
+      new x(e[0], e[1], t.center, t.clockwise),
+      new x(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 = Tt(t.center, n.center), l = t.radius + n.radius;
-  if (o > l + i)
+function jt(t, n, e = !1, s) {
+  const i = s || t.precision, r = Dt(t.center, n.center), l = t.radius + n.radius;
+  if (r > l + i)
     return [];
-  const r = Math.abs(t.radius - n.radius);
-  if (o < r - i)
+  const o = Math.abs(t.radius - n.radius);
+  if (r < o - i)
     return [];
-  if (o < i)
-    return r > i ? [] : e ? gn(t, n) : [];
-  const u = on(k(n.center, t.center)), a = o > l - i;
+  if (r < i)
+    return o > i ? [] : e ? xn(t, n) : [];
+  const u = cn(k(n.center, t.center)), a = r > l - i;
   if (
     // circles are outside each other
     a || // circles are inside each other
-    Math.abs(o - r) < i
+    Math.abs(r - o) < i
   ) {
-    const g = a || t.radius > n.radius ? 1 : -1, w = z(
+    const g = a || t.radius > n.radius ? 1 : -1, I = z(
       t.center,
-      V(u, g * t.radius)
+      N(u, g * t.radius)
     );
-    return t.isOnSegment(w) && n.isOnSegment(w) ? [w] : [];
+    return t.isOnSegment(I) && n.isOnSegment(I) ? [I] : [];
   }
-  const f = t.radius * t.radius / (2 * o) - n.radius * n.radius / (2 * o) + o / 2, c = z(
+  const f = t.radius * t.radius / (2 * r) - n.radius * n.radius / (2 * r) + r / 2, c = z(
     t.center,
-    V(u, f)
+    N(u, f)
   ), h = Math.sqrt(
     t.radius * t.radius - f * f
-  ), p = Lt(u), d = z(c, V(p, h)), m = z(c, V(p, -h)), x = [];
-  return t.isOnSegment(d) && n.isOnSegment(d) && x.push(d), t.isOnSegment(m) && n.isOnSegment(m) && x.push(m), x;
+  ), p = Rt(u), d = z(c, N(p, h)), m = z(c, N(p, -h)), w = [];
+  return t.isOnSegment(d) && n.isOnSegment(d) && w.push(d), t.isOnSegment(m) && n.isOnSegment(m) && w.push(m), w;
 }
 function st(t, n, e = 1e-9) {
-  const s = t.transform(n.ellipseReferenceFrameTransform), i = s.slope, o = s.yIntercept, l = n.majorRadius * n.majorRadius, r = n.minorRadius * n.minorRadius, u = n.majorRadius * n.minorRadius, a = s.slope * s.slope, f = s.yIntercept * s.yIntercept, c = (g) => g.map(
-    (w) => n.reverseEllipseReferenceFrameTransform.transform(w)
-  ).filter((w) => t.isOnSegment(w) && n.isOnSegment(w));
+  const s = t.transform(n.ellipseReferenceFrameTransform), i = s.slope, r = s.yIntercept, l = n.majorRadius * n.majorRadius, o = n.minorRadius * n.minorRadius, u = n.majorRadius * n.minorRadius, a = s.slope * s.slope, f = s.yIntercept * s.yIntercept, c = (g) => g.map(
+    (I) => n.reverseEllipseReferenceFrameTransform.transform(I)
+  ).filter((I) => t.isOnSegment(I) && n.isOnSegment(I));
   if (!Number.isFinite(i)) {
     const g = s.firstPoint[0];
     if (Math.abs(g) - n.majorRadius > e) return [];
     if (Math.abs(Math.abs(g) - n.majorRadius) < e)
       return c([[g, 0]]);
-    const w = n.minorRadius * Math.sqrt(1 - g * g / l), F = [g, w], y = [g, -w];
-    return c([F, y]);
+    const I = n.minorRadius * Math.sqrt(1 - g * g / l), F = [g, I], S = [g, -I];
+    return c([F, S]);
   }
-  const h = l * a + r - f;
+  const h = l * a + o - f;
   if (h < -e)
     return [];
-  const p = l * a + r;
+  const p = l * a + o;
   if (Math.abs(h) < e) {
-    const g = -(l * i * o) / p, w = r * o / p;
-    return c([[g, w]]);
+    const g = -(l * i * r) / p, I = o * r / p;
+    return c([[g, I]]);
   }
   const d = Math.sqrt(h), m = [
-    -(l * i * o + u * d) / p,
-    (r * o - u * i * d) / p
-  ], x = [
-    -(l * i * o - u * d) / p,
-    (r * o + u * i * d) / p
+    -(l * i * r + u * d) / p,
+    (o * r - u * i * d) / p
+  ], w = [
+    -(l * i * r - u * d) / p,
+    (o * r + u * i * d) / p
   ];
-  return c([m, x]);
-}
-function Rt(t, n) {
-  const e = Math.max(t.precision, n.precision), s = t.coefficients, i = s.x2, o = s.xy, l = s.y2, r = s.x, u = s.y, a = s.c, f = n.coefficients, c = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, x = f.c, g = {
-    z0: a * i * d * d + i * i * x * x - r * i * d * x + c * c * a * a - 2 * i * x * c * a - r * d * c * a + c * r * r * x,
-    z1: m * r * r * c - x * d * i * o - 2 * i * x * c * u - a * c * h * r + 2 * d * h * i * a + 2 * m * x * i * i + d * d * i * u - m * d * i * r - 2 * i * m * c * a - a * c * d * o + 2 * a * u * c * c - x * h * i * r - u * c * d * r + 2 * x * o * c * r,
-    z2: m * m * i * i + 2 * p * x * i * i - u * c * d * o + x * c * o * o - u * c * h * r - x * h * i * o - 2 * i * m * c * u + 2 * d * h * i * u - p * d * i * r - 2 * i * p * c * a + h * h * i * a + 2 * m * o * c * r + u * u * c * c - l * c * d * r - m * h * i * r + 2 * a * l * c * c - a * c * h * o + p * r * r * c + d * d * i * l - m * d * i * o - 2 * i * x * c * l,
-    z3: -2 * i * c * l * m + m * c * o * o + 2 * p * o * c * r - l * c * h * r + h * h * i * u - m * h * i * o - 2 * i * p * c * u - u * c * h * o - p * h * i * r + 2 * m * p * i * i + 2 * u * l * c * c - l * c * d * o + 2 * d * h * i * l - p * d * i * o,
-    z4: i * i * p * p - 2 * i * p * c * l + c * c * l * l - o * i * h * p - o * h * c * l + o * o * c * p + l * i * h * h
-  }, F = qt(
+  return c([m, w]);
+}
+function Ut(t, n) {
+  const e = Math.max(t.precision, n.precision), s = t.coefficients, i = s.x2, r = s.xy, l = s.y2, o = s.x, u = s.y, a = s.c, f = n.coefficients, c = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, w = f.c, g = {
+    z0: a * i * d * d + i * i * w * w - o * i * d * w + c * c * a * a - 2 * i * w * c * a - o * d * c * a + c * o * o * w,
+    z1: m * o * o * c - w * d * i * r - 2 * i * w * c * u - a * c * h * o + 2 * d * h * i * a + 2 * m * w * i * i + d * d * i * u - m * d * i * o - 2 * i * m * c * a - a * c * d * r + 2 * a * u * c * c - w * h * i * o - u * c * d * o + 2 * w * r * c * o,
+    z2: m * m * i * i + 2 * p * w * i * i - u * c * d * r + w * c * r * r - u * c * h * o - w * h * i * r - 2 * i * m * c * u + 2 * d * h * i * u - p * d * i * o - 2 * i * p * c * a + h * h * i * a + 2 * m * r * c * o + u * u * c * c - l * c * d * o - m * h * i * o + 2 * a * l * c * c - a * c * h * r + p * o * o * c + d * d * i * l - m * d * i * r - 2 * i * w * c * l,
+    z3: -2 * i * c * l * m + m * c * r * r + 2 * p * r * c * o - l * c * h * o + h * h * i * u - m * h * i * r - 2 * i * p * c * u - u * c * h * r - p * h * i * o + 2 * m * p * i * i + 2 * u * l * c * c - l * c * d * r + 2 * d * h * i * l - p * d * i * r,
+    z4: i * i * p * p - 2 * i * p * c * l + c * c * l * l - r * i * h * p - r * h * c * l + r * r * c * p + l * i * h * h
+  }, F = Nt(
     [g.z0, g.z1, g.z2, g.z3, g.z4],
     e
-  ).flatMap((y) => {
-    const R = i * h * y + i * d - c * o * y - c * r;
+  ).flatMap((S) => {
+    const R = i * h * S + i * d - c * r * S - c * o;
     if (R)
-      return [[-(i * x + i * p * y * y - c * l * y * y + i * m * y - c * u * y - c * a) / R, y]];
-    const T = o * y + r, L = -T / (2 * i), j = l * y * y + u * y + a, q = T * T / (4 * i * i) - j / i;
+      return [[-(i * w + i * p * S * S - c * l * S * S + i * m * S - c * u * S - c * a) / R, S]];
+    const T = r * S + o, L = -T / (2 * i), U = l * S * S + u * S + a, q = T * T / (4 * i * i) - U / i;
     if (Math.abs(q) < e)
-      return [[L, y]];
+      return [[L, S]];
     if (q > 0) {
       const H = Math.sqrt(q);
-      return [[L + H, y], [L - H, y]];
+      return [[L + H, S], [L - H, S]];
     }
     return [];
   });
-  return U(F, e);
+  return j(F, e);
 }
 function gt(t, n) {
-  return Rt(t, n).filter((s) => t.isOnSegment(s) && n.isOnSegment(s));
+  return Ut(t, n).filter((s) => t.isOnSegment(s) && n.isOnSegment(s));
 }
-const Pn = (t) => {
+const Sn = (t) => {
   const {
     firstPoint: n,
     lastPoint: e,
     center: s,
     majorRadius: i,
-    minorRadius: o,
+    minorRadius: r,
     tiltAngle: l,
-    clockwise: r
+    clockwise: o
   } = t;
-  return new M(
+  return new C(
     e,
     n,
     s,
     i,
-    o,
-    l,
     r,
+    l,
+    o,
     {
       ignoreChecks: !0,
       angleUnits: "rad"
     }
   );
-}, wn = (t, n) => {
+}, yn = (t, n) => {
   if (t.isSame(n))
     return [t];
-  const e = (i, o) => new M(
+  const e = (i, r) => new C(
     i,
-    o,
+    r,
     t.center,
     t.majorRadius,
     t.minorRadius,
     t.tiltAngle,
     t.clockwise,
     { ignoreChecks: !0, angleUnits: "rad" }
-  ), s = U(
+  ), s = j(
     [
       n.isOnSegment(t.firstPoint) ? t.firstPoint : null,
       n.isOnSegment(t.lastPoint) ? t.lastPoint : null,
@@ -189,11 +189,11 @@ const Pn = (t) => {
     ].filter((i) => i !== null)
     // We sort by the param value of the first arc. This means that the points
     // will be sorted with the same orientation than arc1
-  ).sort((i, o) => t.pointToParam(i) - t.pointToParam(o));
+  ).sort((i, r) => t.pointToParam(i) - t.pointToParam(r));
   if (s.length === 0) return [];
   if (s.length === 1) return [];
   if (s.length === 2)
-    return t.isSame(Pn(n)) ? [] : [e(s[0], s[1])];
+    return t.isSame(Sn(n)) ? [] : [e(s[0], s[1])];
   if (s.length === 3) {
     const i = P(s[0], n.lastPoint) || P(s[0], n.firstPoint) ? 1 : 0;
     return [e(s[0 + i], s[1 + i])];
@@ -201,42 +201,42 @@ const Pn = (t) => {
     return [e(s[0], s[1]), e(s[2], s[3])];
   throw new Error("Bug in the ellipse arc ellipse arc overlap algorithm");
 };
-function xn(t, n, e = !1) {
+function bn(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
-  return P(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(t, n) : [] : Rt(t, n).filter((l) => t.isOnSegment(l) && n.isOnSegment(l));
+  return P(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 ? yn(t, n) : [] : Ut(t, n).filter((l) => t.isOnSegment(l) && n.isOnSegment(l));
 }
 function Pt(t, n) {
-  const [e, s] = t.firstPoint, [i, o] = t.lastPoint, l = new rn().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 [e, s] = t.firstPoint, [i, r] = t.lastPoint, l = new an().translate(-e, -s).rotate(-Math.atan2(r - s, i - e)), o = l.clone().inverse(), u = n.transform(l);
+  return u.paramsAtY(0).map((a) => u.paramPoint(a)).map((a) => o.transform(a)).filter((a) => t.isOnSegment(a));
 }
-const Sn = (t, n = 1e-9) => {
+const Cn = (t, n = 1e-9) => {
   let e = t;
   return Math.abs(t) < n && (e = 0), e.toFixed(-Math.log10(n));
 };
-function Vt(t, n = 1e-9) {
+function Ht(t, n = 1e-9) {
   return Array.from(
-    new Map(t.map((e) => [Sn(e, n), e])).values()
+    new Map(t.map((e) => [Cn(e, n), e])).values()
   );
 }
-const yn = (t, n) => {
-  const [[e, s, i, o], [l, r, u, a]] = n.polynomialCoefficients, f = t.coefficients, c = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, x = f.c, g = e * e, w = s * s, F = i * i, y = o * o, R = l * l, T = r * r, L = u * u, j = a * a, q = x + d * e + c * g + m * l + h * e * l + p * R, H = d * s + 2 * c * e * s + h * s * l + m * r + h * e * r + 2 * p * l * r, Wt = c * w + d * i + 2 * c * e * i + h * i * l + h * s * r + p * T + m * u + h * e * u + 2 * p * l * u, Jt = 2 * c * s * i + d * o + 2 * c * e * o + h * o * l + h * i * r + h * s * u + 2 * p * r * u + m * a + h * e * a + 2 * p * l * a, Kt = c * F + 2 * c * s * o + h * o * r + h * i * u + p * L + h * s * a + 2 * p * r * a, Zt = 2 * c * i * o + h * o * u + h * i * a + 2 * p * u * a, tn = c * y + h * o * a + p * j;
-  return [q, H, Wt, Jt, Kt, Zt, tn];
+const Mn = (t, n) => {
+  const [[e, s, i, r], [l, o, u, a]] = n.polynomialCoefficients, f = t.coefficients, c = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, w = f.c, g = e * e, I = s * s, F = i * i, S = r * r, R = l * l, T = o * o, L = u * u, U = a * a, q = w + d * e + c * g + m * l + h * e * l + p * R, H = d * s + 2 * c * e * s + h * s * l + m * o + h * e * o + 2 * p * l * o, tn = c * I + d * i + 2 * c * e * i + h * i * l + h * s * o + p * T + m * u + h * e * u + 2 * p * l * u, nn = 2 * c * s * i + d * r + 2 * c * e * r + h * r * l + h * i * o + h * s * u + 2 * p * o * u + m * a + h * e * a + 2 * p * l * a, en = c * F + 2 * c * s * r + h * r * o + h * i * u + p * L + h * s * a + 2 * p * o * a, sn = 2 * c * i * r + h * r * u + h * i * a + 2 * p * u * a, rn = c * S + h * r * a + p * U;
+  return [q, H, tn, nn, en, sn, rn];
 };
-function wt(t, n) {
-  const e = Math.max(t.precision, n.precision), s = yn(t, n), i = qt(s, e).filter((o) => o >= -n.precision && o <= 1 + n.precision);
-  return Vt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
+function It(t, n) {
+  const e = Math.max(t.precision, n.precision), s = Mn(t, n), i = Nt(s, e).filter((r) => r >= -n.precision && r <= 1 + n.precision);
+  return Ht(i, e).map((r) => n.paramPoint(r)).filter((r) => t.isOnSegment(r));
 }
-const bn = (t, n) => {
-  const [[e, s, i], [o, l, r]] = n.polynomialCoefficients, u = t.coefficients, a = u.x2, f = u.xy, c = u.y2, h = u.x, p = u.y, d = u.c, m = e * e, x = s * s, g = i * i, w = o * o, F = l * l, y = r * r, R = a * m + f * e * o + c * w + h * e + p * o + d, T = 2 * a * e * s + f * e * l + f * s * o + 2 * c * o * l + h * s + p * l, L = 2 * a * e * i + a * x + f * e * r + f * s * l + f * i * o + 2 * c * o * r + c * F + h * i + p * r, j = 2 * a * s * i + f * s * r + f * i * l + 2 * c * l * r, q = a * g + f * i * r + c * y;
-  return [R, T, L, j, q];
+const An = (t, n) => {
+  const [[e, s, i], [r, l, o]] = n.polynomialCoefficients, u = t.coefficients, a = u.x2, f = u.xy, c = u.y2, h = u.x, p = u.y, d = u.c, m = e * e, w = s * s, g = i * i, I = r * r, F = l * l, S = o * o, R = a * m + f * e * r + c * I + h * e + p * r + d, T = 2 * a * e * s + f * e * l + f * s * r + 2 * c * r * l + h * s + p * l, L = 2 * a * e * i + a * w + f * e * o + f * s * l + f * i * r + 2 * c * r * o + c * F + h * i + p * o, U = 2 * a * s * i + f * s * o + f * i * l + 2 * c * l * o, q = a * g + f * i * o + c * S;
+  return [R, T, L, U, q];
 };
-function xt(t, n) {
-  const e = Math.max(t.precision, n.precision), s = bn(t, n), i = ln(...s).filter((o) => o >= -n.precision && o <= 1 + n.precision);
-  return Vt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
+function wt(t, n) {
+  const e = Math.max(t.precision, n.precision), s = An(t, n), i = fn(...s).filter((r) => r >= -n.precision && r <= 1 + n.precision);
+  return Ht(i, e).map((r) => n.paramPoint(r)).filter((r) => t.isOnSegment(r));
 }
 function E(t, { firstPoint: n, lastPoint: e }, s = 1e-9) {
   const i = k(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] : un(i, k(t, n)) / cn(i);
+  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] : hn(i, k(t, n)) / pn(i);
 }
 class ct {
   constructor(n, e, s, i) {
@@ -246,9 +246,9 @@ class ct {
     return this.positiveThickness - this.negativeThickness;
   }
 }
-const Cn = 3 / 4, Mn = 4 / 9;
-function In(t) {
-  const n = E(t.firstControlPoint, t), e = E(t.lastControlPoint, t), s = n * e > 0 ? Cn : Mn;
+const En = 3 / 4, Fn = 4 / 9;
+function vn(t) {
+  const n = E(t.firstControlPoint, t), e = E(t.lastControlPoint, t), s = n * e > 0 ? En : Fn;
   return new ct(
     t.firstPoint,
     t.lastPoint,
@@ -256,7 +256,7 @@ function In(t) {
     s * Math.max(0, n, e)
   );
 }
-function An(t) {
+function Bn(t) {
   const n = E(t.controlPoint, t);
   return new ct(
     t.firstPoint,
@@ -265,32 +265,32 @@ function An(t) {
     Math.max(0, n / 2)
   );
 }
-function En(t) {
-  if (t instanceof A)
-    return In(t);
-  if (t instanceof I)
-    return An(t);
+function kn(t) {
+  if (A.isInstance(t))
+    return vn(t);
+  if (M.isInstance(t))
+    return Bn(t);
   throw new Error("Not implemented");
 }
-function Fn(t) {
-  const n = t.paramPoint(0.5), e = Lt(k(n, t.firstPoint)), s = z(n, e), i = {
+function On(t) {
+  const n = t.paramPoint(0.5), e = Rt(k(n, t.firstPoint)), s = z(n, e), i = {
     firstPoint: n,
     lastPoint: s
-  }, o = [
+  }, r = [
     E(t.firstPoint, i),
     E(t.lastPoint, i)
   ];
-  return t instanceof A ? o.push(
+  return A.isInstance(t) ? r.push(
     E(t.firstControlPoint, i),
     E(t.lastControlPoint, i)
-  ) : t instanceof I && o.push(E(t.controlPoint, i)), new ct(
+  ) : M.isInstance(t) && r.push(E(t.controlPoint, i)), new ct(
     n,
     s,
-    Math.min(...o),
-    Math.max(...o)
+    Math.min(...r),
+    Math.max(...r)
   );
 }
-function St(t, n) {
+function xt(t, n) {
   const e = [];
   for (let s = 1; s < t.length; s++) {
     const i = t[s];
@@ -298,10 +298,10 @@ function St(t, n) {
       e.push(i[0]);
       continue;
     }
-    const o = t[s - 1], l = n - o[1], r = n - i[1];
-    if (l * r < 0) {
+    const r = t[s - 1], l = n - r[1], o = n - i[1];
+    if (l * o < 0) {
       e.push(
-        o[0] + (n - o[1]) * (i[0] - o[0]) / (i[1] - o[1])
+        r[0] + (n - r[1]) * (i[0] - r[0]) / (i[1] - r[1])
       );
       continue;
     }
@@ -319,29 +319,29 @@ class Y {
     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 A)
-    return new kn([
+function _n(t, n) {
+  if (A.isInstance(t))
+    return new Ln([
       E(t.firstPoint, n),
       E(t.firstControlPoint, n),
       E(t.lastControlPoint, n),
       E(t.lastPoint, n)
     ]);
-  if (t instanceof I)
-    return new Bn([
+  if (M.isInstance(t))
+    return new Tn([
       E(t.firstPoint, n),
       E(t.controlPoint, n),
       E(t.lastPoint, n)
     ]);
   throw new Error("Not implemented");
 }
-class Bn {
+class Tn {
   constructor(n) {
-    C(this, "topHull", []);
-    C(this, "bottomHull", []);
+    b(this, "topHull", []);
+    b(this, "bottomHull", []);
     this.distances = n;
-    const [e, s, i] = n, o = [0, e], l = [1 / 2, s], r = [1, i], u = i - e, a = e;
-    s - (u * (1 / 2) + a) > 0 ? (this.topHull = [o, l, r], this.bottomHull = [o, r]) : (this.topHull = [o, r], this.bottomHull = [o, l, r]);
+    const [e, s, i] = n, r = [0, e], l = [1 / 2, s], o = [1, i], u = i - e, a = e;
+    s - (u * (1 / 2) + a) > 0 ? (this.topHull = [r, l, o], this.bottomHull = [r, o]) : (this.topHull = [r, o], this.bottomHull = [r, l, o]);
   }
   get startDistance() {
     return this.distances[0];
@@ -350,18 +350,18 @@ class Bn {
     return this.distances[2];
   }
 }
-class kn {
+class Ln {
   constructor(n) {
-    C(this, "topHull", []);
-    C(this, "bottomHull", []);
+    b(this, "topHull", []);
+    b(this, "bottomHull", []);
     this.distances = n;
-    const [e, s, i, o] = n, l = [0, e], r = [1 / 3, s], u = [2 / 3, i], a = [1, o], f = o - e, c = e, h = s - (f * (1 / 3) + c), p = i - (f * (2 / 3) + c);
+    const [e, s, i, r] = n, l = [0, e], o = [1 / 3, s], u = [2 / 3, i], a = [1, r], f = r - e, c = e, h = s - (f * (1 / 3) + c), p = i - (f * (2 / 3) + c);
     let d = null, m = null;
     if (h * p < 0)
-      d = [l, r, a], m = [l, u, a];
+      d = [l, o, a], m = [l, u, a];
     else {
       const g = h / p;
-      g >= 2 ? (d = [l, r, a], m = [l, a]) : g <= 0.5 ? (d = [l, u, a], m = [l, a]) : (d = [l, r, u, a], m = [l, a]);
+      g >= 2 ? (d = [l, o, a], m = [l, a]) : g <= 0.5 ? (d = [l, u, a], m = [l, a]) : (d = [l, o, u, a], m = [l, a]);
     }
     h < 0 && ([d, m] = [m, d]), this.topHull = d, this.bottomHull = m;
   }
@@ -372,16 +372,16 @@ class kn {
     return this.distances[3];
   }
 }
-function yt(t, n) {
-  const e = vn(n, t), s = St(
+function St(t, n) {
+  const e = _n(n, t), s = xt(
     e.topHull,
     t.negativeThickness
-  ), i = St(
+  ), i = xt(
     e.bottomHull,
     t.positiveThickness
-  ), o = e.endDistance >= t.negativeThickness && e.endDistance <= t.positiveThickness;
+  ), r = e.endDistance >= t.negativeThickness && e.endDistance <= t.positiveThickness;
   if (!s.length && !i.length)
-    return o ? new Y("start", "end") : null;
+    return r ? new Y("start", "end") : null;
   if (s.length === 1 && i.length === 1)
     return new Y(s[0], i[0]);
   if (s.length === 2 && i.length === 2)
@@ -389,26 +389,26 @@ function yt(t, n) {
       "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(l[0], l[1]) : r ? new Y(l[0], "end") : new Y("start", l[0]);
 }
-function bt(t, n) {
-  const e = En(t), s = yt(e, n);
+function yt(t, n) {
+  const e = kn(t), s = St(e, n);
   if (!s)
     return null;
-  const i = Fn(t), o = yt(
+  const i = On(t), r = St(
     i,
     n
   );
-  return o ? s.size > o.size ? o.clipCurve(n) : s.clipCurve(n) : null;
+  return r ? s.size > r.size ? r.clipCurve(n) : s.clipCurve(n) : null;
 }
-const W = (t) => t instanceof I ? $(k(t.controlPoint, t.firstPoint)) + $(k(t.controlPoint, t.lastPoint)) : $(k(t.firstControlPoint, t.firstPoint)) + $(k(t.lastControlPoint, t.firstControlPoint)) + $(k(t.lastControlPoint, t.lastPoint));
+const W = (t) => M.isInstance(t) ? $(k(t.controlPoint, t.firstPoint)) + $(k(t.controlPoint, t.lastPoint)) : $(k(t.firstControlPoint, t.firstPoint)) + $(k(t.lastControlPoint, t.firstControlPoint)) + $(k(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(o), u = W(l);
+  let r = t, l = n, o = W(r), u = W(l);
   for (let a = 0; a < s; a++) {
-    const f = r > i ? bt(l, o) : o;
+    const f = o > i ? yt(l, r) : r;
     if (!f) return [];
-    const c = W(f), h = u > i ? bt(f, l) : l;
+    const c = W(f), h = u > i ? yt(f, l) : l;
     if (!h) return [];
     const p = W(h);
     if (c <= i && p <= i)
@@ -419,12 +419,12 @@ function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
       return [f.firstPoint];
     if (P(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) {
+    if (c > 0.8 * o && p > 0.8 * u)
+      if (c / o > p / u) {
         const [d, m] = f.splitAtParameters([
           0.5
         ]);
-        return U(
+        return j(
           [
             ...D(d, h, e, {
               maxIterations: s - a
@@ -439,7 +439,7 @@ function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
         const [d, m] = h.splitAtParameters([
           0.5
         ]);
-        return U(
+        return j(
           [
             ...D(f, d, e, {
               maxIterations: s - a
@@ -451,19 +451,19 @@ function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
           e
         );
       }
-    o = f, l = h, r = c, u = p;
+    r = f, l = h, o = c, u = p;
   }
   throw new Error("Bézier clip: Maximum number of iterations reached");
 }
-function On(t, n) {
+function qn(t, n) {
   const e = [];
   if ([
     [t.firstPoint, n],
     [t.lastPoint, n],
     [n.firstPoint, t],
     [n.lastPoint, t]
-  ].forEach(([i, o]) => {
-    o.isOnSegment(i) && e.push(i);
+  ].forEach(([i, r]) => {
+    r.isOnSegment(i) && e.push(i);
   }), e.length < 2)
     return null;
   if (e.length === 2)
@@ -473,24 +473,24 @@ function On(t, n) {
   if (e.length === 4)
     return [t];
 }
-function _n(t, n, e = !1) {
+function zn(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
   if (e) {
-    const i = On(t, n);
+    const i = qn(t, n);
     if (i)
       return i;
   }
   return D(t, n, s);
 }
-function Tn(t, n) {
+function Dn(t, n) {
   const e = [];
   if ([
     [t.firstPoint, n],
     [t.lastPoint, n],
     [n.firstPoint, t],
     [n.lastPoint, t]
-  ].forEach(([i, o]) => {
-    o.isOnSegment(i) && e.push(i);
+  ].forEach(([i, r]) => {
+    r.isOnSegment(i) && e.push(i);
   }), e.length < 2)
     return null;
   if (e.length === 2)
@@ -500,18 +500,18 @@ function Tn(t, n) {
   if (e.length === 4)
     return [t];
 }
-function Ln(t, n, e = !1) {
+function Rn(t, n, e = !1) {
   const s = Math.max(t.precision, n.precision);
   if (e) {
-    const i = Tn(t, n);
+    const i = Dn(t, n);
     if (i)
       return i;
   }
   return D(t, n, s);
 }
-function de(t, n, e) {
-  if (t instanceof b && n instanceof b) {
-    const s = zt(
+function Ie(t, n, e) {
+  if (y.isInstance(t) && y.isInstance(n)) {
+    const s = Vt(
       t,
       n,
       !1,
@@ -519,42 +519,42 @@ function de(t, n, e) {
     );
     return s === null ? [] : [s];
   }
-  if (t instanceof b && n instanceof S)
+  if (y.isInstance(t) && x.isInstance(n))
     return K(t, n, e);
-  if (t instanceof S && n instanceof b)
+  if (x.isInstance(t) && y.isInstance(n))
     return K(n, t, e);
-  if (t instanceof S && n instanceof S)
-    return Dt(t, n, !1, e);
+  if (x.isInstance(t) && x.isInstance(n))
+    return jt(t, n, !1, e);
   throw new Error("Not implemented");
 }
 function Z(t, n, e) {
-  if (t instanceof b && n instanceof b) {
-    const s = zt(
+  if (y.isInstance(t) && y.isInstance(n)) {
+    const s = Vt(
       t,
       n,
       !0,
       e
     );
-    return s === null ? { intersections: [], overlaps: [], count: 0 } : s instanceof b ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
+    return s === null ? { intersections: [], overlaps: [], count: 0 } : y.isInstance(s) ? { intersections: [], overlaps: [s], count: 1 } : { intersections: [s], overlaps: [], count: 1 };
   }
   if (!t.boundingBox.overlaps(n.boundingBox))
     return { intersections: [], overlaps: [], count: 0 };
-  if (t instanceof b && n instanceof S) {
+  if (y.isInstance(t) && x.isInstance(n)) {
     const s = K(t, n, e);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof S && n instanceof b) {
+  if (x.isInstance(t) && y.isInstance(n)) {
     const s = K(n, t, e);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof S && n instanceof S) {
-    const s = Dt(
+  if (x.isInstance(t) && x.isInstance(n)) {
+    const s = jt(
       t,
       n,
       !0,
       e
     );
-    return s.length ? s[0] instanceof S ? {
+    return s.length ? x.isInstance(s[0]) ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -564,7 +564,7 @@ function Z(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof b && n instanceof M) {
+  if (y.isInstance(t) && C.isInstance(n)) {
     const s = st(
       t,
       n,
@@ -572,7 +572,7 @@ function Z(t, n, e) {
     );
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof b && t instanceof M) {
+  if (y.isInstance(n) && C.isInstance(t)) {
     const s = st(
       n,
       t,
@@ -580,21 +580,21 @@ function Z(t, n, e) {
     );
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof S && n instanceof M) {
+  if (x.isInstance(t) && C.isInstance(n)) {
     const s = gt(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof S && t instanceof M) {
+  if (x.isInstance(n) && C.isInstance(t)) {
     const s = gt(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof M && n instanceof M) {
-    const s = xn(
+  if (C.isInstance(t) && C.isInstance(n)) {
+    const s = bn(
       t,
       n,
       !0
     );
-    return s.length ? s[0] instanceof M ? {
+    return s.length ? C.isInstance(s[0]) ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -604,36 +604,36 @@ function Z(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof b && (n instanceof A || n instanceof I)) {
+  if (y.isInstance(t) && (A.isInstance(n) || M.isInstance(n))) {
     const s = Pt(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (n instanceof b && (t instanceof A || t instanceof I)) {
+  if (y.isInstance(n) && (A.isInstance(t) || M.isInstance(t))) {
     const s = Pt(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((t instanceof S || t instanceof M) && n instanceof I) {
-    const s = xt(t, n);
+  if ((x.isInstance(t) || C.isInstance(t)) && M.isInstance(n)) {
+    const s = wt(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((n instanceof S || n instanceof M) && t instanceof I) {
-    const s = xt(n, t);
+  if ((x.isInstance(n) || C.isInstance(n)) && M.isInstance(t)) {
+    const s = wt(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((t instanceof S || t instanceof M) && n instanceof A) {
-    const s = wt(t, n);
+  if ((x.isInstance(t) || C.isInstance(t)) && A.isInstance(n)) {
+    const s = It(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if ((n instanceof S || n instanceof M) && t instanceof A) {
-    const s = wt(n, t);
+  if ((x.isInstance(n) || C.isInstance(n)) && A.isInstance(t)) {
+    const s = It(n, t);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof I && n instanceof I) {
-    const s = Ln(
+  if (M.isInstance(t) && M.isInstance(n)) {
+    const s = Rn(
       t,
       n
     );
-    return s.length ? s[0] instanceof I ? {
+    return s.length ? M.isInstance(s[0]) ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -643,16 +643,16 @@ function Z(t, n, e) {
       count: s.length
     } : { intersections: [], overlaps: [], count: 0 };
   }
-  if (t instanceof I && n instanceof A || n instanceof I && t instanceof A) {
+  if (M.isInstance(t) && A.isInstance(n) || M.isInstance(n) && A.isInstance(t)) {
     const s = D(t, n);
     return { intersections: s, overlaps: [], count: s.length };
   }
-  if (t instanceof A && n instanceof A) {
-    const s = _n(
+  if (A.isInstance(t) && A.isInstance(n)) {
+    const s = zn(
       t,
       n
     );
-    return s.length ? s[0] instanceof A ? {
+    return s.length ? A.isInstance(s[0]) ? {
       intersections: [],
       overlaps: s,
       count: s.length
@@ -664,7 +664,7 @@ function Z(t, n, e) {
   }
   throw new Error("Not implemented");
 }
-function Nt(t) {
+function $t(t) {
   const n = [];
   for (let e = 0; e < t; e++)
     for (let s = 0; s <= e; s++)
@@ -672,15 +672,15 @@ function Nt(t) {
   return n;
 }
 function* it(t) {
-  for (const [n, e] of Nt(t.length))
+  for (const [n, e] of $t(t.length))
     n !== e && (yield [t[n], t[e]]);
 }
-class Ut extends ut {
+class Yt extends ut {
   constructor(e, { ignoreChecks: s = !1 } = {}) {
     super();
-    C(this, "segments");
-    C(this, "_boundingBox", null);
-    s || jt(e), this.segments = e;
+    b(this, "segments");
+    b(this, "_boundingBox", null);
+    s || Xt(e), this.segments = e;
   }
   get repr() {
     return this.segments.map((e) => e.repr).join(`
@@ -725,36 +725,36 @@ class Ut extends ut {
     return this.repr;
   }
 }
-function qn(t, n = "Stroke") {
-  Nt(t.length).forEach(
+function Nn(t, n = "Stroke") {
+  $t(t.length).forEach(
     ([e, s]) => {
       if (e === s) return;
-      const i = t[e], o = t[s], l = Z(i, o), r = Math.max(i.precision, o.precision);
+      const i = t[e], r = t[s], l = Z(i, r), o = Math.max(i.precision, r.precision);
       if (l.count !== 0) {
         if (l.count === 1 && !l.overlaps.length) {
           const u = e - s, a = l.intersections[0];
-          if (u === 1 && P(i.firstPoint, a, r) || u === -1 && P(i.lastPoint, a, r) || u === t.length - 1 && P(i.lastPoint, a, r) && P(o.firstPoint, a, r) || -u === t.length - 1 && P(i.firstPoint, a, r) && P(o.lastPoint, a, r))
+          if (u === 1 && P(i.firstPoint, a, o) || u === -1 && P(i.lastPoint, a, o) || u === t.length - 1 && P(i.lastPoint, a, o) && P(r.firstPoint, a, o) || -u === t.length - 1 && P(i.firstPoint, a, o) && P(r.lastPoint, a, o))
             return;
         }
         if (!(l.count === 2 && t.length === 2 && (P(
           i.firstPoint,
           l.intersections[0],
-          r
+          o
         ) && P(
           i.lastPoint,
           l.intersections[1],
-          r
+          o
         ) || P(
           i.firstPoint,
           l.intersections[1],
-          r
+          o
         ) && P(
           i.lastPoint,
           l.intersections[0],
-          r
+          o
         ))))
           throw new Error(
-            `${n} segments must not intersect, but segments ${i.info} and ${o.info} do at ${JSON.stringify(
+            `${n} segments must not intersect, but segments ${i.info} and ${r.info} do at ${JSON.stringify(
               l.intersections
             )}`
           );
@@ -762,26 +762,26 @@ function qn(t, n = "Stroke") {
     }
   );
 }
-function jt(t, n = "Stroke") {
+function Xt(t, n = "Stroke") {
   if (t.length === 0)
     throw new Error(`${n} must have at least one segment`);
-  N([t.slice(0, -1), t.slice(1)]).forEach(
+  V([t.slice(0, -1), t.slice(1)]).forEach(
     ([e, s]) => {
       if (!P(e.lastPoint, s.firstPoint))
         throw new Error(
           `${n} segments must be connected, but ${e.info} and ${s.info} are not`
         );
     }
-  ), qn(t, n);
+  ), Nn(t, n);
 }
-function Ct(t, n) {
-  return !!(t instanceof b && n instanceof b && an(t.V, n.V) || t instanceof S && n instanceof S && P(t.center, n.center) && t.radius - n.radius < t.precision);
+function bt(t, n) {
+  return !!(y.isInstance(t) && y.isInstance(n) && dn(t.V, n.V) || x.isInstance(t) && x.isInstance(n) && P(t.center, n.center) && t.radius - n.radius < t.precision);
 }
-function Mt(t, n) {
-  if (t instanceof b && n instanceof b)
-    return new b(t.firstPoint, n.lastPoint);
-  if (t instanceof S && n instanceof S)
-    return new S(
+function Ct(t, n) {
+  if (y.isInstance(t) && y.isInstance(n))
+    return new y(t.firstPoint, n.lastPoint);
+  if (x.isInstance(t) && x.isInstance(n))
+    return new x(
       t.firstPoint,
       n.lastPoint,
       t.center,
@@ -789,7 +789,7 @@ function Mt(t, n) {
     );
   throw new Error("Not implemented");
 }
-function Ht(t) {
+function Gt(t) {
   let n = !1;
   const e = [];
   for (const s of t.segments) {
@@ -798,22 +798,27 @@ function Ht(t) {
       continue;
     }
     const i = e[e.length - 1];
-    Ct(i, s) ? (n = !0, e.pop(), e.push(Mt(i, s))) : e.push(s);
+    bt(i, s) ? (n = !0, e.pop(), e.push(Ct(i, s))) : e.push(s);
   }
-  if (P(t.firstPoint, t.lastPoint) && Ct(
+  if (P(t.firstPoint, t.lastPoint) && bt(
     e[0],
     e[e.length - 1]
   )) {
     n = !0;
     const s = e.pop();
-    e[0] = Mt(s, e[0]);
+    e[0] = Ct(s, e[0]);
   }
   return n ? e : null;
 }
-class B extends Ut {
-  constructor() {
-    super(...arguments);
-    C(this, "strokeType", "STRAND");
+const Mt = Symbol.for("pantograph:Strand");
+class B extends Yt {
+  constructor(e, { ignoreChecks: s = !1 } = {}) {
+    super(e, { ignoreChecks: s });
+    b(this, "strokeType", "STRAND");
+    Object.defineProperty(this, Mt, { value: !0 });
+  }
+  static isInstance(e) {
+    return !!e && e[Mt] === !0;
   }
   reverse() {
     const e = this.segments.map((s) => s.reverse());
@@ -831,7 +836,7 @@ class B extends Ut {
     return new B([...this.segments, ...e.segments]);
   }
   simplify() {
-    const e = Ht(this);
+    const e = Gt(this);
     return e ? new B(e, { ignoreChecks: !0 }) : this;
   }
   transform(e) {
@@ -841,8 +846,8 @@ class B extends Ut {
     );
   }
 }
-const zn = (t, n) => {
-  const e = fn(n, {
+const Vn = (t, n) => {
+  const e = mn(n, {
     V: [1, 0],
     firstPoint: t,
     precision: n.precision
@@ -852,15 +857,15 @@ const zn = (t, n) => {
   const { intersectionParam1: s, intersectionParam2: i } = e;
   if (!n.isValidParameter(s) || i <= -n.precision) return 0;
   if (Math.abs(s) < n.precision || Math.abs(s - 1) < n.precision) {
-    const [, o] = n.midPoint;
-    return t[1] - o < 0 ? 1 : 0;
+    const [, r] = n.midPoint;
+    return t[1] - r < 0 ? 1 : 0;
   }
   return 1;
 };
 class at {
   constructor(n) {
-    C(this, "_count", 0);
-    C(this, "segment");
+    b(this, "_count", 0);
+    b(this, "segment");
     this.segment = n;
   }
   update(n, e = !1) {
@@ -870,24 +875,24 @@ class at {
     return this._count;
   }
 }
-const Dn = (t, n) => {
+const jn = (t, n) => {
   const e = n.precision, s = Math.abs(t[1] - n.center[1]);
   if (s > n.radius + e) return 0;
-  const i = hn(t, n.center), o = n.radius * n.radius, l = e * e;
-  if (Math.abs(i - o) < l && n.isOnSegment(t))
+  const i = gn(t, n.center), r = n.radius * n.radius, l = e * e;
+  if (Math.abs(i - r) < l && n.isOnSegment(t))
     return 0;
-  const r = i - o > l;
-  if (r && n.center[0] < t[0]) return 0;
+  const o = i - r > l;
+  if (o && n.center[0] < t[0]) return 0;
   const u = Math.sqrt(
     n.radius * n.radius - s * s
   ), a = new at(n);
-  return a.update([n.center[0] + u, t[1]]), r && a.update([n.center[0] - u, t[1]]), a.count;
-}, Rn = (t, n) => {
-  const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new b(t, [e, t[1]]), i = new at(n);
-  return st(s, n).forEach((o) => {
-    i.update(o, !0);
+  return a.update([n.center[0] + u, t[1]]), o && a.update([n.center[0] - u, t[1]]), a.count;
+}, Un = (t, n) => {
+  const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new y(t, [e, t[1]]), i = new at(n);
+  return st(s, n).forEach((r) => {
+    i.update(r, !0);
   }), i.count;
-}, Vn = (t, n) => {
+}, Hn = (t, n) => {
   const e = new at(n);
   return n.paramsAtY(t[1]).map((s) => {
     try {
@@ -902,30 +907,34 @@ const Dn = (t, n) => {
     e.update(s, !0);
   }), e.count;
 };
-function Nn(t, n) {
-  if (n instanceof b)
-    return zn(t, n);
-  if (n instanceof S)
-    return Dn(t, n);
-  if (n instanceof M)
-    return Rn(t, n);
-  if (n instanceof A || n instanceof I)
+function $n(t, n) {
+  if (y.isInstance(n))
     return Vn(t, n);
+  if (x.isInstance(n))
+    return jn(t, n);
+  if (C.isInstance(n))
+    return Un(t, n);
+  if (A.isInstance(n) || M.isInstance(n))
+    return Hn(t, n);
   throw new Error("Not implemented");
 }
-class _ extends Ut {
+const At = Symbol.for("pantograph:Loop");
+class _ extends Yt {
   constructor(e, { ignoreChecks: s = !1 } = {}) {
     super(e, { ignoreChecks: !0 });
-    C(this, "strokeType", "LOOP");
-    C(this, "_clockwise", null);
-    s || Un(e);
+    b(this, "strokeType", "LOOP");
+    b(this, "_clockwise", null);
+    Object.defineProperty(this, At, { value: !0 }), s || Yn(e);
+  }
+  static isInstance(e) {
+    return !!e && e[At] === !0;
   }
   get clockwise() {
     if (this._clockwise === null) {
-      const e = this.segments.flatMap((i) => i instanceof b ? [i.firstPoint] : [i.firstPoint, i.paramPoint(0.5)]), s = e.map((i, o) => {
-        const l = e[(o + 1) % e.length];
+      const e = this.segments.flatMap((i) => y.isInstance(i) ? [i.firstPoint] : [i.firstPoint, i.paramPoint(0.5)]), s = e.map((i, r) => {
+        const l = e[(r + 1) % e.length];
         return (l[0] - i[0]) * (l[1] + i[1]);
-      }).reduce((i, o) => i + o, 0);
+      }).reduce((i, r) => i + r, 0);
       this._clockwise = s > 0;
     }
     return this._clockwise;
@@ -947,35 +956,35 @@ class _ extends Ut {
     );
   }
   contains(e, { strokeIsInside: s = !1 } = {}) {
-    return this.onStroke(e) ? s : this.boundingBox.contains(e) ? this.segments.reduce((o, l) => o + Nn(e, l), 0) % 2 === 1 : !1;
+    return this.onStroke(e) ? s : this.boundingBox.contains(e) ? this.segments.reduce((r, l) => r + $n(e, l), 0) % 2 === 1 : !1;
   }
   simplify() {
-    const e = Ht(this);
+    const e = Gt(this);
     return e ? new _(e, { ignoreChecks: !0 }) : this;
   }
 }
-function Un(t) {
-  if (jt(t, "Loop"), !P(t[0].firstPoint, t[t.length - 1].lastPoint))
+function Yn(t) {
+  if (Xt(t, "Loop"), !P(t[0].firstPoint, t[t.length - 1].lastPoint))
     throw new Error("Loop segment must be closed");
 }
-const jn = [
-  b,
-  S,
+const Xn = [
+  y,
+  x,
+  C,
   M,
-  I,
   A
 ];
-function Hn(t) {
-  return jn.some((n) => t instanceof n);
+function Gn(t) {
+  return Xn.some((n) => n.isInstance(t));
 }
-function $t(t) {
-  if (t instanceof b)
+function Qt(t) {
+  if (y.isInstance(t))
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
       lastPoint: t.lastPoint
     };
-  if (t instanceof S)
+  if (x.isInstance(t))
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -983,7 +992,7 @@ function $t(t) {
       center: t.center,
       clockwise: t.clockwise
     };
-  if (t instanceof M)
+  if (C.isInstance(t))
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -994,14 +1003,14 @@ function $t(t) {
       minorRadius: t.minorRadius,
       tiltAngle: t.tiltAngle
     };
-  if (t instanceof I)
+  if (M.isInstance(t))
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
       lastPoint: t.lastPoint,
       controlPoint: t.controlPoint
     };
-  if (t instanceof A)
+  if (A.isInstance(t))
     return {
       type: t.segmentType,
       firstPoint: t.firstPoint,
@@ -1011,37 +1020,37 @@ function $t(t) {
     };
   throw new Error("Unknown segment type");
 }
-function ot(t) {
+function rt(t) {
   return {
     type: "LOOP",
-    segments: t.segments.map($t)
+    segments: t.segments.map(Qt)
   };
 }
-function Yt(t) {
+function Wt(t) {
   return {
     type: "FIGURE",
-    contour: ot(t.contour),
-    holes: t.holes.map(ot)
+    contour: rt(t.contour),
+    holes: t.holes.map(rt)
   };
 }
-function $n(t) {
+function Qn(t) {
   return {
     type: "DIAGRAM",
-    figures: t.figures.map(Yt)
+    figures: t.figures.map(Wt)
   };
 }
-function It(t) {
-  if (t instanceof O)
-    return $n(t);
-  if (t instanceof v)
-    return Yt(t);
-  if (t instanceof _)
-    return ot(t);
-  if (Hn(t))
-    return $t(t);
+function Et(t) {
+  if (O.isInstance(t))
+    return Qn(t);
+  if (v.isInstance(t))
+    return Wt(t);
+  if (_.isInstance(t))
+    return rt(t);
+  if (Gn(t))
+    return Qt(t);
   throw new Error("Unknown shape type");
 }
-class Yn {
+class Wn {
   constructor() {
     this.ids = [], this.values = [], this.length = 0;
   }
@@ -1051,9 +1060,9 @@ class Yn {
   push(n, e) {
     let s = this.length++;
     for (; s > 0; ) {
-      const i = s - 1 >> 1, o = this.values[i];
-      if (e >= o) break;
-      this.ids[s] = this.ids[i], this.values[s] = o, s = i;
+      const i = s - 1 >> 1, r = this.values[i];
+      if (e >= r) break;
+      this.ids[s] = this.ids[i], this.values[s] = r, s = i;
     }
     this.ids[s] = n, this.values[s] = e;
   }
@@ -1062,16 +1071,16 @@ class Yn {
     const n = this.ids[0];
     if (this.length--, this.length > 0) {
       const e = this.ids[0] = this.ids[this.length], s = this.values[0] = this.values[this.length], i = this.length >> 1;
-      let o = 0;
-      for (; o < i; ) {
-        let l = (o << 1) + 1;
-        const r = l + 1;
+      let r = 0;
+      for (; r < i; ) {
+        let l = (r << 1) + 1;
+        const o = l + 1;
         let u = this.ids[l], a = this.values[l];
-        const f = this.values[r];
-        if (r < this.length && f < a && (l = r, u = this.ids[r], a = f), a >= s) break;
-        this.ids[o] = u, this.values[o] = a, o = l;
+        const f = this.values[o];
+        if (o < this.length && f < a && (l = o, u = this.ids[o], a = f), a >= s) break;
+        this.ids[r] = u, this.values[r] = a, r = l;
       }
-      this.ids[o] = e, this.values[o] = s;
+      this.ids[r] = e, this.values[r] = s;
     }
     return n;
   }
@@ -1087,7 +1096,7 @@ class Yn {
     this.ids.length = this.values.length = this.length;
   }
 }
-const At = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], et = 3;
+const Ft = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], et = 3;
 class ft {
   /**
    * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
@@ -1103,14 +1112,14 @@ class ft {
     const [s, i] = new Uint8Array(n, e + 0, 2);
     if (s !== 251)
       throw new Error("Data does not appear to be in a Flatbush format.");
-    const o = i >> 4;
-    if (o !== et)
-      throw new Error(`Got v${o} data when expected v${et}.`);
-    const l = At[i & 15];
+    const r = i >> 4;
+    if (r !== et)
+      throw new Error(`Got v${r} data when expected v${et}.`);
+    const l = Ft[i & 15];
     if (!l)
       throw new Error("Unrecognized array type.");
-    const [r] = new Uint16Array(n, e + 2, 1), [u] = new Uint32Array(n, e + 4, 1);
-    return new ft(u, r, l, void 0, n, e);
+    const [o] = new Uint16Array(n, e + 2, 1), [u] = new Uint32Array(n, e + 4, 1);
+    return new ft(u, o, l, void 0, n, e);
   }
   /**
    * Create a Flatbush index that will hold a given number of items.
@@ -1121,20 +1130,20 @@ class ft {
    * @param {ArrayBuffer | SharedArrayBuffer} [data] (Only used internally)
    * @param {number} [byteOffset=0] (Only used internally)
    */
-  constructor(n, e = 16, s = Float64Array, i = ArrayBuffer, o, l = 0) {
+  constructor(n, e = 16, s = Float64Array, i = ArrayBuffer, r, l = 0) {
     if (n === void 0) throw new Error("Missing required argument: numItems.");
     if (isNaN(n) || n <= 0) throw new Error(`Unexpected numItems value: ${n}.`);
     this.numItems = +n, this.nodeSize = Math.min(Math.max(+e, 2), 65535), this.byteOffset = l;
-    let r = n, u = r;
-    this._levelBounds = [r * 4];
+    let o = n, u = o;
+    this._levelBounds = [o * 4];
     do
-      r = Math.ceil(r / this.nodeSize), u += r, this._levelBounds.push(u * 4);
-    while (r !== 1);
+      o = Math.ceil(o / this.nodeSize), u += o, this._levelBounds.push(u * 4);
+    while (o !== 1);
     this.ArrayType = s, this.IndexArrayType = u < 16384 ? Uint16Array : Uint32Array;
-    const a = At.indexOf(this.ArrayType), f = u * 4 * this.ArrayType.BYTES_PER_ELEMENT;
+    const a = Ft.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 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new Yn();
+    r && r.byteLength !== void 0 && !r.buffer ? (this.data = r, 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 << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new Wn();
   }
   /**
    * Add a given rectangle to the index.
@@ -1145,8 +1154,8 @@ class ft {
    * @returns {number} A zero-based, incremental number that represents the newly added rectangle.
    */
   add(n, e, s = n, i = e) {
-    const o = this._pos >> 2, l = this._boxes;
-    return this._indices[o] = o, l[this._pos++] = n, l[this._pos++] = e, l[this._pos++] = s, l[this._pos++] = i, n < this.minX && (this.minX = n), e < this.minY && (this.minY = e), s > this.maxX && (this.maxX = s), i > this.maxY && (this.maxY = i), o;
+    const r = this._pos >> 2, l = this._boxes;
+    return this._indices[r] = r, l[this._pos++] = n, l[this._pos++] = e, l[this._pos++] = s, l[this._pos++] = i, n < this.minX && (this.minX = n), e < this.minY && (this.minY = e), s > this.maxX && (this.maxX = s), i > this.maxY && (this.maxY = i), r;
   }
   /** Perform indexing of the added rectangles. */
   finish() {
@@ -1157,19 +1166,19 @@ class ft {
       n[this._pos++] = this.minX, n[this._pos++] = this.minY, n[this._pos++] = this.maxX, n[this._pos++] = this.maxY;
       return;
     }
-    const e = this.maxX - this.minX || 1, s = this.maxY - this.minY || 1, i = new Uint32Array(this.numItems), o = 65535;
-    for (let l = 0, r = 0; l < this.numItems; l++) {
-      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);
+    const e = this.maxX - this.minX || 1, s = this.maxY - this.minY || 1, i = new Uint32Array(this.numItems), r = 65535;
+    for (let l = 0, o = 0; l < this.numItems; l++) {
+      const u = n[o++], a = n[o++], f = n[o++], c = n[o++], h = Math.floor(r * ((u + f) / 2 - this.minX) / e), p = Math.floor(r * ((a + c) / 2 - this.minY) / s);
+      i[l] = Kn(h, p);
     }
-    rt(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
-    for (let l = 0, r = 0; l < this._levelBounds.length - 1; l++) {
+    ot(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
+    for (let l = 0, o = 0; l < this._levelBounds.length - 1; l++) {
       const u = this._levelBounds[l];
-      for (; r < u; ) {
-        const a = r;
-        let f = n[r++], c = n[r++], h = n[r++], p = n[r++];
-        for (let d = 1; d < this.nodeSize && r < u; d++)
-          f = Math.min(f, n[r++]), c = Math.min(c, n[r++]), h = Math.max(h, n[r++]), p = Math.max(p, n[r++]);
+      for (; o < u; ) {
+        const a = o;
+        let f = n[o++], c = n[o++], h = n[o++], p = n[o++];
+        for (let d = 1; d < this.nodeSize && o < u; d++)
+          f = Math.min(f, n[o++]), c = Math.min(c, n[o++]), h = Math.max(h, n[o++]), p = Math.max(p, n[o++]);
         this._indices[this._pos >> 2] = a, n[this._pos++] = f, n[this._pos++] = c, n[this._pos++] = h, n[this._pos++] = p;
       }
     }
@@ -1183,19 +1192,19 @@ class ft {
    * @param {(index: number) => boolean} [filterFn] An optional function for filtering the results.
    * @returns {number[]} An array of indices of items intersecting or touching the given bounding box.
    */
-  search(n, e, s, i, o) {
+  search(n, e, s, i, r) {
     if (this._pos !== this._boxes.length)
       throw new Error("Data not yet indexed - call index.finish().");
     let l = this._boxes.length - 4;
-    const r = [], u = [];
+    const o = [], u = [];
     for (; l !== void 0; ) {
-      const a = Math.min(l + this.nodeSize * 4, Ft(l, this._levelBounds));
+      const a = Math.min(l + this.nodeSize * 4, Bt(l, this._levelBounds));
       for (let f = l; f < a; f += 4) {
         if (s < this._boxes[f] || i < this._boxes[f + 1] || n > this._boxes[f + 2] || e > this._boxes[f + 3]) continue;
         const c = this._indices[f >> 2] | 0;
-        l >= this.numItems * 4 ? r.push(c) : (o === void 0 || o(c)) && u.push(c);
+        l >= this.numItems * 4 ? o.push(c) : (r === void 0 || r(c)) && u.push(c);
       }
-      l = r.pop();
+      l = o.pop();
     }
     return u;
   }
@@ -1208,28 +1217,28 @@ class ft {
    * @param {(index: number) => boolean} [filterFn] An optional function for filtering the results.
    * @returns {number[]} An array of indices of items found.
    */
-  neighbors(n, e, s = 1 / 0, i = 1 / 0, o) {
+  neighbors(n, e, s = 1 / 0, i = 1 / 0, r) {
     if (this._pos !== this._boxes.length)
       throw new Error("Data not yet indexed - call index.finish().");
     let l = this._boxes.length - 4;
-    const r = this._queue, u = [], a = i * i;
+    const o = this._queue, u = [], a = i * i;
     t: for (; l !== void 0; ) {
-      const f = Math.min(l + this.nodeSize * 4, Ft(l, this._levelBounds));
+      const f = Math.min(l + this.nodeSize * 4, Bt(l, this._levelBounds));
       for (let c = l; c < f; c += 4) {
-        const h = this._indices[c >> 2] | 0, p = Et(n, this._boxes[c], this._boxes[c + 2]), d = Et(e, this._boxes[c + 1], this._boxes[c + 3]), m = p * p + d * d;
-        m > a || (l >= this.numItems * 4 ? r.push(h << 1, m) : (o === void 0 || o(h)) && r.push((h << 1) + 1, m));
+        const h = this._indices[c >> 2] | 0, p = vt(n, this._boxes[c], this._boxes[c + 2]), d = vt(e, this._boxes[c + 1], this._boxes[c + 3]), m = p * p + d * d;
+        m > a || (l >= this.numItems * 4 ? o.push(h << 1, m) : (r === void 0 || r(h)) && o.push((h << 1) + 1, m));
       }
-      for (; r.length && r.peek() & 1; )
-        if (r.peekValue() > a || (u.push(r.pop() >> 1), u.length === s)) break t;
-      l = r.length ? r.pop() >> 1 : void 0;
+      for (; o.length && o.peek() & 1; )
+        if (o.peekValue() > a || (u.push(o.pop() >> 1), u.length === s)) break t;
+      l = o.length ? o.pop() >> 1 : void 0;
     }
-    return r.clear(), u;
+    return o.clear(), u;
   }
 }
-function Et(t, n, e) {
+function vt(t, n, e) {
   return t < n ? n - t : t <= e ? 0 : t - e;
 }
-function Ft(t, n) {
+function Bt(t, n) {
   let e = 0, s = n.length - 1;
   for (; e < s; ) {
     const i = e + s >> 1;
@@ -1237,79 +1246,83 @@ function Ft(t, n) {
   }
   return n[e];
 }
-function rt(t, n, e, s, i, o) {
-  if (Math.floor(s / o) >= Math.floor(i / o)) return;
+function ot(t, n, e, s, i, r) {
+  if (Math.floor(s / r) >= Math.floor(i / r)) return;
   const l = t[s + i >> 1];
-  let r = s - 1, u = i + 1;
+  let o = s - 1, u = i + 1;
   for (; ; ) {
     do
-      r++;
-    while (t[r] < l);
+      o++;
+    while (t[o] < l);
     do
       u--;
     while (t[u] > l);
-    if (r >= u) break;
-    Xn(t, n, e, r, u);
+    if (o >= u) break;
+    Jn(t, n, e, o, u);
   }
-  rt(t, n, e, s, u, o), rt(t, n, e, u + 1, i, o);
+  ot(t, n, e, s, u, r), ot(t, n, e, u + 1, i, r);
 }
-function Xn(t, n, e, s, i) {
-  const o = t[s];
-  t[s] = t[i], t[i] = o;
-  const l = 4 * s, r = 4 * i, u = n[l], a = n[l + 1], f = n[l + 2], c = n[l + 3];
-  n[l] = n[r], n[l + 1] = n[r + 1], n[l + 2] = n[r + 2], n[l + 3] = n[r + 3], n[r] = u, n[r + 1] = a, n[r + 2] = f, n[r + 3] = c;
+function Jn(t, n, e, s, i) {
+  const r = t[s];
+  t[s] = t[i], t[i] = r;
+  const l = 4 * s, o = 4 * i, u = n[l], a = n[l + 1], f = n[l + 2], c = n[l + 3];
+  n[l] = n[o], n[l + 1] = n[o + 1], n[l + 2] = n[o + 2], n[l + 3] = n[o + 3], n[o] = u, n[o + 1] = a, n[o + 2] = f, n[o + 3] = c;
   const h = e[s];
   e[s] = e[i], e[i] = h;
 }
-function Gn(t, n) {
-  let e = t ^ n, s = 65535 ^ e, i = 65535 ^ (t | n), o = t & (n ^ 65535), l = e | s >> 1, r = e >> 1 ^ e, u = i >> 1 ^ s & o >> 1 ^ i, a = e & i >> 1 ^ o >> 1 ^ o;
-  e = l, s = r, i = u, o = a, l = e & e >> 2 ^ s & s >> 2, r = e & s >> 2 ^ s & (e ^ s) >> 2, u ^= e & i >> 2 ^ s & o >> 2, a ^= s & i >> 2 ^ (e ^ s) & o >> 2, e = l, s = r, i = u, o = a, l = e & e >> 4 ^ s & s >> 4, r = e & s >> 4 ^ s & (e ^ s) >> 4, u ^= e & i >> 4 ^ s & o >> 4, a ^= s & i >> 4 ^ (e ^ s) & o >> 4, e = l, s = r, i = u, o = a, u ^= e & i >> 8 ^ s & o >> 8, a ^= s & i >> 8 ^ (e ^ s) & o >> 8, e = u ^ u >> 1, s = a ^ a >> 1;
+function Kn(t, n) {
+  let e = t ^ n, s = 65535 ^ e, i = 65535 ^ (t | n), r = t & (n ^ 65535), l = e | s >> 1, o = e >> 1 ^ e, u = i >> 1 ^ s & r >> 1 ^ i, a = e & i >> 1 ^ r >> 1 ^ r;
+  e = l, s = o, i = u, r = a, l = e & e >> 2 ^ s & s >> 2, o = e & s >> 2 ^ s & (e ^ s) >> 2, u ^= e & i >> 2 ^ s & r >> 2, a ^= s & i >> 2 ^ (e ^ s) & r >> 2, e = l, s = o, i = u, r = a, l = e & e >> 4 ^ s & s >> 4, o = e & s >> 4 ^ s & (e ^ s) >> 4, u ^= e & i >> 4 ^ s & r >> 4, a ^= s & i >> 4 ^ (e ^ s) & r >> 4, e = l, s = o, i = u, r = a, u ^= e & i >> 8 ^ s & r >> 8, a ^= s & i >> 8 ^ (e ^ s) & r >> 8, e = u ^ u >> 1, s = a ^ a >> 1;
   let f = t ^ n, c = s | 65535 ^ (f | e);
   return f = (f | f << 8) & 16711935, f = (f | f << 4) & 252645135, f = (f | f << 2) & 858993459, f = (f | f << 1) & 1431655765, c = (c | c << 8) & 16711935, c = (c | c << 4) & 252645135, c = (c | c << 2) & 858993459, c = (c | c << 1) & 1431655765, (c << 1 | f) >>> 0;
 }
-function Xt(t, n = 1e-7) {
+function Jt(t, n = 1e-7) {
   if (t.length === 0) return [];
   if (t.length === 1) return [t];
   const e = new ft(t.length);
-  t.forEach((o) => {
-    const [l, r] = o.firstPoint;
-    e.add(l - n, r - n, l + n, r + n);
+  t.forEach((r) => {
+    const [l, o] = r.firstPoint;
+    e.add(l - n, o - n, l + n, o + n);
   }), e.finish();
   const s = [], i = /* @__PURE__ */ new Set();
-  return t.forEach((o, l) => {
+  return t.forEach((r, l) => {
     if (i.has(l)) return;
-    const r = [o];
+    const o = [r];
     let u = l;
     i.add(l);
     let a = t.length;
     for (; ; ) {
       if (a-- < 0)
         throw new Error("Infinite loop detected");
-      const f = r[r.length - 1].lastPoint, [c, h] = f, p = e.search(
+      const f = o[o.length - 1].lastPoint, [c, h] = f, p = e.search(
         c - n,
         h - n,
         c + n,
         h + n
-      ), d = (w) => Math.abs((u - w) % t.length), m = p.filter((w) => !i.has(w)).map((w) => [
-        t[w],
-        w,
-        d(w)
-      ]).sort(([, , w], [, , F]) => d(w) - d(F));
+      ), d = (I) => Math.abs((u - I) % t.length), m = p.filter((I) => !i.has(I)).map((I) => [
+        t[I],
+        I,
+        d(I)
+      ]).sort(([, , I], [, , F]) => d(I) - d(F));
       if (m.length === 0) {
-        s.push(r);
+        s.push(o);
         break;
       }
-      const [x, g] = m[0];
-      r.push(x), i.add(g), u = g;
+      const [w, g] = m[0];
+      o.push(w), i.add(g), u = g;
     }
   }), s;
 }
+const kt = Symbol.for("pantograph:Figure");
 class v extends ut {
   constructor(e, s = [], { ignoreChecks: i = !1 } = {}) {
     super();
-    C(this, "contour");
-    C(this, "holes");
-    i || Qn(e, s), this.contour = e, this.holes = s;
+    b(this, "contour");
+    b(this, "holes");
+    Object.defineProperty(this, kt, { value: !0 }), i || Zn(e, s), this.contour = e, this.holes = s;
+  }
+  static isInstance(e) {
+    return !!e && e[kt] === !0;
   }
   get boundingBox() {
     return this.contour.boundingBox;
@@ -1341,11 +1354,11 @@ class v extends ut {
     );
   }
   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(o));
+    const s = v.isInstance(e) ? e.allLoops : [e], i = this.allLoops.flatMap((r) => s.flatMap((l) => r.overlappingSegments(l)));
+    return Jt(i).map((r) => new B(r));
   }
 }
-function Qn(t, n = []) {
+function Zn(t, n = []) {
   if (!t) throw new Error("Figure must have a contour");
   for (const [e, s] of it([t, ...n]))
     if (e.intersects(s))
@@ -1356,176 +1369,176 @@ function Qn(t, n = []) {
     throw new Error("Holes must be inside the contour");
   for (const [e, s] of it(n))
     if (e.contains(s.firstPoint))
-      throw console.error(It(e), It(s)), new Error("Holes must not be inside other holes");
+      throw console.error(Et(e), Et(s)), new Error("Holes must not be inside other holes");
 }
-const J = (t, n, e = 1e-7) => Math.abs(t - n) <= e, Wn = (t, n) => {
+const J = (t, n, e = 1e-7) => Math.abs(t - n) <= e, te = (t, n) => {
   const e = t.boundingBox, s = n.boundingBox;
   return J(e.xMin, s.xMin) && J(e.yMin, s.yMin) && J(e.xMax, s.xMax) && J(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) => {
+}, ne = (t, n) => {
+  if (t.segmentsCount !== n.segmentsCount || !te(t, n)) return !1;
+  const e = t.segments, s = n.segments, i = e.length, r = (l, o) => {
     for (let u = 0; u < i; u += 1) {
-      const a = (l + r * u + i) % i;
+      const a = (l + o * u + i) % i;
       if (!e[u].isSame(s[a])) return !1;
     }
     return !0;
   };
   for (let l = 0; l < i; l += 1)
-    if (e[0].isSame(s[l]) && (o(l, 1) || o(l, -1)))
+    if (e[0].isSame(s[l]) && (r(l, 1) || r(l, -1)))
       return !0;
   return !1;
-}, Kn = (t) => {
+}, ee = (t) => {
   const n = [];
   return t.forEach((e) => {
-    n.some((s) => Jn(e, s)) || n.push(e);
+    n.some((s) => ne(e, s)) || n.push(e);
   }), n;
-}, Zn = (t) => {
-  const n = t.map((i, o) => t.slice(o + 1).map((l, r) => [r + o + 1, l]).filter(([, l]) => i.boundingBox.overlaps(l.boundingBox)).map(([l]) => l)), e = [], s = Array(n.length);
-  return n.forEach((i, o) => {
-    let l = s[o];
-    l || (l = [], e.push(l)), l.push(t[o]), i.length && i.forEach((r) => {
-      s[r] = l;
+}, se = (t) => {
+  const n = t.map((i, r) => t.slice(r + 1).map((l, o) => [o + r + 1, l]).filter(([, l]) => i.boundingBox.overlaps(l.boundingBox)).map(([l]) => l)), e = [], s = Array(n.length);
+  return n.forEach((i, r) => {
+    let l = s[r];
+    l || (l = [], e.push(l)), l.push(t[r]), i.length && i.forEach((o) => {
+      s[o] = l;
     });
   }), e;
-}, Gt = (t) => t.map((n, e) => {
-  const i = n.segments[0].midPoint, o = t.filter((l, r) => e === r ? !1 : l.contains(i));
+}, Kt = (t) => t.map((n, e) => {
+  const i = n.segments[0].midPoint, r = t.filter((l, o) => e === o ? !1 : l.contains(i));
   return {
     loop: n,
-    isIn: o
+    isIn: r
   };
-}), te = (t, n) => t.flatMap(({ loop: e }) => ht(
+}), ie = (t, n) => t.flatMap(({ loop: e }) => ht(
   n.filter(
     ({ loop: s, isIn: i }) => s === e || i.indexOf(e) !== -1
   )
-)), ne = (t, n) => {
+)), re = (t, n) => {
   const e = n.filter(({ isIn: i }) => i.length <= 1), s = ht(
-    Gt(t.map(({ loop: i }) => i))
+    Kt(t.map(({ loop: i }) => i))
   );
   return [e, ...s];
 }, ht = (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);
+  return n.length === 1 && e.length === 0 ? [t] : n.length > 1 ? ie(n, t) : re(e, t);
 };
 function X(t) {
-  const n = Kn(t);
-  return Zn(n).map(Gt).flatMap(ht).map((s) => {
+  const n = ee(t);
+  return se(n).map(Kt).flatMap(ht).map((s) => {
     if (s.length === 1) return new v(s[0].loop);
-    s.sort((l, r) => l.isIn.length - r.isIn.length);
-    const [i, ...o] = s.map(({ loop: l }) => l);
-    return new v(i, o);
+    s.sort((l, o) => l.isIn.length - o.isIn.length);
+    const [i, ...r] = s.map(({ loop: l }) => l);
+    return new v(i, r);
   });
 }
-function ee(t, n) {
+function oe(t, n) {
   const e = [];
   for (const s of t)
     for (const i of n)
       e.push([s, i]);
   return e;
 }
-function* vt(t, n, e) {
-  const s = (r) => n.some((u) => P(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));
+function* Ot(t, n, e) {
+  const s = (o) => n.some((u) => P(u, o.lastPoint)), i = (o, u) => o.segmentType !== u.segmentType || !u.isOnSegment(o.firstPoint) || !u.isOnSegment(o.lastPoint) ? !1 : o.segmentType !== "LINE" ? u.isOnSegment(o.midPoint) : !0, r = (o) => e.some((u) => o.isSame(u) || i(o, u));
   let l = [];
-  for (const r of t)
-    s(r) ? (l.push(r), yield new B(l, { ignoreChecks: !0 }), l = []) : o(r) ? (l.length && (yield new B(l, { ignoreChecks: !0 }), l = []), yield new B([r], { ignoreChecks: !0 })) : l.push(r);
+  for (const o of t)
+    s(o) ? (l.push(o), yield new B(l, { ignoreChecks: !0 }), l = []) : r(o) ? (l.length && (yield new B(l, { ignoreChecks: !0 }), l = []), yield new B([o], { ignoreChecks: !0 })) : l.push(o);
   l.length && (yield new B(l, { ignoreChecks: !0 }));
 }
-const Bt = (t, n) => {
-  const e = t.findIndex((o) => P(n, o.firstPoint)), s = t.slice(0, e);
+const _t = (t, n) => {
+  const e = t.findIndex((r) => P(n, r.firstPoint)), s = t.slice(0, e);
   return t.slice(e).concat(s);
-}, kt = (t, n) => {
+}, Tt = (t, n) => {
   let e = t;
-  const s = (r) => P(r.firstPoint, n.firstPoint) && P(r.lastPoint, n.lastPoint);
+  const s = (o) => P(o.firstPoint, n.firstPoint) && P(o.lastPoint, n.lastPoint);
   let i = t.findIndex(s);
   if (i === -1) {
-    const r = t.map((u) => u.reverse());
-    if (r.reverse(), i = r.findIndex(s), i === -1)
+    const o = t.map((u) => u.reverse());
+    if (o.reverse(), i = o.findIndex(s), i === -1)
       throw console.error(
-        r.map((u) => u.repr),
+        o.map((u) => u.repr),
         n.repr
       ), new Error("Failed to rotate to segment start");
-    e = r;
+    e = o;
   }
-  const o = e.slice(0, i);
-  return e.slice(i).concat(o);
+  const r = e.slice(0, i);
+  return e.slice(i).concat(r);
 };
-function se(t, n, e) {
+function le(t, n, e) {
   return t.filter((s) => {
-    const i = n.filter((r) => P(r.firstPoint, s) || P(r.lastPoint, s));
+    const i = n.filter((o) => P(o.firstPoint, s) || P(o.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));
-    return !(o.every((r) => r) || !o.some((r) => r));
+    const r = i.map((o) => e.contains(o.midPoint));
+    return !(r.every((o) => o) || !r.some((o) => o));
   });
 }
-function ie(t, n, e, s = !1) {
+function ue(t, n, e, s = !1) {
   let i = [];
-  const o = [], l = new Array(t.segments.length).fill(0).map(() => []), r = new Array(n.segments.length).fill(0).map(() => []);
+  const r = [], l = new Array(t.segments.length).fill(0).map(() => []), o = new Array(n.segments.length).fill(0).map(() => []);
   if (t.segments.forEach((p, d) => {
-    n.segments.forEach((m, x) => {
-      const { intersections: g, overlaps: w } = Z(
+    n.segments.forEach((m, w) => {
+      const { intersections: g, overlaps: I } = Z(
         p,
         m,
         e
       );
-      i.push(...g), l[d].push(...g), r[x].push(...g), o.push(...w);
-      const F = w.flatMap((y) => [
-        y.firstPoint,
-        y.lastPoint
+      i.push(...g), l[d].push(...g), o[w].push(...g), r.push(...I);
+      const F = I.flatMap((S) => [
+        S.firstPoint,
+        S.lastPoint
       ]);
-      i.push(...F), l[d].push(...F), r[x].push(...F);
+      i.push(...F), l[d].push(...F), o[w].push(...F);
     });
-  }), i = U(i, e), !i.length || i.length === 1) return null;
+  }), i = j(i, e), !i.length || i.length === 1) return null;
   const u = ([p, d]) => d.length ? p.splitAt(d) : [p];
-  let a = N([t.segments, l]).flatMap(u), f = N([n.segments, r]).flatMap(u);
-  if (i = se(
+  let a = V([t.segments, l]).flatMap(u), f = V([n.segments, o]).flatMap(u);
+  if (i = le(
     i,
     a,
     n
-  ), !i.length && !o.length) return null;
-  if (o.length) {
-    const p = o[0];
-    a = kt(
+  ), !i.length && !r.length) return null;
+  if (r.length) {
+    const p = r[0];
+    a = Tt(
       a,
       p
-    ), f = kt(
+    ), f = Tt(
       f,
       p
     );
   } else {
     const p = i[0];
-    a = Bt(a, p), f = Bt(f, p);
+    a = _t(a, p), f = _t(f, p);
   }
   let c = Array.from(
-    vt(
+    Ot(
       a,
       i,
-      o
+      r
     )
   ), h = Array.from(
-    vt(
+    Ot(
       f,
       i,
-      o
+      r
     )
   );
   return (!P(
     h[0].lastPoint,
     c[0].lastPoint
-  ) || o.length > 0 && h[0].segmentsCount !== 1) && (h = h.map((p) => p.reverse()).reverse(), P(h[0].lastPoint, c[0].lastPoint) || (c = c.map((p) => p.reverse()).reverse())), N([c, h]).map(([p, d]) => {
+  ) || r.length > 0 && h[0].segmentsCount !== 1) && (h = h.map((p) => p.reverse()).reverse(), P(h[0].lastPoint, c[0].lastPoint) || (c = c.map((p) => p.reverse()).reverse())), V([c, h]).map(([p, d]) => {
     if (s) {
-      if (((x) => x.segments.every(
-        (g) => o.some(
-          (w) => g.isSame(w) || g.segmentType === w.segmentType && w.isOnSegment(g.firstPoint) && w.isOnSegment(g.lastPoint) && (g.segmentType === "LINE" || w.isOnSegment(g.midPoint))
+      if (((w) => w.segments.every(
+        (g) => r.some(
+          (I) => g.isSame(I) || g.segmentType === I.segmentType && I.isOnSegment(g.firstPoint) && I.isOnSegment(g.lastPoint) && (g.segmentType === "LINE" || I.isOnSegment(g.midPoint))
         )
       ))(p))
         return [p, "same"];
-    } else if (p.segmentsCount === 1 && o.some((m) => p.segments[0].isSame(m)))
+    } else if (p.segmentsCount === 1 && r.some((m) => p.segments[0].isSame(m)))
       return [p, "same"];
     return [p, d];
   });
 }
-function Ot(t) {
+function Lt(t) {
   let n = t[0];
   for (const e of t.slice(1))
     n = n.extend(e);
@@ -1536,50 +1549,50 @@ function Ot(t) {
     ), new Error("Bug in the intersection algo on non closing strand");
   return new _(n.segments);
 }
-function oe(t, n) {
-  const e = N([
+function ce(t, n) {
+  const e = V([
     n.slice(0, -1),
     n.slice(1)
-  ]).map(([i, o]) => Ot(t.slice(i, o)));
+  ]).map(([i, r]) => Lt(t.slice(i, r)));
   let s = t.slice(
     n[n.length - 1]
   );
-  return n[0] !== 0 && (s = s.concat(t.slice(0, n[0]))), e.push(Ot(s)), e;
+  return n[0] !== 0 && (s = s.concat(t.slice(0, n[0]))), e.push(Lt(s)), e;
 }
-function re(t) {
+function ae(t) {
   if (!t.length) return [];
   const n = t.map((i) => i.firstPoint);
   let e = t.map((i) => i.lastPoint);
   e = e.slice(-1).concat(e.slice(0, -1));
-  const s = N([n, e]).flatMap(
-    ([i, o], l) => P(i, o) ? [] : l
+  const s = V([n, e]).flatMap(
+    ([i, r], l) => P(i, r) ? [] : l
   );
   try {
-    return oe(t, s);
+    return ce(t, s);
   } catch {
-    return Xt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => P(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new _(o));
+    return Jt(t.flatMap((r) => r.segments)).filter((r) => r.length > 1).filter((r) => P(r[0].firstPoint, r.at(-1).lastPoint)).map((r) => new _(r));
   }
 }
-const _t = (t, n) => {
+const qt = (t, n) => {
   if (t.length === 0) return [n];
   const e = t.at(-1);
   return P(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : P(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
-}, le = (t, n) => t.length === 0 ? [n] : P(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
+}, fe = (t, n) => t.length === 0 ? [n] : P(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
 function pt(t, n, {
   firstInside: e,
   secondInside: s,
   firstBoundaryInside: i = !1,
-  secondBoundaryInside: o = !1
+  secondBoundaryInside: r = !1
 }) {
-  const l = ie(
+  const l = ue(
     t,
     n,
     void 0,
-    i || o
+    i || r
   );
   if (!l) {
     const f = t.segments[0].midPoint, c = n.contains(f, {
-      strokeIsInside: o
+      strokeIsInside: r
     }), h = n.segments[0].midPoint, p = t.contains(h, {
       strokeIsInside: i
     });
@@ -1591,27 +1604,27 @@ function pt(t, n, {
   }
   if (l.every(([, f]) => f === "same"))
     return { identical: !0 };
-  let r = null, u = null;
+  let o = null, u = null;
   const a = l.flatMap(([f, c]) => {
     let h = [], p = 0;
     if (c === "same")
-      return u === 1 ? (u = 1, f) : u === 2 || u === 0 ? (u = null, []) : u === null ? (r ? r = r.extend(f) : r = f, []) : (console.error("weird situation"), []);
+      return u === 1 ? (u = 1, f) : u === 2 || u === 0 ? (u = null, []) : u === null ? (o ? o = o.extend(f) : o = f, []) : (console.error("weird situation"), []);
     const d = f.segments[0].midPoint, m = n.contains(d, {
-      strokeIsInside: o
+      strokeIsInside: r
     });
-    (e === "keep" && m || e === "remove" && !m) && (p += 1, h = _t(h, f));
-    const x = c.segments[0].midPoint, g = t.contains(x, {
+    (e === "keep" && m || e === "remove" && !m) && (p += 1, h = qt(h, f));
+    const w = c.segments[0].midPoint, g = t.contains(w, {
       strokeIsInside: i
     });
     if (s === "keep" && g || s === "remove" && !g) {
-      const w = c;
-      p += 1, p === 2 && h.length ? (h = _t(h, w), r = null) : h = [w];
+      const I = c;
+      p += 1, p === 2 && h.length ? (h = qt(h, I), o = null) : h = [I];
     }
-    return u === null && p === 1 && r && (h = le(h, r)), p === 1 && (u = p, r = null), h.length ? h : (r = null, []);
+    return u === null && p === 1 && o && (h = fe(h, o)), p === 1 && (u = p, o = null), h.length ? h : (o = null, []);
   });
-  return re(a);
+  return ae(a);
 }
-const ue = (t, n, e) => {
+const he = (t, n, e) => {
   const s = pt(t, n, {
     firstInside: "remove",
     secondInside: "remove",
@@ -1626,47 +1639,47 @@ const ue = (t, n, e) => {
   });
   return Array.isArray(s) ? s : s.identical ? [] : s.firstCurveInSecond ? [] : s.secondCurveInFirst ? [t, n] : [t];
 }, dt = (t, n, e) => {
-  const s = (e == null ? void 0 : e.firstBoundaryInside) ?? !1, i = (e == null ? void 0 : e.secondBoundaryInside) ?? !1, o = s || i, l = (u, a, f) => u.segments.every(
+  const s = (e == null ? void 0 : e.firstBoundaryInside) ?? !1, i = (e == null ? void 0 : e.secondBoundaryInside) ?? !1, r = s || i, l = (u, a, f) => u.segments.every(
     (c) => a.contains(c.midPoint, { strokeIsInside: f })
   );
-  if (o) {
+  if (r) {
     if (l(t, n, i))
       return [t];
     if (l(n, t, s))
       return [n];
   }
-  const r = pt(t, n, {
+  const o = pt(t, n, {
     firstInside: "keep",
     secondInside: "keep",
     ...e
   });
-  return Array.isArray(r) ? r : r.identical ? [t] : r.firstCurveInSecond ? [t] : r.secondCurveInFirst ? [n] : [];
+  return Array.isArray(o) ? o : o.identical ? [t] : o.firstCurveInSecond ? [t] : o.secondCurveInFirst ? [n] : [];
 };
-function ce(t) {
+function pe(t) {
   const n = /* @__PURE__ */ new Map(), e = [];
   return t.forEach((s, i) => {
-    let o;
-    n.has(i) ? o = n.get(i) : (o = { current: [s], fusedWith: /* @__PURE__ */ new Set([i]) }, e.push(o)), t.slice(i + 1).forEach((l, r) => {
-      const u = o.current, a = i + r + 1;
-      if (o.fusedWith.has(a)) return;
+    let r;
+    n.has(i) ? r = n.get(i) : (r = { current: [s], fusedWith: /* @__PURE__ */ new Set([i]) }, e.push(r)), t.slice(i + 1).forEach((l, o) => {
+      const u = r.current, a = i + o + 1;
+      if (r.fusedWith.has(a)) return;
       let f = [l], c = !1;
       if (n.has(a) && (f = n.get(a).current, c = !0), !u.some(
         (d) => f.some((m) => d.intersects(m))
       )) return;
       let p;
-      u.length > 1 || f.length > 1 ? p = G(u, f) : p = Qt(u[0], f[0]), o.fusedWith.add(a), o.current = p, c || n.set(a, o);
+      u.length > 1 || f.length > 1 ? p = G(u, f) : p = Zt(u[0], f[0]), r.fusedWith.add(a), r.current = p, c || n.set(a, r);
     });
   }), e.flatMap(({ current: s }) => s);
 }
-function Qt(t, n) {
-  const e = ue(t.contour, n.contour), s = n.holes.flatMap((l) => tt(l, t.contour)), i = t.holes.flatMap((l) => tt(l, n.contour)), o = ee(t.holes, n.holes).flatMap(
-    ([l, r]) => dt(l, r)
+function Zt(t, n) {
+  const e = he(t.contour, n.contour), s = n.holes.flatMap((l) => tt(l, t.contour)), i = t.holes.flatMap((l) => tt(l, n.contour)), r = oe(t.holes, n.holes).flatMap(
+    ([l, o]) => dt(l, o)
   );
   return X([
     ...e,
     ...s,
     ...i,
-    ...o
+    ...r
   ]);
 }
 function nt(t, n) {
@@ -1674,7 +1687,7 @@ function nt(t, n) {
     return X(tt(t.contour, n.contour));
   if (t.isFull) {
     const s = tt(t.contour, n.contour), i = n.holes.flatMap(
-      (o) => dt(o, t.contour, { firstBoundaryInside: !0 })
+      (r) => dt(r, t.contour, { firstBoundaryInside: !0 })
     );
     return X([...s, ...i]);
   } else if (n.isFull && !t.contour.intersects(n.contour))
@@ -1694,7 +1707,7 @@ function nt(t, n) {
     e = e.flatMap((i) => nt(i, new v(s)));
   }), e;
 }
-function ae(t, n) {
+function de(t, n) {
   const e = dt(t.contour, n.contour);
   if (!e.length) return [];
   let s = X(e);
@@ -1710,14 +1723,14 @@ function G(t, n) {
   if (!t.length) return n;
   if (!n.length) return t;
   if (t.length === 1 && n.length > 1 || n.length === 1 && t.length > 1)
-    return ce([...t, ...n]);
+    return pe([...t, ...n]);
   if (t.length > 1 && n.length > 1) {
     let e = G([t[0]], n);
     return t.slice(1).forEach((s) => {
       e = G([s], e);
     }), e;
   }
-  return t.length === 1 && n.length === 1 ? Qt(t[0], n[0]) : [];
+  return t.length === 1 && n.length === 1 ? Zt(t[0], n[0]) : [];
 }
 function Q(t, n) {
   if (!t.length) return [];
@@ -1732,20 +1745,24 @@ function Q(t, n) {
   }), e;
 }
 function lt(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([e], n)) : n.flatMap((e) => lt(t, [e]));
+  return !t.length || !n.length ? [] : t.length === 1 && n.length === 1 ? de(t[0], n[0]) : t.length > 1 ? t.flatMap((e) => lt([e], n)) : n.flatMap((e) => lt(t, [e]));
 }
+const zt = Symbol.for("pantograph:Diagram");
 class O extends ut {
   constructor(e = [], { ignoreChecks: s = !1 } = {}) {
     super();
-    C(this, "figures");
-    C(this, "_boundingBox", null);
-    s || fe(e), this.figures = e;
+    b(this, "figures");
+    b(this, "_boundingBox", null);
+    Object.defineProperty(this, zt, { value: !0 }), s || me(e), this.figures = e;
+  }
+  static isInstance(e) {
+    return !!e && e[zt] === !0;
   }
   get isEmpty() {
     return this.figures.length === 0;
   }
   get boundingBox() {
-    if (this.isEmpty) return new pn();
+    if (this.isEmpty) return new Pn();
     if (this._boundingBox === null) {
       let e = this.figures[0].boundingBox;
       for (const s of this.figures.slice(1))
@@ -1771,7 +1788,7 @@ class O extends ut {
     );
   }
   overlappingStrands(e) {
-    return this.figures.flatMap((s) => e instanceof O ? e.figures.flatMap(
+    return this.figures.flatMap((s) => O.isInstance(e) ? e.figures.flatMap(
       (i) => s.overlappingStrands(i)
     ) : s.overlappingStrands(e));
   }
@@ -1785,7 +1802,7 @@ class O extends ut {
     return new O(lt(this.figures, e.figures));
   }
 }
-function fe(t) {
+function me(t) {
   for (const [n, e] of it(t))
     if (n.intersects(e))
       throw new Error("Diagram figures must not intersect");
@@ -1798,14 +1815,14 @@ export {
   Z as a,
   G as b,
   Q as c,
-  Dt as d,
-  Xt as e,
-  de as f,
-  Hn as g,
-  It as h,
+  jt as d,
+  Jt as e,
+  Ie as f,
+  Gn as g,
+  Et as h,
   lt as i,
   K as l,
-  dn as p,
-  vt as s
+  In as p,
+  Ot as s
 };
-//# sourceMappingURL=models-CFd5lRKc.js.map
+//# sourceMappingURL=models-BHeLX0dj.js.map