pantograph2d 0.11.0 → 0.11.1

package/dist/pantograph.js

@@ -1,18 +1,18 @@
 var Ut = Object.defineProperty;
 var Vt = (t, n, e) => n in t ? Ut(t, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : t[n] = e;
-var M = (t, n, e) => Vt(t, typeof n != "symbol" ? n + "" : n, e);
-import { o as Ht, D as U, f as Mt } from "./draw-BJW5kfm9.js";
-import { a as oe, d as ce } from "./draw-BJW5kfm9.js";
-import { F as m, L as P, D as h, a as W, s as Kt, b as Nt, c as qt, i as Xt, S as b, l as Jt, p as Qt, d as Yt, e as St, g as It } from "./models-DdZq-waE.js";
-import { h as fe } from "./models-DdZq-waE.js";
-import { l as Zt, z as Wt, m as jt, e as E, n as j, b as F, a as tn, s as nn, o as en, q as At, L as v, A as y, C as _, p as it, u as N, d as q, T as rn, g as A, E as vt, Q as bt, t as sn, c as on, D as Lt, v as Et, B as cn } from "./QuadraticBezier-B2g_Iyyl.js";
-import { s as an, a as fn, b as un, c as ln, d as hn, w as ot } from "./svg-D8vwkQf7.js";
+var I = (t, n, e) => Vt(t, typeof n != "symbol" ? n + "" : n, e);
+import { o as Ht, D as U, f as It } from "./draw-DzKVhurb.js";
+import { a as oe, d as ce } from "./draw-DzKVhurb.js";
+import { F as m, L as P, D as h, a as W, s as Kt, b as Nt, c as qt, i as Xt, S as b, l as Jt, p as Qt, d as Yt, e as Mt, g as St } from "./models-BHeLX0dj.js";
+import { h as fe } from "./models-BHeLX0dj.js";
+import { l as Zt, z as Wt, m as jt, e as E, n as j, b as F, a as tn, s as nn, o as en, q as At, L as v, A as y, C as _, p as it, u as N, d as q, T as rn, g as A, E as vt, Q as bt, t as sn, c as on, D as Lt, v as Et, B as cn } from "./QuadraticBezier-BeY2TXKH.js";
+import { s as an, a as fn, b as un, c as ln, d as hn, w as ot } from "./svg-BTO7h1ix.js";
 function x(t) {
-  if (t instanceof m)
+  if (m.isInstance(t))
     return [t];
-  if (t instanceof P)
+  if (P.isInstance(t))
     return [new m(t)];
-  if (t instanceof h)
+  if (h.isInstance(t))
     return t.figures;
   throw new Error("Unknown shape");
 }
@@ -99,9 +99,9 @@ function Xn(t, n) {
   );
 }
 function Jn(t, n, e = !0) {
-  if (n instanceof P)
+  if (P.isInstance(n))
     return tt(t, n, e);
-  if (n instanceof m)
+  if (m.isInstance(n))
     return ct(t, n, e);
   let r = [new b([...t.segments])];
   return n.figures.forEach((s) => {
@@ -109,9 +109,9 @@ function Jn(t, n, e = !0) {
   }), r;
 }
 function Qn(t, n, e = !1) {
-  if (n instanceof P)
+  if (P.isInstance(n))
     return nt(t, n, e);
-  if (n instanceof m)
+  if (m.isInstance(n))
     return at(t, n, e);
   let r = [new b([...t.segments])];
   return n.figures.forEach((s) => {
@@ -217,9 +217,9 @@ function wn(t, n, e) {
   const r = Pn(t, n, e);
   r < 0 ? t.splice(-(r + 1), 0, n) : t.splice(r, 0, n);
 }
-class Mn {
+class In {
   constructor() {
-    M(this, "buckets");
+    I(this, "buckets");
     this.buckets = [];
   }
   addInterval(n) {
@@ -258,26 +258,26 @@ class Mn {
     return n;
   }
 }
-class Sn {
+class Mn {
   constructor(n, e) {
-    M(this, "diagonal");
-    M(this, "diagonalBucketIndex");
-    M(this, "xLength");
-    M(this, "yLength");
-    M(this, "index");
+    I(this, "diagonal");
+    I(this, "diagonalBucketIndex");
+    I(this, "xLength");
+    I(this, "yLength");
+    I(this, "index");
     this.x = n, this.y = e, this.xLength = Math.pow(3, -n), this.yLength = Math.pow(3, -e), this.diagonal = Math.sqrt(
       this.xLength * this.xLength + this.yLength * this.yLength
     ), this.diagonalBucketIndex = n + e, this.index = `${n},${e}`;
   }
 }
-class In {
+class Sn {
   constructor(n, e = 1e-8, r = 1e3, s = 1e-6) {
-    M(this, "rectangles");
-    M(this, "buckets");
-    M(this, "fMin");
-    M(this, "argMin");
-    M(this, "tol");
-    this.fcn = n, this.endTolerance = e, this.maxIterations = r, this.epsilon = s, this.fcn = n, this.epsilon = s, this.endTolerance = e, this.maxIterations = r, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new Mn();
+    I(this, "rectangles");
+    I(this, "buckets");
+    I(this, "fMin");
+    I(this, "argMin");
+    I(this, "tol");
+    this.fcn = n, this.endTolerance = e, this.maxIterations = r, this.epsilon = s, this.fcn = n, this.epsilon = s, this.endTolerance = e, this.maxIterations = r, this.rectangles = /* @__PURE__ */ new Map(), this.buckets = new In();
     const i = [0.5, 0.5], o = this.rect(0, 0), c = this.fcn(i);
     this.buckets.addInterval(new O(i, c, o)), this.fMin = c, this.argMin = i, this.tol = o.diagonal;
   }
@@ -286,7 +286,7 @@ class In {
   }
   rect(n, e) {
     const r = `${n},${e}`;
-    return this.rectangles.has(r) || this.rectangles.set(r, new Sn(n, e)), this.rectangles.get(r);
+    return this.rectangles.has(r) || this.rectangles.set(r, new Mn(n, e)), this.rectangles.get(r);
   }
   splitInterval(n) {
     let e, r, s;
@@ -332,7 +332,7 @@ class O {
   }
 }
 function An(t, n = 1e-8, e = 1e3, r = 1e-6) {
-  return new In(
+  return new Sn(
     t,
     n,
     e,
@@ -347,10 +347,10 @@ function vn(t, n, e = 1e-9) {
   return Math.sqrt(r.fMin);
 }
 function bn(t, n) {
-  return t instanceof v && n instanceof v ? pn(t, n) : t instanceof v && n instanceof y ? lt(t, n) : t instanceof y && n instanceof v ? lt(n, t) : t instanceof y && n instanceof y ? mn(t, n) : vn(t, n);
+  return v.isInstance(t) && v.isInstance(n) ? pn(t, n) : v.isInstance(t) && y.isInstance(n) ? lt(t, n) : y.isInstance(t) && v.isInstance(n) ? lt(n, t) : y.isInstance(t) && y.isInstance(n) ? mn(t, n) : vn(t, n);
 }
 function xt(t) {
-  if (t instanceof _) {
+  if (_.isInstance(t)) {
     const s = F(t.lastPoint, t.firstPoint), i = F(t.firstControlPoint, t.firstPoint), o = F(t.lastControlPoint, t.firstPoint), c = N(s, i), f = N(s, o);
     if (c > 0 && f < 0 || c < 0 && f > 0) return !1;
   }
@@ -375,22 +375,22 @@ function Ln(t) {
     (f, a) => t.firstAngle + a * r * i
   );
   return o.slice(0, -1).map((f, a) => [f, o[a + 1]]).map(([f, a]) => {
-    const u = Math.cos(f), g = Math.sin(f), p = Math.cos(a), d = Math.sin(a), [l, S] = t.center, w = t.minorRadius, I = t.majorRadius, L = new rn().rotate(
+    const u = Math.cos(f), g = Math.sin(f), p = Math.cos(a), d = Math.sin(a), [l, M] = t.center, w = t.minorRadius, S = t.majorRadius, L = new rn().rotate(
       t.tiltAngle,
       t.center
-    ), k = ($t) => L.transform($t), D = k([l + I * u, S + w * g]), $ = k([
-      l + I * (u - s * g * i),
-      S + w * (g + s * u * i)
+    ), k = ($t) => L.transform($t), D = k([l + S * u, M + w * g]), $ = k([
+      l + S * (u - s * g * i),
+      M + w * (g + s * u * i)
     ]), Gt = k([
-      l + I * (p + s * d * i),
-      S + w * (d - s * p * i)
-    ]), _t = k([l + I * p, S + w * d]);
+      l + S * (p + s * d * i),
+      M + w * (d - s * p * i)
+    ]), _t = k([l + S * p, M + w * d]);
     return new _(D, _t, $, Gt);
   });
 }
-const et = 1e-8, yt = (t) => t.flatMap((n) => n instanceof v ? [n] : n instanceof y ? [n] : n instanceof vt ? Ln(n).flatMap(
+const et = 1e-8, yt = (t) => t.flatMap((n) => v.isInstance(n) ? [n] : y.isInstance(n) ? [n] : vt.isInstance(n) ? Ln(n).flatMap(
   (e) => ht(e)
-) : n instanceof bt || n instanceof _ ? ht(n) : [new v(n.firstPoint, n.lastPoint)]);
+) : bt.isInstance(n) || _.isInstance(n) ? ht(n) : [new v(n.firstPoint, n.lastPoint)]);
 function J(t, n, e = !0) {
   const r = t.map((a) => ({
     offset: Ht(a, n),
@@ -399,7 +399,7 @@ function J(t, n, e = !0) {
   let i = e ? null : r.at(-1), o = e ? r.at(-1) : null;
   if (s.length === 1) return s;
   const c = (a) => {
-    i ? a.offset instanceof U ? A(a.offset.firstPoint, a.offset.lastPoint) || s.push(
+    i ? U.isInstance(a.offset) ? A(a.offset.firstPoint, a.offset.lastPoint) || s.push(
       new v(a.offset.firstPoint, a.offset.lastPoint)
     ) : s.push(a.offset) : i = a;
   }, f = function* () {
@@ -419,15 +419,15 @@ function J(t, n, e = !0) {
       continue;
     }
     let p = [];
-    if (!(o.offset instanceof U) && !(a.offset instanceof U)) {
-      const { intersections: w, overlaps: I } = W(
+    if (!U.isInstance(o.offset) && !U.isInstance(a.offset)) {
+      const { intersections: w, overlaps: S } = W(
         o.offset,
         a.offset,
         et / 100
       );
       p = [
         ...w,
-        ...I.flatMap((L) => [L.firstPoint, L.lastPoint])
+        ...S.flatMap((L) => [L.firstPoint, L.lastPoint])
       ];
     }
     if (p.length > 0) {
@@ -438,12 +438,12 @@ function J(t, n, e = !0) {
         );
         w = p[D.indexOf(Math.min(...D))];
       }
-      const I = o.offset.splitAt([
+      const S = o.offset.splitAt([
         w
       ])[0], L = a.offset.splitAt([w]).at(-1);
       if (!L) throw new Error("Bug in the splitting algo in offset");
       c({
-        offset: I,
+        offset: S,
         original: o.original
       }), o = { offset: L, original: a.original };
       continue;
@@ -451,8 +451,8 @@ function J(t, n, e = !0) {
     const d = o.original.lastPoint, l = on(
       F(g, d),
       F(u, d)
-    ) > 0, S = new y(u, g, d, l);
-    c(o), s.push(S), o = a;
+    ) > 0, M = new y(u, g, d, l);
+    c(o), s.push(M), o = a;
   }
   return o && c(o), s;
 }
@@ -497,7 +497,7 @@ function G(t, n) {
     s
   ), c = Ot(o, t, n);
   if (!c.length) return new h();
-  const a = St(c).filter((u) => u.length > 1).filter((u) => A(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new P(u));
+  const a = Mt(c).filter((u) => u.length > 1).filter((u) => A(u[0].firstPoint, u.at(-1).lastPoint)).map((u) => new P(u));
   return a.length ? new h(a.map((u) => new m(u))) : new h();
 }
 function En(t, n, e = "round") {
@@ -507,11 +507,11 @@ function En(t, n, e = "round") {
     !1
   ).map((l) => l.reverse());
   o.reverse();
-  const c = (l, S) => e === "round" ? sn(
+  const c = (l, M) => e === "round" ? sn(
     l.lastPoint,
-    S.firstPoint,
+    M.firstPoint,
     l.tangentAtLastPoint
-  ) : new v(l.lastPoint, S.firstPoint), f = [
+  ) : new v(l.lastPoint, M.firstPoint), f = [
     ...i,
     c(
       i[i.length - 1],
@@ -532,7 +532,7 @@ function En(t, n, e = "round") {
     f
   ), g = Ot(u, t, r);
   if (!g.length) return new h();
-  const d = St(g).filter((l) => l.length > 1).filter((l) => A(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new P(l));
+  const d = Mt(g).filter((l) => l.length > 1).filter((l) => A(l[0].firstPoint, l.at(-1).lastPoint)).map((l) => new P(l));
   return d.length ? new h(d.map((l) => new m(l))) : new h();
 }
 function kn(t, n) {
@@ -556,11 +556,11 @@ function Yn(t, n) {
   return kn(x(t), n);
 }
 function Zn(t, n, { endCap: e = "round" } = {}) {
-  return t instanceof b ? En(t, n, e) : Fn(x(t), n);
+  return b.isInstance(t) ? En(t, n, e) : Fn(x(t), n);
 }
 class xn {
   constructor() {
-    M(this, "filters");
+    I(this, "filters");
     this.filters = [];
   }
   delete() {
@@ -700,7 +700,7 @@ function Bt(t, n, e, r = () => !0) {
     if (!f) throw new Error("Bug in the stroke filletting algo");
     i(f, c);
   }), !s.at(-1)) throw new Error("Bug in the stroke corner algo");
-  if (n instanceof P) {
+  if (P.isInstance(n)) {
     const c = s.pop(), f = s.shift();
     if (!c || !f)
       throw new Error("Bug in the filletting algo");
@@ -710,13 +710,13 @@ function Bt(t, n, e, r = () => !0) {
 }
 function R(t, n, e) {
   const r = typeof e == "function" ? e(new C()) : e, s = r && r.asFilterFun();
-  if (t instanceof P || t instanceof b)
-    return Bt(Mt, t, n, s);
-  if (t instanceof m) {
+  if (P.isInstance(t) || b.isInstance(t))
+    return Bt(It, t, n, s);
+  if (m.isInstance(t)) {
     const i = R(t.contour, n, r), o = t.holes.map((c) => R(c, n, r));
     return new m(i, o, { ignoreChecks: !0 });
   }
-  if (t instanceof h) {
+  if (h.isInstance(t)) {
     const i = t.figures.map((o) => R(o, n, r));
     return new h(i, { ignoreChecks: !0 });
   }
@@ -724,13 +724,13 @@ function R(t, n, e) {
 }
 function T(t, n, e) {
   const r = typeof e == "function" ? e(new C()) : e, s = r && r.asFilterFun();
-  if (t instanceof P || t instanceof b)
-    return Bt(Mt, t, n, s);
-  if (t instanceof m) {
+  if (P.isInstance(t) || b.isInstance(t))
+    return Bt(It, t, n, s);
+  if (m.isInstance(t)) {
     const i = T(t.contour, n, r), o = t.holes.map((c) => T(c, n, r));
     return new m(i, o, { ignoreChecks: !0 });
   }
-  if (t instanceof h) {
+  if (h.isInstance(t)) {
     const i = t.figures.map((o) => T(o, n, r));
     return new h(i, { ignoreChecks: !0 });
   }
@@ -759,10 +759,10 @@ function Q(t, n, e, r, s, i) {
   const o = t.paramPoint(n), c = t.paramPoint(e), f = F(c, o), a = Et(f);
   if (a <= t.precision || i >= r.maxDepth)
     return [o, c];
-  const u = [f[0] / a, f[1] / a], g = (n + e) * 0.5, p = H(t, n, u, t.precision), d = H(t, g, u, t.precision), l = H(t, e, u, t.precision), S = q(p, d), w = q(d, l);
-  if (S >= s && w >= s)
+  const u = [f[0] / a, f[1] / a], g = (n + e) * 0.5, p = H(t, n, u, t.precision), d = H(t, g, u, t.precision), l = H(t, e, u, t.precision), M = q(p, d), w = q(d, l);
+  if (M >= s && w >= s)
     return [o, c];
-  const I = t.paramPoint(g), L = S >= s ? [o, I] : Q(t, n, g, r, s, i + 1), k = w >= s ? [I, c] : Q(t, g, e, r, s, i + 1);
+  const S = t.paramPoint(g), L = M >= s ? [o, S] : Q(t, n, g, r, s, i + 1), k = w >= s ? [S, c] : Q(t, g, e, r, s, i + 1);
   return [...L.slice(0, -1), ...k];
 }
 function rt(t, n = {}) {
@@ -793,15 +793,15 @@ function st(t, n) {
   return t.flatMap(n);
 }
 function Rn(t, n) {
-  if (t instanceof h)
+  if (h.isInstance(t))
     return On(t, n);
-  if (t instanceof m)
+  if (m.isInstance(t))
     return Rt(t, n);
-  if (t instanceof P)
+  if (P.isInstance(t))
     return Y(t, n);
-  if (t instanceof b)
+  if (b.isInstance(t))
     return Bn(t, n);
-  if (It(t))
+  if (St(t))
     return st([t], n);
   throw new Error("Unsupported shape type");
 }
@@ -841,9 +841,9 @@ function jn(t, n = {}) {
   return Rn(t, (r) => zn(r, n));
 }
 function _n(t, n = {}) {
-  if (t instanceof h)
-    return t.figures.map((e) => _n(e, n));
-  if (t instanceof m) {
+  if (h.isInstance(t))
+    return t.figures.flatMap((e) => _n(e, n));
+  if (m.isInstance(t)) {
     const e = K(
       B(t.contour.segments, n),
       !1
@@ -852,18 +852,18 @@ function _n(t, n = {}) {
     );
     return [e, ...r];
   }
-  return t instanceof P ? K(B(t.segments, n), !1) : t instanceof b ? B(t.segments, n) : rt(t, n);
+  return P.isInstance(t) ? [K(B(t.segments, n), !1)] : b.isInstance(t) ? [B(t.segments, n)] : [rt(t, n)];
 }
 function pt(t) {
-  if (t instanceof h)
+  if (h.isInstance(t))
     return an(t);
-  if (t instanceof m)
+  if (m.isInstance(t))
     return fn(t);
-  if (t instanceof P)
+  if (P.isInstance(t))
     return `<path d="${un(t)}" />`;
-  if (t instanceof b)
+  if (b.isInstance(t))
     return `<path d="${ln(t)}" />`;
-  if (It(t))
+  if (St(t))
     return `<path d="${`M ${t.firstPoint.join(" ")}`} ${hn(
       t
     )}" />`;