pantograph2d 0.8.0 → 0.9.0

package/dist/{Diagram-2450b2e6.js → models-BjaFYsN2.js}

@@ -1,24 +1,23 @@
 var tn = Object.defineProperty;
 var nn = (t, n, e) => n in t ? tn(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var C = (t, n, e) => (nn(t, typeof n != "symbol" ? n + "" : n, e), e);
-import { s as k, q as en, d as Ot, a as q, b as V, n as sn, h as Tt, r as U, A as S, e as g, u as Lt, E as M, T as on, v as rn, Q as A, w as $, C as I, f as ln, x as cn, L as y, y as zt, g as lt, z as N, F as un, l as an, c as fn, G as dt, B as hn } from "./QuadraticBezier-e116a2d6.js";
+var C = (t, n, e) => nn(t, typeof n != "symbol" ? n + "" : n, e);
+import { b as k, d as en, e as Ot, a as q, s as V, n as sn, p as Tt, r as U, A as S, g, u as Lt, E as M, T as on, v as rn, Q as A, w as $, C as I, c as ln, x as cn, L as y, y as zt, F as lt, z as N, G as un, l as an, o as fn, H as dt, B as hn } from "./QuadraticBezier-PcRS9HZK.js";
 function pn(t, n) {
   const e = k(n, t.firstPoint), s = en(e, t.V) / t.squareLength;
   return t.paramPoint(s);
 }
 function J(t, n, e) {
   const s = e || t.precision, i = pn(t, n.center), o = Ot(i, n.center);
-  if (o > n.radius + s)
-    return [];
+  if (o > n.radius + s) return [];
   if (Math.abs(o - n.radius) < s) {
-    const c = i;
-    return t.isOnSegment(c) && n.isOnSegment(c) ? [c] : [];
+    const u = i;
+    return t.isOnSegment(u) && n.isOnSegment(u) ? [u] : [];
   }
   const r = [], l = Math.sqrt(
     n.radius * n.radius - o * o
-  ), u = t.tangentAtFirstPoint, a = q(i, V(u, l));
+  ), c = t.tangentAtFirstPoint, a = q(i, V(c, l));
   t.isOnSegment(a) && n.isOnSegment(a) && r.push(a);
-  const f = q(i, V(u, -l));
+  const f = q(i, V(c, -l));
   return t.isOnSegment(f) && n.isOnSegment(f) && r.push(f), r;
 }
 const dn = (t) => {
@@ -39,10 +38,8 @@ const dn = (t) => {
     // 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((s, i) => t.pointToParam(s) - t.pointToParam(i));
-  if (e.length === 0)
-    return [];
-  if (e.length === 1)
-    return [];
+  if (e.length === 0) return [];
+  if (e.length === 1) return [];
   if (e.length === 2)
     return t.isSame(dn(n)) ? [] : [new S(e[0], e[1], t.center, t.clockwise)];
   if (e.length === 3) {
@@ -71,7 +68,7 @@ function qt(t, n, e = !1, s) {
     return [];
   if (o < i)
     return l > i ? [] : e ? mn(t, n) : [];
-  const u = sn(k(n.center, t.center)), a = o > r - i;
+  const c = sn(k(n.center, t.center)), a = o > r - i;
   if (
     // circles are outside each other
     a || // circles are inside each other
@@ -79,30 +76,29 @@ function qt(t, n, e = !1, s) {
   ) {
     const w = a || t.radius > n.radius ? 1 : -1, x = q(
       t.center,
-      V(u, w * t.radius)
+      V(c, w * t.radius)
     );
     return t.isOnSegment(x) && n.isOnSegment(x) ? [x] : [];
   }
-  const f = t.radius * t.radius / (2 * o) - n.radius * n.radius / (2 * o) + o / 2, c = q(
+  const f = t.radius * t.radius / (2 * o) - n.radius * n.radius / (2 * o) + o / 2, u = q(
     t.center,
-    V(u, f)
+    V(c, f)
   ), h = Math.sqrt(
     t.radius * t.radius - f * f
-  ), p = Tt(u), d = q(c, V(p, h)), m = q(c, V(p, -h)), P = [];
+  ), p = Tt(c), d = q(u, V(p, h)), m = q(u, V(p, -h)), P = [];
   return t.isOnSegment(d) && n.isOnSegment(d) && P.push(d), t.isOnSegment(m) && n.isOnSegment(m) && P.push(m), P;
 }
 function et(t, n, e = 1e-9) {
-  const s = t.transform(n.ellipseReferenceFrameTransform), i = s.slope, o = s.yIntercept, r = n.majorRadius * n.majorRadius, l = n.minorRadius * n.minorRadius, u = n.majorRadius * n.minorRadius, a = s.slope * s.slope, f = s.yIntercept * s.yIntercept, c = (w) => w.map(
+  const s = t.transform(n.ellipseReferenceFrameTransform), i = s.slope, o = s.yIntercept, r = n.majorRadius * n.majorRadius, l = n.minorRadius * n.minorRadius, c = n.majorRadius * n.minorRadius, a = s.slope * s.slope, f = s.yIntercept * s.yIntercept, u = (w) => w.map(
     (x) => n.reverseEllipseReferenceFrameTransform.transform(x)
   ).filter((x) => t.isOnSegment(x) && n.isOnSegment(x));
   if (!Number.isFinite(i)) {
     const w = s.firstPoint[0];
-    if (Math.abs(w) - n.majorRadius > e)
-      return [];
+    if (Math.abs(w) - n.majorRadius > e) return [];
     if (Math.abs(Math.abs(w) - n.majorRadius) < e)
-      return c([[w, 0]]);
-    const x = n.minorRadius * Math.sqrt(1 - w * w / r), E = [w, x], b = [w, -x];
-    return c([E, b]);
+      return u([[w, 0]]);
+    const x = n.minorRadius * Math.sqrt(1 - w * w / r), F = [w, x], b = [w, -x];
+    return u([F, b]);
   }
   const h = r * a + l - f;
   if (h < -e)
@@ -110,41 +106,41 @@ function et(t, n, e = 1e-9) {
   const p = r * a + l;
   if (Math.abs(h) < e) {
     const w = -(r * i * o) / p, x = l * o / p;
-    return c([[w, x]]);
+    return u([[w, x]]);
   }
   const d = Math.sqrt(h), m = [
-    -(r * i * o + u * d) / p,
-    (l * o - u * i * d) / p
+    -(r * i * o + c * d) / p,
+    (l * o - c * i * d) / p
   ], P = [
-    -(r * i * o - u * d) / p,
-    (l * o + u * i * d) / p
+    -(r * i * o - c * d) / p,
+    (l * o + c * i * d) / p
   ];
-  return c([m, P]);
+  return u([m, P]);
 }
 function Dt(t, n) {
-  const e = Math.max(t.precision, n.precision), s = t.coefficients, i = s.x2, o = s.xy, r = s.y2, l = 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, P = f.c, w = {
-    z0: a * i * d * d + i * i * P * P - l * i * d * P + c * c * a * a - 2 * i * P * c * a - l * d * c * a + c * l * l * P,
-    z1: m * l * l * c - P * d * i * o - 2 * i * P * c * u - a * c * h * l + 2 * d * h * i * a + 2 * m * P * i * i + d * d * i * u - m * d * i * l - 2 * i * m * c * a - a * c * d * o + 2 * a * u * c * c - P * h * i * l - u * c * d * l + 2 * P * o * c * l,
-    z2: m * m * i * i + 2 * p * P * i * i - u * c * d * o + P * c * o * o - u * c * h * l - P * h * i * o - 2 * i * m * c * u + 2 * d * h * i * u - p * d * i * l - 2 * i * p * c * a + h * h * i * a + 2 * m * o * c * l + u * u * c * c - r * c * d * l - m * h * i * l + 2 * a * r * c * c - a * c * h * o + p * l * l * c + d * d * i * r - m * d * i * o - 2 * i * P * c * r,
-    z3: -2 * i * c * r * m + m * c * o * o + 2 * p * o * c * l - r * c * h * l + h * h * i * u - m * h * i * o - 2 * i * p * c * u - u * c * h * o - p * h * i * l + 2 * m * p * i * i + 2 * u * r * c * c - r * c * d * o + 2 * d * h * i * r - p * d * i * o,
-    z4: i * i * p * p - 2 * i * p * c * r + c * c * r * r - o * i * h * p - o * h * c * r + o * o * c * p + r * i * h * h
-  }, E = Lt(
+  const e = Math.max(t.precision, n.precision), s = t.coefficients, i = s.x2, o = s.xy, r = s.y2, l = s.x, c = s.y, a = s.c, f = n.coefficients, u = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, P = f.c, w = {
+    z0: a * i * d * d + i * i * P * P - l * i * d * P + u * u * a * a - 2 * i * P * u * a - l * d * u * a + u * l * l * P,
+    z1: m * l * l * u - P * d * i * o - 2 * i * P * u * c - a * u * h * l + 2 * d * h * i * a + 2 * m * P * i * i + d * d * i * c - m * d * i * l - 2 * i * m * u * a - a * u * d * o + 2 * a * c * u * u - P * h * i * l - c * u * d * l + 2 * P * o * u * l,
+    z2: m * m * i * i + 2 * p * P * i * i - c * u * d * o + P * u * o * o - c * u * h * l - P * h * i * o - 2 * i * m * u * c + 2 * d * h * i * c - p * d * i * l - 2 * i * p * u * a + h * h * i * a + 2 * m * o * u * l + c * c * u * u - r * u * d * l - m * h * i * l + 2 * a * r * u * u - a * u * h * o + p * l * l * u + d * d * i * r - m * d * i * o - 2 * i * P * u * r,
+    z3: -2 * i * u * r * m + m * u * o * o + 2 * p * o * u * l - r * u * h * l + h * h * i * c - m * h * i * o - 2 * i * p * u * c - c * u * h * o - p * h * i * l + 2 * m * p * i * i + 2 * c * r * u * u - r * u * d * o + 2 * d * h * i * r - p * d * i * o,
+    z4: i * i * p * p - 2 * i * p * u * r + u * u * r * r - o * i * h * p - o * h * u * r + o * o * u * p + r * i * h * h
+  }, F = Lt(
     [w.z0, w.z1, w.z2, w.z3, w.z4],
     e
   ).flatMap((b) => {
-    const R = i * h * b + i * d - c * o * b - c * l;
+    const R = i * h * b + i * d - u * o * b - u * l;
     if (R)
-      return [[-(i * P + i * p * b * b - c * r * b * b + i * m * b - c * u * b - c * a) / R, b]];
-    const T = o * b + l, L = -T / (2 * i), j = r * b * b + u * b + a, z = T * T / (4 * i * i) - j / i;
+      return [[-(i * P + i * p * b * b - u * r * b * b + i * m * b - u * c * b - u * a) / R, b]];
+    const T = o * b + l, L = -T / (2 * i), j = r * b * b + c * b + a, z = T * T / (4 * i * i) - j / i;
     if (Math.abs(z) < e)
       return [[L, b]];
     if (z > 0) {
-      const Y = Math.sqrt(z);
-      return [[L + Y, b], [L - Y, b]];
+      const H = Math.sqrt(z);
+      return [[L + H, b], [L - H, b]];
     }
     return [];
   });
-  return U(E, e);
+  return U(F, e);
 }
 function mt(t, n) {
   return Dt(t, n).filter((s) => t.isOnSegment(s) && n.isOnSegment(s));
@@ -194,10 +190,8 @@ const gn = (t) => {
     // 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));
-  if (s.length === 0)
-    return [];
-  if (s.length === 1)
-    return [];
+  if (s.length === 0) return [];
+  if (s.length === 1) return [];
   if (s.length === 2)
     return t.isSame(gn(n)) ? [] : [e(s[0], s[1])];
   if (s.length === 3) {
@@ -212,8 +206,8 @@ function wn(t, n, e = !1) {
   return g(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 ? Pn(t, n) : [] : Dt(t, n).filter((r) => t.isOnSegment(r) && n.isOnSegment(r));
 }
 function gt(t, n) {
-  const [e, s] = t.firstPoint, [i, o] = t.lastPoint, r = new on().rotate(-Math.atan2(o - s, i - e)).translate(-e, -s), l = r.clone().inverse(), u = n.transform(r);
-  return u.paramsAtY(0).map((a) => u.paramPoint(a)).map((a) => l.transform(a)).filter((a) => t.isOnSegment(a));
+  const [e, s] = t.firstPoint, [i, o] = t.lastPoint, r = new on().translate(-e, -s).rotate(-Math.atan2(o - s, i - e)), l = r.clone().inverse(), c = n.transform(r);
+  return c.paramsAtY(0).map((a) => c.paramPoint(a)).map((a) => l.transform(a)).filter((a) => t.isOnSegment(a));
 }
 const xn = (t, n = 1e-9) => {
   let e = t;
@@ -225,22 +219,22 @@ function Rt(t, n = 1e-9) {
   );
 }
 const Sn = (t, n) => {
-  const [[e, s, i, o], [r, l, u, a]] = n.polynomialCoefficients, f = t.coefficients, c = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, P = f.c, w = e * e, x = s * s, E = i * i, b = o * o, R = r * r, T = l * l, L = u * u, j = a * a, z = P + d * e + c * w + m * r + h * e * r + p * R, Y = d * s + 2 * c * e * s + h * s * r + m * l + h * e * l + 2 * p * r * l, Qt = c * x + d * i + 2 * c * e * i + h * i * r + h * s * l + p * T + m * u + h * e * u + 2 * p * r * u, Wt = 2 * c * s * i + d * o + 2 * c * e * o + h * o * r + h * i * l + h * s * u + 2 * p * l * u + m * a + h * e * a + 2 * p * r * a, Jt = c * E + 2 * c * s * o + h * o * l + h * i * u + p * L + h * s * a + 2 * p * l * a, Kt = 2 * c * i * o + h * o * u + h * i * a + 2 * p * u * a, Zt = c * b + h * o * a + p * j;
-  return [z, Y, Qt, Wt, Jt, Kt, Zt];
+  const [[e, s, i, o], [r, l, c, a]] = n.polynomialCoefficients, f = t.coefficients, u = f.x2, h = f.xy, p = f.y2, d = f.x, m = f.y, P = f.c, w = e * e, x = s * s, F = i * i, b = o * o, R = r * r, T = l * l, L = c * c, j = a * a, z = P + d * e + u * w + m * r + h * e * r + p * R, H = d * s + 2 * u * e * s + h * s * r + m * l + h * e * l + 2 * p * r * l, Qt = u * x + d * i + 2 * u * e * i + h * i * r + h * s * l + p * T + m * c + h * e * c + 2 * p * r * c, Wt = 2 * u * s * i + d * o + 2 * u * e * o + h * o * r + h * i * l + h * s * c + 2 * p * l * c + m * a + h * e * a + 2 * p * r * a, Jt = u * F + 2 * u * s * o + h * o * l + h * i * c + p * L + h * s * a + 2 * p * l * a, Kt = 2 * u * i * o + h * o * c + h * i * a + 2 * p * c * a, Zt = u * b + h * o * a + p * j;
+  return [z, H, Qt, Wt, Jt, Kt, Zt];
 };
 function Pt(t, n) {
   const e = Math.max(t.precision, n.precision), s = Sn(t, n), i = Lt(s, e).filter((o) => o >= -n.precision && o <= 1 + n.precision);
   return Rt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
 }
 const yn = (t, n) => {
-  const [[e, s, i], [o, r, l]] = 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, P = s * s, w = i * i, x = o * o, E = r * r, b = l * l, R = a * m + f * e * o + c * x + h * e + p * o + d, T = 2 * a * e * s + f * e * r + f * s * o + 2 * c * o * r + h * s + p * r, L = 2 * a * e * i + a * P + f * e * l + f * s * r + f * i * o + 2 * c * o * l + c * E + h * i + p * l, j = 2 * a * s * i + f * s * l + f * i * r + 2 * c * r * l, z = a * w + f * i * l + c * b;
+  const [[e, s, i], [o, r, l]] = n.polynomialCoefficients, c = t.coefficients, a = c.x2, f = c.xy, u = c.y2, h = c.x, p = c.y, d = c.c, m = e * e, P = s * s, w = i * i, x = o * o, F = r * r, b = l * l, R = a * m + f * e * o + u * x + h * e + p * o + d, T = 2 * a * e * s + f * e * r + f * s * o + 2 * u * o * r + h * s + p * r, L = 2 * a * e * i + a * P + f * e * l + f * s * r + f * i * o + 2 * u * o * l + u * F + h * i + p * l, j = 2 * a * s * i + f * s * l + f * i * r + 2 * u * r * l, z = a * w + f * i * l + u * b;
   return [R, T, L, j, z];
 };
 function wt(t, n) {
   const e = Math.max(t.precision, n.precision), s = yn(t, n), i = rn(...s).filter((o) => o >= -n.precision && o <= 1 + n.precision);
   return Rt(i, e).map((o) => n.paramPoint(o)).filter((o) => t.isOnSegment(o));
 }
-function F(t, { firstPoint: n, lastPoint: e }, s = 1e-9) {
+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] : ln(i, k(t, n)) / cn(i);
 }
@@ -254,7 +248,7 @@ class ct {
 }
 const bn = 3 / 4, Cn = 4 / 9;
 function Mn(t) {
-  const n = F(t.firstControlPoint, t), e = F(t.lastControlPoint, t), s = n * e > 0 ? bn : Cn;
+  const n = E(t.firstControlPoint, t), e = E(t.lastControlPoint, t), s = n * e > 0 ? bn : Cn;
   return new ct(
     t.firstPoint,
     t.lastPoint,
@@ -263,7 +257,7 @@ function Mn(t) {
   );
 }
 function An(t) {
-  const n = F(t.controlPoint, t);
+  const n = E(t.controlPoint, t);
   return new ct(
     t.firstPoint,
     t.lastPoint,
@@ -278,18 +272,18 @@ function In(t) {
     return An(t);
   throw new Error("Not implemented");
 }
-function Fn(t) {
+function En(t) {
   const n = t.paramPoint(0.5), e = Tt(k(n, t.firstPoint)), s = q(n, e), i = {
     firstPoint: n,
     lastPoint: s
   }, o = [
-    F(t.firstPoint, i),
-    F(t.lastPoint, i)
+    E(t.firstPoint, i),
+    E(t.lastPoint, i)
   ];
   return t instanceof I ? o.push(
-    F(t.firstControlPoint, i),
-    F(t.lastControlPoint, i)
-  ) : t instanceof A && o.push(F(t.controlPoint, i)), new ct(
+    E(t.firstControlPoint, i),
+    E(t.lastControlPoint, i)
+  ) : t instanceof A && o.push(E(t.controlPoint, i)), new ct(
     n,
     s,
     Math.min(...o),
@@ -314,7 +308,7 @@ function xt(t, n) {
   }
   return e;
 }
-class H {
+class Y {
   constructor(n, e) {
     this.from = n, this.to = e;
   }
@@ -325,19 +319,19 @@ class H {
     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 En(t, n) {
+function Fn(t, n) {
   if (t instanceof I)
     return new Bn([
-      F(t.firstPoint, n),
-      F(t.firstControlPoint, n),
-      F(t.lastControlPoint, n),
-      F(t.lastPoint, n)
+      E(t.firstPoint, n),
+      E(t.firstControlPoint, n),
+      E(t.lastControlPoint, n),
+      E(t.lastPoint, n)
     ]);
   if (t instanceof A)
     return new vn([
-      F(t.firstPoint, n),
-      F(t.controlPoint, n),
-      F(t.lastPoint, n)
+      E(t.firstPoint, n),
+      E(t.controlPoint, n),
+      E(t.lastPoint, n)
     ]);
   throw new Error("Not implemented");
 }
@@ -346,8 +340,8 @@ class vn {
     C(this, "topHull", []);
     C(this, "bottomHull", []);
     this.distances = n;
-    const [e, s, i] = n, o = [0, e], r = [1 / 2, s], l = [1, i], u = i - e, a = e;
-    s - (u * (1 / 2) + a) > 0 ? (this.topHull = [o, r, l], this.bottomHull = [o, l]) : (this.topHull = [o, l], this.bottomHull = [o, r, l]);
+    const [e, s, i] = n, o = [0, e], r = [1 / 2, s], l = [1, i], c = i - e, a = e;
+    s - (c * (1 / 2) + a) > 0 ? (this.topHull = [o, r, l], this.bottomHull = [o, l]) : (this.topHull = [o, l], this.bottomHull = [o, r, l]);
   }
   get startDistance() {
     return this.distances[0];
@@ -361,13 +355,13 @@ class Bn {
     C(this, "topHull", []);
     C(this, "bottomHull", []);
     this.distances = n;
-    const [e, s, i, o] = n, r = [0, e], l = [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, o] = n, r = [0, e], l = [1 / 3, s], c = [2 / 3, i], a = [1, o], f = o - e, u = e, h = s - (f * (1 / 3) + u), p = i - (f * (2 / 3) + u);
     let d = null, m = null;
     if (h * p < 0)
-      d = [r, l, a], m = [r, u, a];
+      d = [r, l, a], m = [r, c, a];
     else {
       const w = h / p;
-      w >= 2 ? (d = [r, l, a], m = [r, a]) : w <= 0.5 ? (d = [r, u, a], m = [r, a]) : (d = [r, l, u, a], m = [r, a]);
+      w >= 2 ? (d = [r, l, a], m = [r, a]) : w <= 0.5 ? (d = [r, c, a], m = [r, a]) : (d = [r, l, c, a], m = [r, a]);
     }
     h < 0 && ([d, m] = [m, d]), this.topHull = d, this.bottomHull = m;
   }
@@ -379,7 +373,7 @@ class Bn {
   }
 }
 function St(t, n) {
-  const e = En(n, t), s = xt(
+  const e = Fn(n, t), s = xt(
     e.topHull,
     t.negativeThickness
   ), i = xt(
@@ -387,21 +381,21 @@ function St(t, n) {
     t.positiveThickness
   ), o = e.endDistance >= t.negativeThickness && e.endDistance <= t.positiveThickness;
   if (!s.length && !i.length)
-    return o ? new H("start", "end") : null;
+    return o ? new Y("start", "end") : null;
   if (s.length === 1 && i.length === 1)
-    return new H(s[0], i[0]);
+    return new Y(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 r = s.length ? s : i;
-  return r.length === 2 ? new H(r[0], r[1]) : o ? new H(r[0], "end") : new H("start", r[0]);
+  return r.length === 2 ? new Y(r[0], r[1]) : o ? new Y(r[0], "end") : new Y("start", r[0]);
 }
 function yt(t, n) {
   const e = In(t), s = St(e, n);
   if (!s)
     return null;
-  const i = Fn(t), o = St(
+  const i = En(t), o = St(
     i,
     n
   );
@@ -410,16 +404,14 @@ function yt(t, n) {
 const W = (t) => t instanceof A ? $(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, r = n, l = W(o), u = W(r);
+  let o = t, r = n, l = W(o), c = W(r);
   for (let a = 0; a < s; a++) {
     const f = l > i ? yt(r, o) : o;
-    if (!f)
-      return [];
-    const c = W(f), h = u > i ? yt(f, r) : r;
-    if (!h)
-      return [];
+    if (!f) return [];
+    const u = W(f), h = c > i ? yt(f, r) : r;
+    if (!h) return [];
     const p = W(h);
-    if (c <= i && p <= i)
+    if (u <= i && p <= i)
       return [
         f.boundingBox.intersection(h.boundingBox).center
       ];
@@ -427,8 +419,8 @@ function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
       return [f.firstPoint];
     if (g(h.firstPoint, h.lastPoint) && f.isOnSegment(h.firstPoint))
       return [h.firstPoint];
-    if (c > 0.8 * l && p > 0.8 * u)
-      if (c / l > p / u) {
+    if (u > 0.8 * l && p > 0.8 * c)
+      if (u / l > p / c) {
         const [d, m] = f.splitAtParameters([
           0.5
         ]);
@@ -459,7 +451,7 @@ function D(t, n, e = 1e-9, { maxIterations: s = 100 } = {}) {
           e
         );
       }
-    o = f, r = h, l = c, u = p;
+    o = f, r = h, l = u, c = p;
   }
   throw new Error("Bézier clip: Maximum number of iterations reached");
 }
@@ -736,13 +728,12 @@ class Nt extends lt {
 function Ln(t, n = "Stroke") {
   Vt(t.length).forEach(
     ([e, s]) => {
-      if (e === s)
-        return;
+      if (e === s) return;
       const i = t[e], o = t[s], r = K(i, o), l = Math.max(i.precision, o.precision);
       if (r.count !== 0) {
         if (r.count === 1 && !r.overlaps.length) {
-          const u = e - s, a = r.intersections[0];
-          if (u === 1 && g(i.firstPoint, a, l) || u === -1 && g(i.lastPoint, a, l) || u === t.length - 1 && g(i.lastPoint, a, l) && g(o.firstPoint, a, l) || -u === t.length - 1 && g(i.firstPoint, a, l) && g(o.lastPoint, a, l))
+          const c = e - s, a = r.intersections[0];
+          if (c === 1 && g(i.firstPoint, a, l) || c === -1 && g(i.lastPoint, a, l) || c === t.length - 1 && g(i.lastPoint, a, l) && g(o.firstPoint, a, l) || -c === t.length - 1 && g(i.firstPoint, a, l) && g(o.lastPoint, a, l))
             return;
         }
         if (!(r.count === 2 && t.length === 2 && (g(
@@ -859,8 +850,7 @@ const zn = (t, n) => {
   if (e === "parallel")
     return 0;
   const { intersectionParam1: s, intersectionParam2: i } = e;
-  if (!n.isValidParameter(s) || i <= -n.precision)
-    return 0;
+  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;
@@ -882,18 +872,16 @@ class ut {
 }
 const qn = (t, n) => {
   const e = n.precision, s = Math.abs(t[1] - n.center[1]);
-  if (s > n.radius + e)
-    return 0;
+  if (s > n.radius + e) return 0;
   const i = fn(t, n.center), o = n.radius * n.radius, r = e * e;
   if (Math.abs(i - o) < r && n.isOnSegment(t))
     return 0;
   const l = i - o > r;
-  if (l && n.center[0] < t[0])
-    return 0;
-  const u = Math.sqrt(
+  if (l && n.center[0] < t[0]) return 0;
+  const c = Math.sqrt(
     n.radius * n.radius - s * s
   ), a = new ut(n);
-  return a.update([n.center[0] + u, t[1]]), l && a.update([n.center[0] - u, t[1]]), a.count;
+  return a.update([n.center[0] + c, t[1]]), l && a.update([n.center[0] - c, t[1]]), a.count;
 }, Dn = (t, n) => {
   const e = n.boundingBox.xMax + n.boundingBox.width / 2, s = new y(t, [e, t[1]]), i = new ut(n);
   return et(s, n).forEach((o) => {
@@ -980,7 +968,7 @@ const Un = [
 function jn(t) {
   return Un.some((n) => t instanceof n);
 }
-function Yt(t) {
+function Ht(t) {
   if (t instanceof y)
     return {
       type: t.segmentType,
@@ -1026,7 +1014,7 @@ function Yt(t) {
 function it(t) {
   return {
     type: "LOOP",
-    segments: t.segments.map(Yt)
+    segments: t.segments.map(Ht)
   };
 }
 function $t(t) {
@@ -1036,7 +1024,7 @@ function $t(t) {
     holes: t.holes.map(it)
   };
 }
-function Yn(t) {
+function Hn(t) {
   return {
     type: "DIAGRAM",
     figures: t.figures.map($t)
@@ -1044,13 +1032,13 @@ function Yn(t) {
 }
 function Mt(t) {
   if (t instanceof _)
-    return Yn(t);
+    return Hn(t);
   if (t instanceof v)
     return $t(t);
   if (t instanceof O)
     return it(t);
   if (jn(t))
-    return Yt(t);
+    return Ht(t);
   throw new Error("Unknown shape type");
 }
 class $n {
@@ -1064,15 +1052,13 @@ class $n {
     let s = this.length++;
     for (; s > 0; ) {
       const i = s - 1 >> 1, o = this.values[i];
-      if (e >= o)
-        break;
+      if (e >= o) break;
       this.ids[s] = this.ids[i], this.values[s] = o, s = i;
     }
     this.ids[s] = n, this.values[s] = e;
   }
   pop() {
-    if (this.length === 0)
-      return;
+    if (this.length === 0) return;
     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;
@@ -1080,11 +1066,10 @@ class $n {
       for (; o < i; ) {
         let r = (o << 1) + 1;
         const l = r + 1;
-        let u = this.ids[r], a = this.values[r];
+        let c = this.ids[r], a = this.values[r];
         const f = this.values[l];
-        if (l < this.length && f < a && (r = l, u = this.ids[l], a = f), a >= s)
-          break;
-        this.ids[o] = u, this.values[o] = a, o = r;
+        if (l < this.length && f < a && (r = l, c = this.ids[l], a = f), a >= s) break;
+        this.ids[o] = c, this.values[o] = a, o = r;
       }
       this.ids[o] = e, this.values[o] = s;
     }
@@ -1102,50 +1087,68 @@ class $n {
     this.ids.length = this.values.length = this.length;
   }
 }
-const At = [
-  Int8Array,
-  Uint8Array,
-  Uint8ClampedArray,
-  Int16Array,
-  Uint16Array,
-  Int32Array,
-  Uint32Array,
-  Float32Array,
-  Float64Array
-], nt = 3;
+const At = [Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array, Int32Array, Uint32Array, Float32Array, Float64Array], nt = 3;
 class at {
-  static from(n) {
+  /**
+   * Recreate a Flatbush index from raw `ArrayBuffer` or `SharedArrayBuffer` data.
+   * @param {ArrayBuffer | SharedArrayBuffer} data
+   * @param {number} [byteOffset=0] byte offset to the start of the Flatbush buffer in the referenced ArrayBuffer.
+   * @returns {Flatbush} index
+   */
+  static from(n, e = 0) {
+    if (e % 8 !== 0)
+      throw new Error("byteOffset must be 8-byte aligned.");
     if (!n || n.byteLength === void 0 || n.buffer)
       throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
-    const [e, s] = new Uint8Array(n, 0, 2);
-    if (e !== 251)
+    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.");
-    if (s >> 4 !== nt)
-      throw new Error(`Got v${s >> 4} data when expected v${nt}.`);
-    const [i] = new Uint16Array(n, 2, 1), [o] = new Uint32Array(n, 4, 1);
-    return new at(o, i, At[s & 15], void 0, n);
-  }
-  constructor(n, e = 16, s = Float64Array, i = ArrayBuffer, o) {
-    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);
-    let r = n, l = r;
-    this._levelBounds = [r * 4];
+    const o = i >> 4;
+    if (o !== nt)
+      throw new Error(`Got v${o} data when expected v${nt}.`);
+    const r = At[i & 15];
+    if (!r)
+      throw new Error("Unrecognized array type.");
+    const [l] = new Uint16Array(n, e + 2, 1), [c] = new Uint32Array(n, e + 4, 1);
+    return new at(c, l, r, void 0, n, e);
+  }
+  /**
+   * Create a Flatbush index that will hold a given number of items.
+   * @param {number} numItems
+   * @param {number} [nodeSize=16] Size of the tree node (16 by default).
+   * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).
+   * @param {ArrayBufferConstructor | SharedArrayBufferConstructor} [ArrayBufferType=ArrayBuffer] The array buffer type used to store data (`ArrayBuffer` by default).
+   * @param {ArrayBuffer | SharedArrayBuffer} [data] (Only used internally)
+   * @param {number} [byteOffset=0] (Only used internally)
+   */
+  constructor(n, e = 16, s = Float64Array, i = ArrayBuffer, o, r = 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 = r;
+    let l = n, c = l;
+    this._levelBounds = [l * 4];
     do
-      r = Math.ceil(r / this.nodeSize), l += r, this._levelBounds.push(l * 4);
-    while (r !== 1);
-    this.ArrayType = s || Float64Array, this.IndexArrayType = l < 16384 ? Uint16Array : Uint32Array;
-    const u = At.indexOf(this.ArrayType), a = l * 4 * this.ArrayType.BYTES_PER_ELEMENT;
-    if (u < 0)
+      l = Math.ceil(l / this.nodeSize), c += l, this._levelBounds.push(c * 4);
+    while (l !== 1);
+    this.ArrayType = s, this.IndexArrayType = c < 16384 ? Uint16Array : Uint32Array;
+    const a = At.indexOf(this.ArrayType), f = c * 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, 8, l * 4), this._indices = new this.IndexArrayType(this.data, 8 + a, l), this._pos = l * 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 + a + l * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, l * 4), this._indices = new this.IndexArrayType(this.data, 8 + a, l), 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, (nt << 4) + u]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new $n();
-  }
-  add(n, e, s, i) {
+    o && o.byteLength !== void 0 && !o.buffer ? (this.data = o, this._boxes = new this.ArrayType(this.data, r + 8, c * 4), this._indices = new this.IndexArrayType(this.data, r + 8 + f, c), this._pos = c * 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 + c * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, c * 4), this._indices = new this.IndexArrayType(this.data, 8 + f, c), 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, (nt << 4) + a]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = n), this._queue = new $n();
+  }
+  /**
+   * Add a given rectangle to the index.
+   * @param {number} minX
+   * @param {number} minY
+   * @param {number} maxX
+   * @param {number} maxY
+   * @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, r = this._boxes;
     return this._indices[o] = o, r[this._pos++] = n, r[this._pos++] = e, r[this._pos++] = s, r[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;
   }
+  /** Perform indexing of the added rectangles. */
   finish() {
     if (this._pos >> 2 !== this.numItems)
       throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
@@ -1154,63 +1157,79 @@ class at {
       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 = (1 << 16) - 1;
+    const e = this.maxX - this.minX || 1, s = this.maxY - this.minY || 1, i = new Uint32Array(this.numItems), o = 65535;
     for (let r = 0, l = 0; r < this.numItems; r++) {
-      const u = n[l++], a = n[l++], f = n[l++], c = n[l++], h = Math.floor(o * ((u + f) / 2 - this.minX) / e), p = Math.floor(o * ((a + c) / 2 - this.minY) / s);
+      const c = n[l++], a = n[l++], f = n[l++], u = n[l++], h = Math.floor(o * ((c + f) / 2 - this.minX) / e), p = Math.floor(o * ((a + u) / 2 - this.minY) / s);
       i[r] = Xn(h, p);
     }
     ot(i, n, this._indices, 0, this.numItems - 1, this.nodeSize);
     for (let r = 0, l = 0; r < this._levelBounds.length - 1; r++) {
-      const u = this._levelBounds[r];
-      for (; l < u; ) {
+      const c = this._levelBounds[r];
+      for (; l < c; ) {
         const a = l;
-        let f = n[l++], c = n[l++], h = n[l++], p = n[l++];
-        for (let d = 1; d < this.nodeSize && l < u; d++)
-          f = Math.min(f, n[l++]), c = Math.min(c, n[l++]), h = Math.max(h, n[l++]), p = Math.max(p, n[l++]);
-        this._indices[this._pos >> 2] = a, n[this._pos++] = f, n[this._pos++] = c, n[this._pos++] = h, n[this._pos++] = p;
+        let f = n[l++], u = n[l++], h = n[l++], p = n[l++];
+        for (let d = 1; d < this.nodeSize && l < c; d++)
+          f = Math.min(f, n[l++]), u = Math.min(u, n[l++]), h = Math.max(h, n[l++]), p = Math.max(p, n[l++]);
+        this._indices[this._pos >> 2] = a, n[this._pos++] = f, n[this._pos++] = u, n[this._pos++] = h, n[this._pos++] = p;
       }
     }
   }
+  /**
+   * Search the index by a bounding box.
+   * @param {number} minX
+   * @param {number} minY
+   * @param {number} maxX
+   * @param {number} maxY
+   * @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) {
     if (this._pos !== this._boxes.length)
       throw new Error("Data not yet indexed - call index.finish().");
     let r = this._boxes.length - 4;
-    const l = [], u = [];
+    const l = [], c = [];
     for (; r !== void 0; ) {
-      const a = Math.min(r + this.nodeSize * 4, Ft(r, this._levelBounds));
+      const a = Math.min(r + this.nodeSize * 4, Et(r, this._levelBounds));
       for (let f = r; 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;
-        r >= this.numItems * 4 ? l.push(c) : (o === void 0 || o(c)) && u.push(c);
+        if (s < this._boxes[f] || i < this._boxes[f + 1] || n > this._boxes[f + 2] || e > this._boxes[f + 3]) continue;
+        const u = this._indices[f >> 2] | 0;
+        r >= this.numItems * 4 ? l.push(u) : (o === void 0 || o(u)) && c.push(u);
       }
       r = l.pop();
     }
-    return u;
-  }
+    return c;
+  }
+  /**
+   * Search items in order of distance from the given point.
+   * @param {number} x
+   * @param {number} y
+   * @param {number} [maxResults=Infinity]
+   * @param {number} [maxDistance=Infinity]
+   * @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) {
     if (this._pos !== this._boxes.length)
       throw new Error("Data not yet indexed - call index.finish().");
     let r = this._boxes.length - 4;
-    const l = this._queue, u = [], a = i * i;
-    for (; r !== void 0; ) {
-      const f = Math.min(r + this.nodeSize * 4, Ft(r, this._levelBounds));
-      for (let c = r; c < f; c += 4) {
-        const h = this._indices[c >> 2] | 0, p = It(n, this._boxes[c], this._boxes[c + 2]), d = It(e, this._boxes[c + 1], this._boxes[c + 3]), m = p * p + d * d;
-        r >= this.numItems * 4 ? l.push(h << 1, m) : (o === void 0 || o(h)) && l.push((h << 1) + 1, m);
+    const l = this._queue, c = [], a = i * i;
+    t: for (; r !== void 0; ) {
+      const f = Math.min(r + this.nodeSize * 4, Et(r, this._levelBounds));
+      for (let u = r; u < f; u += 4) {
+        const h = this._indices[u >> 2] | 0, p = It(n, this._boxes[u], this._boxes[u + 2]), d = It(e, this._boxes[u + 1], this._boxes[u + 3]), m = p * p + d * d;
+        m > a || (r >= this.numItems * 4 ? l.push(h << 1, m) : (o === void 0 || o(h)) && l.push((h << 1) + 1, m));
       }
       for (; l.length && l.peek() & 1; )
-        if (l.peekValue() > a || (u.push(l.pop() >> 1), u.length === s))
-          return l.clear(), u;
-      r = l.pop() >> 1;
+        if (l.peekValue() > a || (c.push(l.pop() >> 1), c.length === s)) break t;
+      r = l.length ? l.pop() >> 1 : void 0;
     }
-    return l.clear(), u;
+    return l.clear(), c;
   }
 }
 function It(t, n, e) {
   return t < n ? n - t : t <= e ? 0 : t - e;
 }
-function Ft(t, n) {
+function Et(t, n) {
   let e = 0, s = n.length - 1;
   for (; e < s; ) {
     const i = e + s >> 1;
@@ -1219,42 +1238,38 @@ function Ft(t, n) {
   return n[e];
 }
 function ot(t, n, e, s, i, o) {
-  if (Math.floor(s / o) >= Math.floor(i / o))
-    return;
+  if (Math.floor(s / o) >= Math.floor(i / o)) return;
   const r = t[s + i >> 1];
-  let l = s - 1, u = i + 1;
+  let l = s - 1, c = i + 1;
   for (; ; ) {
     do
       l++;
     while (t[l] < r);
     do
-      u--;
-    while (t[u] > r);
-    if (l >= u)
-      break;
-    Hn(t, n, e, l, u);
+      c--;
+    while (t[c] > r);
+    if (l >= c) break;
+    Yn(t, n, e, l, c);
   }
-  ot(t, n, e, s, u, o), ot(t, n, e, u + 1, i, o);
+  ot(t, n, e, s, c, o), ot(t, n, e, c + 1, i, o);
 }
-function Hn(t, n, e, s, i) {
+function Yn(t, n, e, s, i) {
   const o = t[s];
   t[s] = t[i], t[i] = o;
-  const r = 4 * s, l = 4 * i, u = n[r], a = n[r + 1], f = n[r + 2], c = n[r + 3];
-  n[r] = n[l], n[r + 1] = n[l + 1], n[r + 2] = n[l + 2], n[r + 3] = n[l + 3], n[l] = u, n[l + 1] = a, n[l + 2] = f, n[l + 3] = c;
+  const r = 4 * s, l = 4 * i, c = n[r], a = n[r + 1], f = n[r + 2], u = n[r + 3];
+  n[r] = n[l], n[r + 1] = n[l + 1], n[r + 2] = n[l + 2], n[r + 3] = n[l + 3], n[l] = c, n[l + 1] = a, n[l + 2] = f, n[l + 3] = u;
   const h = e[s];
   e[s] = e[i], e[i] = h;
 }
 function Xn(t, n) {
-  let e = t ^ n, s = 65535 ^ e, i = 65535 ^ (t | n), o = t & (n ^ 65535), r = e | s >> 1, l = e >> 1 ^ e, u = i >> 1 ^ s & o >> 1 ^ i, a = e & i >> 1 ^ o >> 1 ^ o;
-  e = r, s = l, i = u, o = a, r = e & e >> 2 ^ s & s >> 2, l = e & s >> 2 ^ s & (e ^ s) >> 2, u ^= e & i >> 2 ^ s & o >> 2, a ^= s & i >> 2 ^ (e ^ s) & o >> 2, e = r, s = l, i = u, o = a, r = e & e >> 4 ^ s & s >> 4, l = e & s >> 4 ^ s & (e ^ s) >> 4, u ^= e & i >> 4 ^ s & o >> 4, a ^= s & i >> 4 ^ (e ^ s) & o >> 4, e = r, s = l, 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;
-  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 Ht(t, n = 1e-7) {
-  if (t.length === 0)
-    return [];
-  if (t.length === 1)
-    return [t];
+  let e = t ^ n, s = 65535 ^ e, i = 65535 ^ (t | n), o = t & (n ^ 65535), r = e | s >> 1, l = e >> 1 ^ e, c = i >> 1 ^ s & o >> 1 ^ i, a = e & i >> 1 ^ o >> 1 ^ o;
+  e = r, s = l, i = c, o = a, r = e & e >> 2 ^ s & s >> 2, l = e & s >> 2 ^ s & (e ^ s) >> 2, c ^= e & i >> 2 ^ s & o >> 2, a ^= s & i >> 2 ^ (e ^ s) & o >> 2, e = r, s = l, i = c, o = a, r = e & e >> 4 ^ s & s >> 4, l = e & s >> 4 ^ s & (e ^ s) >> 4, c ^= e & i >> 4 ^ s & o >> 4, a ^= s & i >> 4 ^ (e ^ s) & o >> 4, e = r, s = l, i = c, o = a, c ^= e & i >> 8 ^ s & o >> 8, a ^= s & i >> 8 ^ (e ^ s) & o >> 8, e = c ^ c >> 1, s = a ^ a >> 1;
+  let f = t ^ n, u = 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, u = (u | u << 8) & 16711935, u = (u | u << 4) & 252645135, u = (u | u << 2) & 858993459, u = (u | u << 1) & 1431655765, (u << 1 | f) >>> 0;
+}
+function Yt(t, n = 1e-7) {
+  if (t.length === 0) return [];
+  if (t.length === 1) return [t];
   const e = new at(t.length);
   t.forEach((o) => {
     const [r, l] = o.firstPoint;
@@ -1262,31 +1277,30 @@ function Ht(t, n = 1e-7) {
   }), e.finish();
   const s = [], i = /* @__PURE__ */ new Set();
   return t.forEach((o, r) => {
-    if (i.has(r))
-      return;
+    if (i.has(r)) return;
     const l = [o];
-    let u = r;
+    let c = r;
     i.add(r);
     let a = t.length;
     for (; ; ) {
       if (a-- < 0)
         throw new Error("Infinite loop detected");
-      const f = l[l.length - 1].lastPoint, [c, h] = f, p = e.search(
-        c - n,
+      const f = l[l.length - 1].lastPoint, [u, h] = f, p = e.search(
+        u - n,
         h - n,
-        c + n,
+        u + n,
         h + n
-      ), d = (x) => Math.abs((u - x) % t.length), m = p.filter((x) => !i.has(x)).map((x) => [
+      ), d = (x) => Math.abs((c - x) % t.length), m = p.filter((x) => !i.has(x)).map((x) => [
         t[x],
         x,
         d(x)
-      ]).sort(([, , x], [, , E]) => d(x) - d(E));
+      ]).sort(([, , x], [, , F]) => d(x) - d(F));
       if (m.length === 0) {
         s.push(l);
         break;
       }
       const [P, w] = m[0];
-      l.push(P), i.add(w), u = w;
+      l.push(P), i.add(w), c = w;
     }
   }), s;
 }
@@ -1328,12 +1342,11 @@ class v extends lt {
   }
   overlappingStrands(e) {
     const s = e instanceof v ? e.allLoops : [e], i = this.allLoops.flatMap((o) => s.flatMap((r) => o.overlappingSegments(r)));
-    return Ht(i).map((o) => new B(o));
+    return Yt(i).map((o) => new B(o));
   }
 }
 function Gn(t, n = []) {
-  if (!t)
-    throw new Error("Figure must have a contour");
+  if (!t) throw new Error("Figure must have a contour");
   for (const [e, s] of st([t, ...n]))
     if (e.intersects(s))
       throw new Error("Loops in a figure must not intersect");
@@ -1369,15 +1382,13 @@ const Qn = (t) => {
   );
   return [e, ...s];
 }, ft = (t) => {
-  if (!t.length)
-    return [];
+  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 ? Wn(n, t) : Jn(e, t);
 };
 function X(t) {
   return Qn(t).map(Xt).flatMap(ft).map((e) => {
-    if (e.length === 1)
-      return new v(e[0].loop);
+    if (e.length === 1) return new v(e[0].loop);
     e.sort((o, r) => o.isIn.length - r.isIn.length);
     const [s, ...i] = e.map(({ loop: o }) => o);
     return new v(s, i);
@@ -1390,7 +1401,7 @@ function Kn(t, n) {
       e.push([s, i]);
   return e;
 }
-function* Et(t, n, e) {
+function* Ft(t, n, e) {
   const s = (r) => n.some((l) => g(l, r.lastPoint)), i = (r) => e.some((l) => r.isSame(l));
   let o = [];
   for (const r of t)
@@ -1405,10 +1416,10 @@ const vt = (t, n) => {
   const s = (l) => g(l.firstPoint, n.firstPoint) && g(l.lastPoint, n.lastPoint);
   let i = t.findIndex(s);
   if (i === -1) {
-    const l = t.map((u) => u.reverse());
+    const l = t.map((c) => c.reverse());
     if (l.reverse(), i = l.findIndex(s), i === -1)
       throw console.error(
-        l.map((u) => u.repr),
+        l.map((c) => c.repr),
         n.repr
       ), new Error("Failed to rotate to segment start");
     e = l;
@@ -1436,26 +1447,24 @@ function te(t, n, e) {
         e
       );
       s.push(...P), o[p].push(...P), r[m].push(...P), i.push(...w);
-      const x = w.flatMap((E) => [
-        E.firstPoint,
-        E.lastPoint
+      const x = w.flatMap((F) => [
+        F.firstPoint,
+        F.lastPoint
       ]);
       s.push(...x), o[p].push(...x), r[m].push(...x);
     });
-  }), s = U(s, e), !s.length || s.length === 1)
-    return null;
+  }), s = U(s, e), !s.length || s.length === 1) return null;
   const l = ([h, p]) => p.length ? h.splitAt(p) : [h];
-  let u = N([t.segments, o]).flatMap(l), a = N([n.segments, r]).flatMap(l);
+  let c = N([t.segments, o]).flatMap(l), a = N([n.segments, r]).flatMap(l);
   if (s = Zn(
     s,
-    u,
+    c,
     n
-  ), !s.length && !i.length)
-    return null;
+  ), !s.length && !i.length) return null;
   if (i.length) {
     const h = i[0];
-    u = Bt(
-      u,
+    c = Bt(
+      c,
       h
     ), a = Bt(
       a,
@@ -1463,25 +1472,25 @@ function te(t, n, e) {
     );
   } else {
     const h = s[0];
-    u = vt(u, h), a = vt(a, h);
+    c = vt(c, h), a = vt(a, h);
   }
   let f = Array.from(
-    Et(
-      u,
+    Ft(
+      c,
       s,
       i
     )
-  ), c = Array.from(
-    Et(
+  ), u = Array.from(
+    Ft(
       a,
       s,
       i
     )
   );
   return (!g(
-    c[0].lastPoint,
+    u[0].lastPoint,
     f[0].lastPoint
-  ) || i.length > 0 && c[0].segmentsCount !== 1) && (c = c.map((h) => h.reverse()).reverse(), g(c[0].lastPoint, f[0].lastPoint) || (f = f.map((h) => h.reverse()).reverse())), N([f, c]).map(([h, p]) => h.segmentsCount === 1 && i.some((d) => h.segments[0].isSame(d)) ? [h, "same"] : [h, p]);
+  ) || i.length > 0 && u[0].segmentsCount !== 1) && (u = u.map((h) => h.reverse()).reverse(), g(u[0].lastPoint, f[0].lastPoint) || (f = f.map((h) => h.reverse()).reverse())), N([f, u]).map(([h, p]) => h.segmentsCount === 1 && i.some((d) => h.segments[0].isSame(d)) ? [h, "same"] : [h, p]);
 }
 function kt(t) {
   let n = t[0];
@@ -1505,8 +1514,7 @@ function ne(t, n) {
   return n[0] !== 0 && (s = s.concat(t.slice(0, n[0]))), e.push(kt(s)), e;
 }
 function ee(t) {
-  if (!t.length)
-    return [];
+  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));
@@ -1516,12 +1524,11 @@ function ee(t) {
   try {
     return ne(t, s);
   } catch {
-    return Ht(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => g(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new O(o));
+    return Yt(t.flatMap((o) => o.segments)).filter((o) => o.length > 1).filter((o) => g(o[0].firstPoint, o.at(-1).lastPoint)).map((o) => new O(o));
   }
 }
 const _t = (t, n) => {
-  if (t.length === 0)
-    return [n];
+  if (t.length === 0) return [n];
   const e = t.at(-1);
   return g(e.lastPoint, n.firstPoint) ? t.slice(0, -1).concat([e.extend(n)]) : g(e.lastPoint, n.lastPoint) ? t.slice(0, -1).concat([e.extend(n.reverse())]) : t.concat([n]);
 }, se = (t, n) => t.length === 0 ? [n] : g(t[0].firstPoint, n.lastPoint) ? [n.extend(t[0])].concat(t.slice(1)) : [n].concat(t);
@@ -1531,28 +1538,28 @@ function ht(t, n, {
 }) {
   const i = te(t, n);
   if (!i) {
-    const u = t.segments[0].midPoint, a = n.contains(u), f = n.segments[0].midPoint, c = t.contains(f);
+    const c = t.segments[0].midPoint, a = n.contains(c), f = n.segments[0].midPoint, u = t.contains(f);
     return {
       identical: !1,
       firstCurveInSecond: a,
-      secondCurveInFirst: c
+      secondCurveInFirst: u
     };
   }
-  if (i.every(([, u]) => u === "same"))
+  if (i.every(([, c]) => c === "same"))
     return { identical: !0 };
   let o = null, r = null;
-  const l = i.flatMap(([u, a]) => {
-    let f = [], c = 0;
+  const l = i.flatMap(([c, a]) => {
+    let f = [], u = 0;
     if (a === "same")
-      return r === 1 ? (r = 1, u) : r === 2 || r === 0 ? (r = null, []) : r === null ? (o ? o = o.extend(u) : o = u, []) : (console.error("weird situation"), []);
-    const h = u.segments[0].midPoint, p = n.contains(h);
-    (e === "keep" && p || e === "remove" && !p) && (c += 1, f = _t(f, u));
+      return r === 1 ? (r = 1, c) : r === 2 || r === 0 ? (r = null, []) : r === null ? (o ? o = o.extend(c) : o = c, []) : (console.error("weird situation"), []);
+    const h = c.segments[0].midPoint, p = n.contains(h);
+    (e === "keep" && p || e === "remove" && !p) && (u += 1, f = _t(f, c));
     const d = a.segments[0].midPoint, m = t.contains(d);
     if (s === "keep" && m || s === "remove" && !m) {
       const P = a;
-      c += 1, c === 2 && f.length ? (f = _t(f, P), o = null) : f = [P];
+      u += 1, u === 2 && f.length ? (f = _t(f, P), o = null) : f = [P];
     }
-    return r === null && c === 1 && o && (f = se(f, o)), c === 1 && (r = c, o = null), f.length ? f : (o = null, []);
+    return r === null && u === 1 && o && (f = se(f, o)), u === 1 && (r = u, o = null), f.length ? f : (o = null, []);
   });
   return ee(l);
 }
@@ -1580,16 +1587,14 @@ function oe(t) {
   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((r, l) => {
-      const u = o.current, a = i + l + 1;
-      if (o.fusedWith.has(a))
-        return;
-      let f = [r], c = !1;
-      if (n.has(a) && (f = n.get(a).current, c = !0), !u.some(
+      const c = o.current, a = i + l + 1;
+      if (o.fusedWith.has(a)) return;
+      let f = [r], u = !1;
+      if (n.has(a) && (f = n.get(a).current, u = !0), !c.some(
         (d) => f.some((m) => d.intersects(m))
-      ))
-        return;
+      )) return;
       let p;
-      u.length > 1 || f.length > 1 ? p = G(u, f) : p = Gt(u[0], f[0]), o.fusedWith.add(a), o.current = p, c || n.set(a, o);
+      c.length > 1 || f.length > 1 ? p = G(c, f) : p = Gt(c[0], f[0]), o.fusedWith.add(a), o.current = p, u || n.set(a, o);
     });
   }), e.flatMap(({ current: s }) => s);
 }
@@ -1631,8 +1636,7 @@ function tt(t, n) {
 }
 function re(t, n) {
   const e = pt(t.contour, n.contour);
-  if (!e.length)
-    return [];
+  if (!e.length) return [];
   let s = X(e);
   return s = Q(
     s,
@@ -1643,10 +1647,8 @@ function re(t, n) {
   );
 }
 function G(t, n) {
-  if (!t.length)
-    return n;
-  if (!n.length)
-    return t;
+  if (!t.length) return n;
+  if (!n.length) return t;
   if (t.length === 1 && n.length > 1 || n.length === 1 && t.length > 1)
     return oe([...t, ...n]);
   if (t.length > 1 && n.length > 1) {
@@ -1658,10 +1660,8 @@ function G(t, n) {
   return t.length === 1 && n.length === 1 ? Gt(t[0], n[0]) : [];
 }
 function Q(t, n) {
-  if (!t.length)
-    return [];
-  if (!n.length)
-    return t;
+  if (!t.length) return [];
+  if (!n.length) return t;
   if (t.length === 1 && n.length === 1)
     return tt(t[0], n[0]);
   if (t.length > 1)
@@ -1685,8 +1685,7 @@ class _ extends lt {
     return this.figures.length === 0;
   }
   get boundingBox() {
-    if (this.isEmpty)
-      return new hn();
+    if (this.isEmpty) return new hn();
     if (this._boundingBox === null) {
       let e = this.figures[0].boundingBox;
       for (const s of this.figures.slice(1))
@@ -1734,17 +1733,17 @@ export {
   v as F,
   O as L,
   B as S,
-  G as a,
-  qt as b,
+  K as a,
+  G as b,
   Q as c,
-  Ht as d,
-  jn as e,
-  K as f,
-  Mt as g,
-  ae as h,
+  qt as d,
+  Yt as e,
+  ae as f,
+  jn as g,
+  Mt as h,
   rt as i,
   J as l,
   pn as p,
-  Et as s
+  Ft as s
 };
-//# sourceMappingURL=Diagram-2450b2e6.js.map
+//# sourceMappingURL=models-BjaFYsN2.js.map