pantograph2d 0.4.0 → 0.5.0

package/dist/{Diagram-1c56996e.js → Diagram-9915ed5e.js}

@@ -50,7 +50,7 @@ function Q(e, t = 1e-9) {
     ).values()
   );
 }
-const qt = Math.PI / 180, I = (e) => `[${e[0]}, ${e[1]}]`, g = ([e, t], [n, s], i = 1e-9) => Math.abs(e - n) <= i && Math.abs(t - s) <= i, A = ([e, t], [n, s]) => [e + n, t + s], y = ([e, t], [n, s]) => [e - n, t - s], z = ([e, t]) => e * e + t * t, _ = ([e, t], n) => [e * n, t * n], Y = ([e, t], [n, s] = [0, 0]) => (e - n) ** 2 + (t - s) ** 2, k = (e, t = [0, 0]) => Math.sqrt(Y(e, t));
+const qt = Math.PI / 180, y = (e) => `[${e[0]}, ${e[1]}]`, g = ([e, t], [n, s], i = 1e-9) => Math.abs(e - n) <= i && Math.abs(t - s) <= i, S = ([e, t], [n, s]) => [e + n, t + s], A = ([e, t], [n, s]) => [e - n, t - s], z = ([e, t]) => e * e + t * t, _ = ([e, t], n) => [e * n, t * n], Y = ([e, t], [n, s] = [0, 0]) => (e - n) ** 2 + (t - s) ** 2, k = (e, t = [0, 0]) => Math.sqrt(Y(e, t));
 function $([e, t], [n, s]) {
   return e * s - t * n;
 }
@@ -83,15 +83,15 @@ function tt(e) {
   return [e[1], -e[0]];
 }
 const T = (e, t) => {
-  const [n, s, i, r, a, o, u, l, h] = e, [c, f, m, P, w, M, b, x, E] = t;
+  const [n, s, i, r, a, o, u, l, h] = e, [c, f, m, P, w, M, v, x, E] = t;
   return [
-    n * c + s * P + i * b,
+    n * c + s * P + i * v,
     n * f + s * w + i * x,
     n * m + s * M + i * E,
-    r * c + a * P + o * b,
+    r * c + a * P + o * v,
     r * f + a * w + o * x,
     r * m + a * M + o * E,
-    u * c + l * P + h * b,
+    u * c + l * P + h * v,
     u * f + l * w + h * x,
     u * m + l * M + h * E
   ];
@@ -174,7 +174,7 @@ class It extends K {
     super(), this.firstPoint = t, this.lastPoint = n, this.precision = 1e-9, this.firstPoint = t, this.lastPoint = n;
   }
   get repr() {
-    return `${this.segmentType} ${I(this.firstPoint)} - ${I(
+    return `${this.segmentType} ${y(this.firstPoint)} - ${y(
       this.lastPoint
     )}`;
   }
@@ -194,7 +194,7 @@ class d extends It {
     return t >= -n && 1 - t >= -n;
   }
   paramPoint(t) {
-    return A(this.firstPoint, _(this.V, t));
+    return S(this.firstPoint, _(this.V, t));
   }
   get length() {
     return k(this.firstPoint, this.lastPoint);
@@ -203,10 +203,10 @@ class d extends It {
     return Y(this.firstPoint, this.lastPoint);
   }
   get V() {
-    return this._V === null && (this._V = y(this.lastPoint, this.firstPoint)), this._V;
+    return this._V === null && (this._V = A(this.lastPoint, this.firstPoint)), this._V;
   }
   get midPoint() {
-    return A(this.firstPoint, _(this.V, 0.5));
+    return S(this.firstPoint, _(this.V, 0.5));
   }
   isSame(t) {
     return t instanceof d ? g(this.firstPoint, t.firstPoint) && g(this.lastPoint, t.lastPoint) || g(this.lastPoint, t.firstPoint) && g(this.firstPoint, t.lastPoint) : !1;
@@ -226,7 +226,7 @@ class d extends It {
     )), this._boundingBox;
   }
   distanceFrom(t) {
-    const n = y(t, this.firstPoint), s = st(n, this.V) / this.squareLength;
+    const n = A(t, this.firstPoint), s = st(n, this.V) / this.squareLength;
     if (s < 0)
       return k(t, this.firstPoint);
     if (s > 1)
@@ -237,7 +237,7 @@ class d extends It {
   isOnSegment(t) {
     if (g(t, this.firstPoint, this.precision))
       return !0;
-    const n = y(t, this.firstPoint);
+    const n = A(t, this.firstPoint);
     if (!vt(this.V, n))
       return !1;
     const s = st(n, this.V) / this.squareLength;
@@ -264,7 +264,7 @@ class d extends It {
     Array.isArray(t[0]) ? n = t : n = [t], n.forEach((u) => {
       if (!this.isOnSegment(u))
         throw new Error(
-          `Point ${I(u)} is not on segment ${this.repr}`
+          `Point ${y(u)} is not on segment ${this.repr}`
         );
     });
     const s = [this.firstPoint, ...n, this.lastPoint], i = Q(s), r = this.lastPoint[0] - this.firstPoint[0];
@@ -298,7 +298,7 @@ const Z = (e, t, n) => {
   const s = $(e.V, t.V), i = z(e.V), r = z(t.V), a = n ? n * n : e.precision * t.precision;
   if (s * s < i * r * a)
     return "parallel";
-  const o = y(t.firstPoint, e.firstPoint), u = $(o, t.V) / s, l = $(o, e.V) / s;
+  const o = A(t.firstPoint, e.firstPoint), u = $(o, t.V) / s, l = $(o, e.V) / s;
   return {
     intersectionParam1: u,
     intersectionParam2: l
@@ -333,7 +333,7 @@ function _t(e, t, n = !1, s) {
   return !e.isValidParameter(r) || !t.isValidParameter(a) ? null : e.paramPoint(r);
 }
 const j = (e, t) => {
-  const n = y(e, t);
+  const n = A(e, t);
   return Yt(n);
 };
 class p extends It {
@@ -343,14 +343,16 @@ class p extends It {
         throw new Error("Invalid arc, cannot be a full circle");
       if (Math.abs(this.radius - k(this.lastPoint, this.center)) > this.precision)
         throw new Error(
-          "Invalid arc, radius does not match between start and end"
+          `Invalid arc, radius does not match between ${y(
+            t
+          )} and ${y(n)}} (center ${y(s)})`
         );
     }
   }
   get info() {
-    return `ARC(${I(this.firstPoint)}, ${I(
+    return `ARC(${y(this.firstPoint)}, ${y(
       this.lastPoint
-    )}, ${I(this.center)}, ${this.clockwise ? "CW" : "CCW"})`;
+    )}, ${y(this.center)}, ${this.clockwise ? "CW" : "CCW"})`;
   }
   isValidParameter(t) {
     return 1 - t >= -this.precision && t >= -this.precision;
@@ -366,7 +368,7 @@ class p extends It {
     )), this._angularLength;
   }
   paramPoint(t) {
-    return A(
+    return S(
       this.center,
       R(
         this.radius,
@@ -378,12 +380,12 @@ class p extends It {
     const [n, s] = j(t, this.center);
     if (Math.abs(n - this.radius) > this.precision)
       throw new Error(
-        `Point ${I(t)} is not on segment ${this.repr}`
+        `Point ${y(t)} is not on segment ${this.repr}`
       );
     const i = this.angleToParam(s);
     if (!this.isValidParameter(i))
       throw new Error(
-        `Point ${I(t)} is not on segment ${this.repr}`
+        `Point ${y(t)} is not on segment ${this.repr}`
       );
     return i;
   }
@@ -392,14 +394,14 @@ class p extends It {
   }
   get firstAngle() {
     if (this._firstAngle === null) {
-      const [t, n] = y(this.firstPoint, this.center);
+      const [t, n] = A(this.firstPoint, this.center);
       this._firstAngle = nt(Math.atan2(n, t));
     }
     return this._firstAngle;
   }
   get lastAngle() {
     if (this._lastAngle === null) {
-      const [t, n] = y(this.lastPoint, this.center);
+      const [t, n] = A(this.lastPoint, this.center);
       this._lastAngle = nt(Math.atan2(n, t));
     }
     return this._lastAngle;
@@ -522,13 +524,13 @@ function pn(e, t, n) {
   if (o === "parallel")
     throw new Error("Cannot create an arc from three colinear points");
   const u = $(
-    y(e, t),
-    y(n, t)
+    A(e, t),
+    A(n, t)
   ) > 0;
   return new p(
     e,
     n,
-    A(s.midPoint, _(r, o.intersectionParam1)),
+    S(s.midPoint, _(r, o.intersectionParam1)),
     u,
     { ignoreChecks: !0 }
   );
@@ -544,19 +546,19 @@ function dn(e, t, n) {
   );
   if (r === "parallel")
     throw new Error("Cannot create an arc from three colinear points");
-  const a = A(
+  const a = S(
     s.midPoint,
     _(i, r.intersectionParam1)
   ), o = $(
-    y(a, e),
-    y(a, A(e, n))
+    A(a, e),
+    A(a, S(e, n))
   ) < 0;
   return new p(e, t, a, o, {
     ignoreChecks: !0
   });
 }
 function Nt(e, t) {
-  const n = y(t, e.firstPoint), s = st(n, e.V) / e.squareLength;
+  const n = A(t, e.firstPoint), s = st(n, e.V) / e.squareLength;
   return e.paramPoint(s);
 }
 function G(e, t, n) {
@@ -569,9 +571,9 @@ function G(e, t, n) {
   }
   const a = [], o = Math.sqrt(
     t.radius * t.radius - r * r
-  ), u = e.tangentAtFirstPoint, l = A(i, _(u, o));
+  ), u = e.tangentAtFirstPoint, l = S(i, _(u, o));
   e.isOnSegment(l) && t.isOnSegment(l) && a.push(l);
-  const h = A(i, _(u, -o));
+  const h = S(i, _(u, -o));
   return e.isOnSegment(h) && t.isOnSegment(h) && a.push(h), a;
 }
 const Xt = (e) => {
@@ -624,24 +626,24 @@ function kt(e, t, n = !1, s) {
     return [];
   if (r < i)
     return o > i ? [] : n ? Rt(e, t) : [];
-  const u = B(y(t.center, e.center)), l = r > a - i;
+  const u = B(A(t.center, e.center)), l = r > a - i;
   if (
     // circles are outside each other
     l || // circles are inside each other
     Math.abs(r - o) < i
   ) {
-    const b = l || e.radius > t.radius ? 1 : -1, x = A(
+    const v = l || e.radius > t.radius ? 1 : -1, x = S(
       e.center,
-      _(u, b * e.radius)
+      _(u, v * e.radius)
     );
     return e.isOnSegment(x) && t.isOnSegment(x) ? [x] : [];
   }
-  const h = e.radius * e.radius / (2 * r) - t.radius * t.radius / (2 * r) + r / 2, c = A(
+  const h = e.radius * e.radius / (2 * r) - t.radius * t.radius / (2 * r) + r / 2, c = S(
     e.center,
     _(u, h)
   ), f = Math.sqrt(
     e.radius * e.radius - h * h
-  ), m = F(u), P = A(c, _(m, f)), w = A(c, _(m, -f)), M = [];
+  ), m = F(u), P = S(c, _(m, f)), w = S(c, _(m, -f)), M = [];
   return e.isOnSegment(P) && t.isOnSegment(P) && M.push(P), e.isOnSegment(w) && t.isOnSegment(w) && M.push(w), M;
 }
 function Pn(e, t, n) {
@@ -828,16 +830,16 @@ function Vt(e) {
   }
   return t ? n : null;
 }
-class v extends Et {
+class I extends Et {
   constructor() {
     super(...arguments), this.strokeType = "STRAND";
   }
   reverse() {
     const t = this.segments.map((n) => n.reverse());
-    return t.reverse(), new v(t, { ignoreChecks: !0 });
+    return t.reverse(), new I(t, { ignoreChecks: !0 });
   }
   clone() {
-    return new v(
+    return new I(
       this.segments.map((t) => t.clone()),
       { ignoreChecks: !0 }
     );
@@ -845,14 +847,14 @@ class v extends Et {
   extend(t) {
     if (!g(this.lastPoint, t.firstPoint))
       throw console.error(this.repr, t.repr), new Error("Cannot extend strand: connection point is not the same");
-    return new v([...this.segments, ...t.segments]);
+    return new I([...this.segments, ...t.segments]);
   }
   simplify() {
     const t = Vt(this);
-    return t ? new v(t, { ignoreChecks: !0 }) : this;
+    return t ? new I(t, { ignoreChecks: !0 }) : this;
   }
   transform(t) {
-    return new v(
+    return new I(
       this.segments.map((n) => n.transform(t)),
       { ignoreChecks: !0 }
     );
@@ -981,7 +983,7 @@ function Jt(e) {
 function dt(e) {
   if (e instanceof V)
     return Jt(e);
-  if (e instanceof S)
+  if (e instanceof b)
     return Ot(e);
   if (e instanceof O)
     return rt(e);
@@ -1217,12 +1219,12 @@ function Lt(e, t = 1e-7) {
         s.push(o);
         break;
       }
-      const [M, b] = w[0];
-      o.push(M), i.add(b), u = b;
+      const [M, v] = w[0];
+      o.push(M), i.add(v), u = v;
     }
   }), s;
 }
-class S extends K {
+class b extends K {
   constructor(t, n = [], { ignoreChecks: s = !1 } = {}) {
     super(), s || tn(t, n), this.contour = t, this.holes = n;
   }
@@ -1236,13 +1238,13 @@ class S extends K {
     return [this.contour, ...this.holes];
   }
   clone() {
-    return new S(
+    return new b(
       this.contour.clone(),
       this.holes.map((t) => t.clone())
     );
   }
   transform(t) {
-    return new S(
+    return new b(
       this.contour.transform(t),
       this.holes.map((n) => n.transform(t))
     );
@@ -1256,8 +1258,8 @@ class S extends K {
     );
   }
   overlappingStrands(t) {
-    const n = t instanceof S ? t.allLoops : [t], s = this.allLoops.flatMap((i) => n.flatMap((r) => i.overlappingSegments(r)));
-    return Lt(s).map((i) => new v(i));
+    const n = t instanceof b ? t.allLoops : [t], s = this.allLoops.flatMap((i) => n.flatMap((r) => i.overlappingSegments(r)));
+    return Lt(s).map((i) => new I(i));
   }
 }
 function tn(e, t = []) {
@@ -1306,10 +1308,10 @@ const nn = (e) => {
 function D(e) {
   return nn(e).map(Tt).flatMap(ht).map((n) => {
     if (n.length === 1)
-      return new S(n[0].loop);
+      return new b(n[0].loop);
     n.sort((r, a) => r.isIn.length - a.isIn.length);
     const [s, ...i] = n.map(({ loop: r }) => r);
-    return new S(s, i);
+    return new b(s, i);
   });
 }
 function rn(e, t) {
@@ -1323,8 +1325,8 @@ function* Mt(e, t, n) {
   const s = (a) => t.some((o) => g(o, a.lastPoint)), i = (a) => n.some((o) => a.isSame(o));
   let r = [];
   for (const a of e)
-    s(a) ? (r.push(a), yield new v(r, { ignoreChecks: !0 }), r = []) : i(a) ? (r.length && (yield new v(r, { ignoreChecks: !0 }), r = []), yield new v([a], { ignoreChecks: !0 })) : r.push(a);
-  r.length && (yield new v(r, { ignoreChecks: !0 }));
+    s(a) ? (r.push(a), yield new I(r, { ignoreChecks: !0 }), r = []) : i(a) ? (r.length && (yield new I(r, { ignoreChecks: !0 }), r = []), yield new I([a], { ignoreChecks: !0 })) : r.push(a);
+  r.length && (yield new I(r, { ignoreChecks: !0 }));
 }
 const yt = (e, t) => {
   const n = e.findIndex((r) => g(t, r.firstPoint)), s = e.slice(0, n);
@@ -1359,13 +1361,13 @@ function an(e, t, n) {
   const i = [], r = new Array(e.segments.length).fill(0).map(() => []), a = new Array(t.segments.length).fill(0).map(() => []);
   if (e.segments.forEach((f, m) => {
     t.segments.forEach((P, w) => {
-      const { intersections: M, overlaps: b } = W(
+      const { intersections: M, overlaps: v } = W(
         f,
         P,
         n
       );
-      s.push(...M), r[m].push(...M), a[w].push(...M), i.push(...b);
-      const x = b.flatMap((E) => [
+      s.push(...M), r[m].push(...M), a[w].push(...M), i.push(...v);
+      const x = v.flatMap((E) => [
         E.firstPoint,
         E.lastPoint
       ]);
@@ -1418,8 +1420,8 @@ function St(e) {
     t = t.extend(n);
   if (!g(t.firstPoint, t.lastPoint))
     throw console.error(
-      I(t.firstPoint),
-      I(t.lastPoint)
+      y(t.firstPoint),
+      y(t.lastPoint)
     ), new Error("Bug in the intersection algo on non closing strand");
   return new O(t.segments);
 }
@@ -1544,7 +1546,7 @@ function J(e, t) {
   } else if (t.isFull && !e.contour.intersects(t.contour))
     if (e.contour.contains(t.contour.firstPoint)) {
       const s = U(
-        e.holes.map((i) => new S(i)),
+        e.holes.map((i) => new b(i)),
         [t]
       );
       return D([
@@ -1553,9 +1555,9 @@ function J(e, t) {
       ]);
     } else
       return [e];
-  let n = J(new S(e.contour), t);
+  let n = J(new b(e.contour), t);
   return e.holes.forEach((s) => {
-    n = n.flatMap((i) => J(i, new S(s)));
+    n = n.flatMap((i) => J(i, new b(s)));
   }), n;
 }
 function gn(e, t) {
@@ -1565,10 +1567,10 @@ function gn(e, t) {
   let s = D(n);
   return s = N(
     s,
-    e.holes.map((i) => new S(i))
+    e.holes.map((i) => new b(i))
   ), N(
     s,
-    t.holes.map((i) => new S(i))
+    t.holes.map((i) => new b(i))
   );
 }
 function U(e, t) {
@@ -1661,20 +1663,20 @@ export {
   Pn as C,
   V as D,
   tt as E,
-  S as F,
+  b as F,
   pn as G,
   R as H,
   qt as I,
   O as L,
-  v as S,
+  I as S,
   C as T,
   U as a,
   G as b,
   N as c,
   k as d,
-  y as e,
+  A as e,
   W as f,
-  A as g,
+  S as g,
   _ as h,
   at as i,
   kt as j,
@@ -1682,17 +1684,17 @@ export {
   Z as l,
   d as m,
   B as n,
-  g as o,
+  Lt as o,
   Nt as p,
-  Lt as q,
+  g as q,
   Q as r,
   Mt as s,
   Y as t,
-  $ as u,
-  dt as v,
-  K as w,
-  F as x,
-  dn as y,
+  dn as u,
+  $ as v,
+  dt as w,
+  K as x,
+  F as y,
   L as z
 };
-//# sourceMappingURL=Diagram-1c56996e.js.map
+//# sourceMappingURL=Diagram-9915ed5e.js.map