pantograph2d 0.3.0 → 0.3.1

package/dist/pantograph.js

@@ -1,825 +1,608 @@
-import { L as A, A as y, a as F, s as v, p as $, t as nt, c as et, f as ut, b as pt, d as _, e as dt, g as S, h as L, T as gt, D as P, F as b, i as I, j as Y, k as R, l as mt, m as wt, n as Pt, o as At, q as xt, r as yt, u as it, v as _t, w as St, x as st, y as Ft } from "./exportJSON-c42ca4ac.js";
-import { z as tn } from "./exportJSON-c42ca4ac.js";
-class T {
-  constructor(t, e) {
-    this.firstPoint = t, this.lastPoint = e;
-  }
-}
-function D(n, t) {
-  if (n instanceof A)
-    return vt(n, t);
-  if (n instanceof y)
-    return bt(n, t);
+import { L as p, A as P, a as L, s as C, p as D, t as Q, c as j, f as ct, b as ft, d as A, e as ut, g as S, h as $, T as lt, D as g, F as T, i as M, j as _, k as V, l as ht, m as gt, n as pt, o as mt, q as Pt, r as wt, u as tt, v as dt, w as At, x as nt, y as St, z as vt, S as Lt } from "./exportJSON-26bb92ef.js";
+import { B as Zt } from "./exportJSON-26bb92ef.js";
+class F {
+  constructor(n, e) {
+    this.firstPoint = n, this.lastPoint = e;
+  }
+}
+function k(t, n) {
+  if (t instanceof p)
+    return Ct(t, n);
+  if (t instanceof P)
+    return Tt(t, n);
   throw new Error("Not implemented");
 }
-function vt(n, t) {
-  const { firstPoint: e, lastPoint: i } = n, r = n.normalVector;
-  return new A(
-    F(e, v(r, t)),
-    F(i, v(r, t))
+function Ct(t, n) {
+  const { firstPoint: e, lastPoint: r } = t, s = t.normalVector;
+  return new p(
+    L(e, C(s, n)),
+    L(r, C(s, n))
   );
 }
-function bt(n, t) {
-  const e = F(
-    n.firstPoint,
-    v($(n.tangentAtFirstPoint), t)
-  ), i = F(
-    n.lastPoint,
-    v($(n.tangentAtLastPoint), t)
-  ), r = t * (n.clockwise ? 1 : -1);
-  return n.radius + r < n.precision ? new T(e, i) : new y(e, i, n.center, n.clockwise);
-}
-function rt(n, t, e) {
-  const i = et(
-    n.tangentAtLastPoint,
-    t.tangentAtFirstPoint
+function Tt(t, n) {
+  const e = L(
+    t.firstPoint,
+    C(D(t.tangentAtFirstPoint), n)
+  ), r = L(
+    t.lastPoint,
+    C(D(t.tangentAtLastPoint), n)
+  ), s = n * (t.clockwise ? 1 : -1);
+  return t.radius + s < t.precision ? new F(e, r) : new P(e, r, t.center, t.clockwise);
+}
+function et(t, n, e) {
+  const r = j(
+    t.tangentAtLastPoint,
+    n.tangentAtFirstPoint
   );
-  if (Math.abs(i) < 1e-10)
+  if (Math.abs(r) < 1e-10)
     return null;
-  const r = i > 0 ? 1 : -1, s = Math.abs(e) * r, o = D(n, s), a = D(t, s);
-  if (o instanceof T || a instanceof T)
+  const s = r > 0 ? 1 : -1, i = Math.abs(e) * s, o = k(t, i), u = k(n, i);
+  if (o instanceof F || u instanceof F)
     return null;
-  let h;
+  let c;
   try {
-    h = ut(o, a, 1e-9).at(-1);
+    c = ct(o, u, 1e-9).at(-1);
   } catch {
     return null;
   }
-  if (!h)
+  if (!c)
     return null;
-  const l = h, c = (p, g) => {
-    const m = g.tangentAt(l), x = pt(m), d = F(l, v(x, s));
-    return p.splitAt(d);
-  }, [f] = c(n, o), [, u] = c(t, a);
-  return { first: f, second: u, center: l };
-}
-function V(n, t, e) {
-  const i = rt(n, t, e);
-  if (!i)
+  const m = c, a = (v, b) => {
+    const w = b.tangentAt(m), d = ft(w), h = L(m, C(d, i));
+    return v.splitAt(h);
+  }, [f] = a(t, o), [, l] = a(n, u);
+  return { first: f, second: l, center: m };
+}
+function B(t, n, e) {
+  const r = et(t, n, e);
+  if (!r)
     return console.warn(
       "Cannot fillet between segments",
-      n.repr,
-      t.repr
-    ), [n, t];
-  const { first: r, second: s } = i;
+      t.repr,
+      n.repr
+    ), [t, n];
+  const { first: s, second: i } = r;
   return [
-    r,
-    nt(r.lastPoint, s.firstPoint, r.tangentAtLastPoint),
-    s
+    s,
+    Q(s.lastPoint, i.firstPoint, s.tangentAtLastPoint),
+    i
   ];
 }
-function N(n, t, e) {
-  const i = rt(n, t, e);
-  if (!i)
+function G(t, n, e) {
+  const r = et(t, n, e);
+  if (!r)
     return console.warn(
       "Cannot chamfer between segments",
-      n.repr,
-      t.repr
-    ), [n, t];
-  const { first: r, second: s } = i;
-  return [r, new A(r.lastPoint, s.firstPoint), s];
+      t.repr,
+      n.repr
+    ), [t, n];
+  const { first: s, second: i } = r;
+  return [s, new p(s.lastPoint, i.firstPoint), i];
 }
-function X(n) {
-  return new P([new b(new I(n))]);
+function N(t) {
+  return new g([new T(new M(t))]);
 }
 class Et {
-  constructor(t = [0, 0]) {
-    this.pointer = t, this.firstPoint = t, this.pendingSegments = [], this._nextCorner = null;
+  constructor(n = [0, 0]) {
+    this.pointer = n, this.firstPoint = n, this.pendingSegments = [], this._nextCorner = null;
   }
-  movePointerTo(t) {
+  movePointerTo(n) {
     if (this.pendingSegments.length)
       throw new Error(
         "You can only move the pointer if there is no segment defined"
       );
-    return this.pointer = t, this.firstPoint = t, this;
+    return this.pointer = n, this.firstPoint = n, this;
   }
-  saveSegment(t) {
-    if (_(t.firstPoint, t.lastPoint))
-      throw new Error(`Segment has no length, ${t.repr}`);
+  saveSegment(n) {
+    if (A(n.firstPoint, n.lastPoint))
+      throw new Error(`Segment has no length, ${n.repr}`);
     if (!this._nextCorner)
-      return this.pendingSegments.push(t), this;
+      return this.pendingSegments.push(n), this;
     const e = this.pendingSegments.pop();
     if (!e)
       throw new Error("bug in the custom corner algorithm");
-    const i = this._nextCorner.mode === "chamfer" ? N : V;
+    const r = this._nextCorner.mode === "chamfer" ? G : B;
     return this.pendingSegments.push(
-      ...i(e, t, this._nextCorner.radius)
+      ...r(e, n, this._nextCorner.radius)
     ), this._nextCorner = null, this;
   }
-  lineTo(t) {
-    const e = new A(this.pointer, t);
-    return this.pointer = t, this.saveSegment(e);
+  lineTo(n) {
+    const e = new p(this.pointer, n);
+    return this.pointer = n, this.saveSegment(e);
   }
-  line(t, e) {
-    return this.lineTo([this.pointer[0] + t, this.pointer[1] + e]);
+  line(n, e) {
+    return this.lineTo([this.pointer[0] + n, this.pointer[1] + e]);
   }
-  vLine(t) {
-    return this.line(0, t);
+  vLine(n) {
+    return this.line(0, n);
   }
-  hLine(t) {
-    return this.line(t, 0);
+  hLine(n) {
+    return this.line(n, 0);
   }
-  vLineTo(t) {
-    return this.lineTo([this.pointer[0], t]);
+  vLineTo(n) {
+    return this.lineTo([this.pointer[0], n]);
   }
-  hLineTo(t) {
-    return this.lineTo([t, this.pointer[1]]);
+  hLineTo(n) {
+    return this.lineTo([n, this.pointer[1]]);
   }
-  polarLineTo([t, e]) {
-    const i = e * R, r = Y(t, i);
-    return this.lineTo(r);
+  polarLineTo([n, e]) {
+    const r = e * V, s = _(n, r);
+    return this.lineTo(s);
   }
-  polarLine(t, e) {
-    const i = e * R, [r, s] = Y(t, i);
-    return this.line(r, s);
+  polarLine(n, e) {
+    const r = e * V, [s, i] = _(n, r);
+    return this.line(s, i);
   }
-  tangentLine(t) {
+  tangentLine(n) {
     const e = this.pendingSegments.at(-1);
     if (!e)
       throw new Error("You need a previous segment to sketch a tangent line");
-    const [i, r] = e.tangentAtLastPoint;
-    return this.line(i * t, r * t);
+    const [r, s] = e.tangentAtLastPoint;
+    return this.line(r * n, s * n);
   }
-  threePointsArcTo(t, e) {
-    return this.saveSegment(dt(this.pointer, e, t)), this.pointer = t, this;
+  threePointsArcTo(n, e) {
+    return this.saveSegment(ut(this.pointer, e, n)), this.pointer = n, this;
   }
-  threePointsArc(t, e, i, r) {
-    const [s, o] = this.pointer;
+  threePointsArc(n, e, r, s) {
+    const [i, o] = this.pointer;
     return this.threePointsArcTo(
-      [s + t, o + e],
-      [s + i, o + r]
+      [i + n, o + e],
+      [i + r, o + s]
     );
   }
-  sagittaArcTo(t, e) {
+  sagittaArcTo(n, e) {
     if (!e)
-      return this.lineTo(t);
-    const i = new A(this.pointer, t), r = $(i.tangentAtFirstPoint), s = F(i.midPoint, v(r, e));
-    return this.threePointsArcTo(t, s);
+      return this.lineTo(n);
+    const r = new p(this.pointer, n), s = D(r.tangentAtFirstPoint), i = L(r.midPoint, C(s, e));
+    return this.threePointsArcTo(n, i);
   }
-  sagittaArc(t, e, i) {
+  sagittaArc(n, e, r) {
     return this.sagittaArcTo(
-      [t + this.pointer[0], e + this.pointer[1]],
-      i
+      [n + this.pointer[0], e + this.pointer[1]],
+      r
     );
   }
-  vSagittaArc(t, e) {
-    return this.sagittaArc(0, t, e);
+  vSagittaArc(n, e) {
+    return this.sagittaArc(0, n, e);
   }
-  hSagittaArc(t, e) {
-    return this.sagittaArc(t, 0, e);
+  hSagittaArc(n, e) {
+    return this.sagittaArc(n, 0, e);
   }
-  bulgeArcTo(t, e) {
+  bulgeArcTo(n, e) {
     if (!e)
-      return this.lineTo(t);
-    const i = S(this.pointer, t) / 2, r = -e * i;
-    return this.sagittaArcTo(t, r);
+      return this.lineTo(n);
+    const r = S(this.pointer, n) / 2, s = -e * r;
+    return this.sagittaArcTo(n, s);
   }
-  bulgeArc(t, e, i) {
+  bulgeArc(n, e, r) {
     return this.bulgeArcTo(
-      [t + this.pointer[0], e + this.pointer[1]],
-      i
+      [n + this.pointer[0], e + this.pointer[1]],
+      r
     );
   }
-  vBulgeArc(t, e) {
-    return this.bulgeArc(0, t, e);
+  vBulgeArc(n, e) {
+    return this.bulgeArc(0, n, e);
   }
-  hBulgeArc(t, e) {
-    return this.bulgeArc(t, 0, e);
+  hBulgeArc(n, e) {
+    return this.bulgeArc(n, 0, e);
   }
-  tangentArcTo(t) {
+  tangentArcTo(n) {
     const e = this.pendingSegments.at(-1);
     if (!e)
       throw new Error("You need a previous curve to sketch a tangent arc");
     return this.saveSegment(
-      nt(this.pointer, t, e.tangentAtLastPoint)
-    ), this.pointer = t, this;
+      Q(this.pointer, n, e.tangentAtLastPoint)
+    ), this.pointer = n, this;
   }
-  tangentArc(t, e) {
-    const [i, r] = this.pointer;
-    return this.tangentArcTo([t + i, e + r]);
+  tangentArc(n, e) {
+    const [r, s] = this.pointer;
+    return this.tangentArcTo([n + r, e + s]);
   }
-  customCorner(t, e = "fillet") {
+  customCorner(n, e = "fillet") {
     if (!this.pendingSegments.length)
       throw new Error("You need a segment defined to fillet the angle");
-    return this._nextCorner = { mode: e, radius: t }, this;
+    return this._nextCorner = { mode: e, radius: n }, this;
   }
-  _customCornerLastWithFirst(t, e = "fillet") {
-    if (!t)
+  _customCornerLastWithFirst(n, e = "fillet") {
+    if (!n)
       return;
-    const i = this.pendingSegments.pop(), r = this.pendingSegments.shift();
-    if (!i || !r)
+    const r = this.pendingSegments.pop(), s = this.pendingSegments.shift();
+    if (!r || !s)
       throw new Error("Not enough curves to close and fillet");
-    const s = e === "chamfer" ? N : V;
-    this.pendingSegments.push(...s(i, r, t));
+    const i = e === "chamfer" ? G : B;
+    this.pendingSegments.push(...i(r, s, n));
   }
   close() {
     if (!this.pendingSegments.length)
       throw new Error("No segments to close");
-    const t = this.pendingSegments[0], e = this.pendingSegments.at(-1);
-    return _(t.firstPoint, e.lastPoint) || this.lineTo(t.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
+    const n = this.pendingSegments[0], e = this.pendingSegments.at(-1);
+    return A(n.firstPoint, e.lastPoint) || this.lineTo(n.firstPoint), this._nextCorner !== null && (this._customCornerLastWithFirst(
       this._nextCorner.radius,
       this._nextCorner.mode
-    ), this._nextCorner = null), X(this.pendingSegments);
+    ), this._nextCorner = null), N(this.pendingSegments);
   }
   closeWithMirror() {
     if (!this.pendingSegments.length)
       throw new Error("No segments to close");
-    const t = this.pendingSegments[0], e = this.pendingSegments.at(-1), i = L(
+    const n = this.pendingSegments[0], e = this.pendingSegments.at(-1), r = $(
       e.lastPoint,
-      t.firstPoint
-    ), r = new gt().mirrorLine(
-      i,
-      t.firstPoint
-    ), s = this.pendingSegments.map(
-      (o) => o.transform(r).reverse()
+      n.firstPoint
+    ), s = new lt().mirrorLine(
+      r,
+      n.firstPoint
+    ), i = this.pendingSegments.map(
+      (o) => o.transform(s).reverse()
     );
-    return s.reverse(), X([
+    return i.reverse(), N([
       ...this.pendingSegments,
-      ...s
+      ...i
     ]);
   }
 }
-function qt(n = [0, 0]) {
-  return new Et(n);
+function Gt(t = [0, 0]) {
+  return new Et(t);
 }
-function E(n) {
-  if (n instanceof b)
-    return [n];
-  if (n instanceof I)
-    return [new b(n)];
-  if (n instanceof P)
-    return n.figures;
+function E(t) {
+  if (t instanceof T)
+    return [t];
+  if (t instanceof M)
+    return [new T(t)];
+  if (t instanceof g)
+    return t.figures;
   throw new Error("Unknown shape");
 }
-function Mt(n, t) {
-  return new P(
-    mt(E(n), E(t))
+function Ft(t, n) {
+  return new g(
+    ht(E(t), E(n))
   );
 }
-function G(n) {
-  return n.reduce(
-    (t, e) => Mt(t, e),
-    new P()
+function U(t) {
+  return t.reduce(
+    (n, e) => Ft(n, e),
+    new g()
   );
 }
-function Tt(n, t) {
-  return new P(
-    wt(E(n), E(t))
+function Mt(t, n) {
+  return new g(
+    gt(E(t), E(n))
   );
 }
-function zt(n, t) {
-  return new P(
-    Pt(E(n), E(t))
+function Nt(t, n) {
+  return new g(
+    pt(E(t), E(n))
   );
 }
-function q(n) {
-  return n < 0 ? "before" : n > 1 ? "after" : "between";
+function Y(t) {
+  return t < 0 ? "before" : t > 1 ? "after" : "between";
 }
-const z = (n, t, e) => {
+const q = (t, n, e) => {
   if (e === "before")
-    return n.distanceFrom(t.firstPoint);
+    return t.distanceFrom(n.firstPoint);
   if (e === "after")
-    return n.distanceFrom(t.lastPoint);
+    return t.distanceFrom(n.lastPoint);
   throw new Error("Invalid position");
 };
-function It(n, t) {
-  const e = At(n, t);
+function bt(t, n) {
+  const e = mt(t, n);
   if (e === "parallel")
     return Math.min(
-      n.distanceFrom(t.firstPoint),
-      n.distanceFrom(t.lastPoint)
+      t.distanceFrom(n.firstPoint),
+      t.distanceFrom(n.lastPoint)
     );
-  const { intersectionParam1: i, intersectionParam2: r } = e, s = q(i), o = q(r);
-  if (s === "between" && o === "between")
+  const { intersectionParam1: r, intersectionParam2: s } = e, i = Y(r), o = Y(s);
+  if (i === "between" && o === "between")
     return 0;
-  if (s === "between" && o !== "between")
-    return z(n, t, o);
-  if (o === "between" && s !== "between")
-    return z(t, n, s);
-  if (s === "before" && o === "before")
-    return S(n.firstPoint, t.firstPoint);
-  if (s === "after" && o === "after")
-    return S(n.lastPoint, t.lastPoint);
-  if (s === "before" && o === "after")
-    return S(n.firstPoint, t.lastPoint);
-  if (s === "after" && o === "before")
-    return S(n.lastPoint, t.firstPoint);
+  if (i === "between" && o !== "between")
+    return q(t, n, o);
+  if (o === "between" && i !== "between")
+    return q(n, t, i);
+  if (i === "before" && o === "before")
+    return S(t.firstPoint, n.firstPoint);
+  if (i === "after" && o === "after")
+    return S(t.lastPoint, n.lastPoint);
+  if (i === "before" && o === "after")
+    return S(t.firstPoint, n.lastPoint);
+  if (i === "after" && o === "before")
+    return S(t.lastPoint, n.firstPoint);
   throw new Error("Invalid position");
 }
-function W(n, t) {
-  if (xt(n, t).length > 0)
+function z(t, n) {
+  if (Pt(t, n).length > 0)
     return 0;
-  const e = yt(n, t.center);
-  if (n.isOnSegment(e)) {
-    const i = S(e, t.center);
-    if (Math.abs(i - t.radius) < n.precision && t.isOnSegment(e))
+  const e = wt(t, n.center);
+  if (t.isOnSegment(e)) {
+    const r = S(e, n.center);
+    if (Math.abs(r - n.radius) < t.precision && n.isOnSegment(e))
       return 0;
-    if (i - t.radius > n.precision) {
-      const r = it(
-        L(e, t.center)
-      ), s = F(
-        t.center,
-        v(r, t.radius)
+    if (r - n.radius > t.precision) {
+      const s = tt(
+        $(e, n.center)
+      ), i = L(
+        n.center,
+        C(s, n.radius)
       );
-      if (t.isOnSegment(s))
-        return S(s, e);
+      if (n.isOnSegment(i))
+        return S(i, e);
     }
   }
   return Math.min(
-    t.distanceFrom(n.firstPoint),
-    t.distanceFrom(n.lastPoint),
     n.distanceFrom(t.firstPoint),
-    n.distanceFrom(t.lastPoint)
+    n.distanceFrom(t.lastPoint),
+    t.distanceFrom(n.firstPoint),
+    t.distanceFrom(n.lastPoint)
   );
 }
-const Lt = (n, t) => {
-  const e = n.angleToParam(t.firstAngle);
-  if (n.isValidParameter(e))
+const $t = (t, n) => {
+  const e = t.angleToParam(n.firstAngle);
+  if (t.isValidParameter(e))
     return !0;
-  const i = n.angleToParam(t.lastAngle);
-  return !!n.isValidParameter(i);
+  const r = t.angleToParam(n.lastAngle);
+  return !!t.isValidParameter(r);
 };
-function Ct(n, t) {
-  if (_t(n, t, !0).length > 0)
+function yt(t, n) {
+  if (dt(t, n, !0).length > 0)
     return 0;
-  const e = S(n.center, t.center);
-  if (e < n.precision && Lt(n, t))
-    return Math.abs(n.radius - t.radius);
-  const i = it(L(t.center, n.center)), r = e - Math.abs(n.radius - t.radius) < n.precision;
-  let s = St(i);
-  r && t.radius > n.radius && (s += Math.PI);
-  const o = r ? s : s + Math.PI, a = n.angleToParam(s), h = t.angleToParam(o);
-  return n.isValidParameter(a) && t.isValidParameter(h) ? S(n.paramPoint(a), t.paramPoint(h)) : Math.min(
-    n.distanceFrom(t.firstPoint),
-    n.distanceFrom(t.lastPoint),
+  const e = S(t.center, n.center);
+  if (e < t.precision && $t(t, n))
+    return Math.abs(t.radius - n.radius);
+  const r = tt($(n.center, t.center)), s = e - Math.abs(t.radius - n.radius) < t.precision;
+  let i = At(r);
+  s && n.radius > t.radius && (i += Math.PI);
+  const o = s ? i : i + Math.PI, u = t.angleToParam(i), c = n.angleToParam(o);
+  return t.isValidParameter(u) && n.isValidParameter(c) ? S(t.paramPoint(u), n.paramPoint(c)) : Math.min(
     t.distanceFrom(n.firstPoint),
-    t.distanceFrom(n.lastPoint)
+    t.distanceFrom(n.lastPoint),
+    n.distanceFrom(t.firstPoint),
+    n.distanceFrom(t.lastPoint)
   );
 }
-function $t(n, t) {
-  if (n instanceof A && t instanceof A)
-    return It(n, t);
-  if (n instanceof A && t instanceof y)
-    return W(n, t);
-  if (n instanceof y && t instanceof A)
-    return W(t, n);
-  if (n instanceof y && t instanceof y)
-    return Ct(n, t);
+function xt(t, n) {
+  if (t instanceof p && n instanceof p)
+    return bt(t, n);
+  if (t instanceof p && n instanceof P)
+    return z(t, n);
+  if (t instanceof P && n instanceof p)
+    return z(n, t);
+  if (t instanceof P && n instanceof P)
+    return yt(t, n);
   throw new Error("Not implemented");
 }
-class Dt {
-  constructor() {
-    this.ids = [], this.values = [], this.length = 0;
-  }
-  clear() {
-    this.length = 0;
-  }
-  push(t, e) {
-    let i = this.length++;
-    for (; i > 0; ) {
-      const r = i - 1 >> 1, s = this.values[r];
-      if (e >= s)
-        break;
-      this.ids[i] = this.ids[r], this.values[i] = s, i = r;
-    }
-    this.ids[i] = t, this.values[i] = e;
-  }
-  pop() {
-    if (this.length === 0)
-      return;
-    const t = this.ids[0];
-    if (this.length--, this.length > 0) {
-      const e = this.ids[0] = this.ids[this.length], i = this.values[0] = this.values[this.length], r = this.length >> 1;
-      let s = 0;
-      for (; s < r; ) {
-        let o = (s << 1) + 1;
-        const a = o + 1;
-        let h = this.ids[o], l = this.values[o];
-        const c = this.values[a];
-        if (a < this.length && c < l && (o = a, h = this.ids[a], l = c), l >= i)
-          break;
-        this.ids[s] = h, this.values[s] = l, s = o;
-      }
-      this.ids[s] = e, this.values[s] = i;
-    }
-    return t;
-  }
-  peek() {
-    if (this.length !== 0)
-      return this.ids[0];
-  }
-  peekValue() {
-    if (this.length !== 0)
-      return this.values[0];
-  }
-  shrink() {
-    this.ids.length = this.values.length = this.length;
-  }
-}
-const J = [
-  Int8Array,
-  Uint8Array,
-  Uint8ClampedArray,
-  Int16Array,
-  Uint16Array,
-  Int32Array,
-  Uint32Array,
-  Float32Array,
-  Float64Array
-], C = 3;
-class U {
-  static from(t) {
-    if (!t || t.byteLength === void 0 || t.buffer)
-      throw new Error("Data must be an instance of ArrayBuffer or SharedArrayBuffer.");
-    const [e, i] = new Uint8Array(t, 0, 2);
-    if (e !== 251)
-      throw new Error("Data does not appear to be in a Flatbush format.");
-    if (i >> 4 !== C)
-      throw new Error(`Got v${i >> 4} data when expected v${C}.`);
-    const [r] = new Uint16Array(t, 2, 1), [s] = new Uint32Array(t, 4, 1);
-    return new U(s, r, J[i & 15], void 0, t);
-  }
-  constructor(t, e = 16, i = Float64Array, r = ArrayBuffer, s) {
-    if (t === void 0)
-      throw new Error("Missing required argument: numItems.");
-    if (isNaN(t) || t <= 0)
-      throw new Error(`Unexpected numItems value: ${t}.`);
-    this.numItems = +t, this.nodeSize = Math.min(Math.max(+e, 2), 65535);
-    let o = t, a = o;
-    this._levelBounds = [o * 4];
-    do
-      o = Math.ceil(o / this.nodeSize), a += o, this._levelBounds.push(a * 4);
-    while (o !== 1);
-    this.ArrayType = i || Float64Array, this.IndexArrayType = a < 16384 ? Uint16Array : Uint32Array;
-    const h = J.indexOf(this.ArrayType), l = a * 4 * this.ArrayType.BYTES_PER_ELEMENT;
-    if (h < 0)
-      throw new Error(`Unexpected typed array class: ${i}.`);
-    s && s.byteLength !== void 0 && !s.buffer ? (this.data = s, this._boxes = new this.ArrayType(this.data, 8, a * 4), this._indices = new this.IndexArrayType(this.data, 8 + l, a), this._pos = a * 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 r(8 + l + a * this.IndexArrayType.BYTES_PER_ELEMENT), this._boxes = new this.ArrayType(this.data, 8, a * 4), this._indices = new this.IndexArrayType(this.data, 8 + l, a), 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, (C << 4) + h]), new Uint16Array(this.data, 2, 1)[0] = e, new Uint32Array(this.data, 4, 1)[0] = t), this._queue = new Dt();
-  }
-  add(t, e, i, r) {
-    const s = this._pos >> 2, o = this._boxes;
-    return this._indices[s] = s, o[this._pos++] = t, o[this._pos++] = e, o[this._pos++] = i, o[this._pos++] = r, t < this.minX && (this.minX = t), e < this.minY && (this.minY = e), i > this.maxX && (this.maxX = i), r > this.maxY && (this.maxY = r), s;
-  }
-  finish() {
-    if (this._pos >> 2 !== this.numItems)
-      throw new Error(`Added ${this._pos >> 2} items when expected ${this.numItems}.`);
-    const t = this._boxes;
-    if (this.numItems <= this.nodeSize) {
-      t[this._pos++] = this.minX, t[this._pos++] = this.minY, t[this._pos++] = this.maxX, t[this._pos++] = this.maxY;
-      return;
-    }
-    const e = this.maxX - this.minX || 1, i = this.maxY - this.minY || 1, r = new Uint32Array(this.numItems), s = (1 << 16) - 1;
-    for (let o = 0, a = 0; o < this.numItems; o++) {
-      const h = t[a++], l = t[a++], c = t[a++], f = t[a++], u = Math.floor(s * ((h + c) / 2 - this.minX) / e), p = Math.floor(s * ((l + f) / 2 - this.minY) / i);
-      r[o] = Bt(u, p);
-    }
-    k(r, t, this._indices, 0, this.numItems - 1, this.nodeSize);
-    for (let o = 0, a = 0; o < this._levelBounds.length - 1; o++) {
-      const h = this._levelBounds[o];
-      for (; a < h; ) {
-        const l = a;
-        let c = t[a++], f = t[a++], u = t[a++], p = t[a++];
-        for (let g = 1; g < this.nodeSize && a < h; g++)
-          c = Math.min(c, t[a++]), f = Math.min(f, t[a++]), u = Math.max(u, t[a++]), p = Math.max(p, t[a++]);
-        this._indices[this._pos >> 2] = l, t[this._pos++] = c, t[this._pos++] = f, t[this._pos++] = u, t[this._pos++] = p;
-      }
-    }
-  }
-  search(t, e, i, r, s) {
-    if (this._pos !== this._boxes.length)
-      throw new Error("Data not yet indexed - call index.finish().");
-    let o = this._boxes.length - 4;
-    const a = [], h = [];
-    for (; o !== void 0; ) {
-      const l = Math.min(o + this.nodeSize * 4, Z(o, this._levelBounds));
-      for (let c = o; c < l; c += 4) {
-        if (i < this._boxes[c] || r < this._boxes[c + 1] || t > this._boxes[c + 2] || e > this._boxes[c + 3])
-          continue;
-        const f = this._indices[c >> 2] | 0;
-        o >= this.numItems * 4 ? a.push(f) : (s === void 0 || s(f)) && h.push(f);
-      }
-      o = a.pop();
-    }
-    return h;
-  }
-  neighbors(t, e, i = 1 / 0, r = 1 / 0, s) {
-    if (this._pos !== this._boxes.length)
-      throw new Error("Data not yet indexed - call index.finish().");
-    let o = this._boxes.length - 4;
-    const a = this._queue, h = [], l = r * r;
-    for (; o !== void 0; ) {
-      const c = Math.min(o + this.nodeSize * 4, Z(o, this._levelBounds));
-      for (let f = o; f < c; f += 4) {
-        const u = this._indices[f >> 2] | 0, p = Q(t, this._boxes[f], this._boxes[f + 2]), g = Q(e, this._boxes[f + 1], this._boxes[f + 3]), m = p * p + g * g;
-        o >= this.numItems * 4 ? a.push(u << 1, m) : (s === void 0 || s(u)) && a.push((u << 1) + 1, m);
-      }
-      for (; a.length && a.peek() & 1; )
-        if (a.peekValue() > l || (h.push(a.pop() >> 1), h.length === i))
-          return a.clear(), h;
-      o = a.pop() >> 1;
-    }
-    return a.clear(), h;
-  }
-}
-function Q(n, t, e) {
-  return n < t ? t - n : n <= e ? 0 : n - e;
-}
-function Z(n, t) {
-  let e = 0, i = t.length - 1;
-  for (; e < i; ) {
-    const r = e + i >> 1;
-    t[r] > n ? i = r : e = r + 1;
-  }
-  return t[e];
-}
-function k(n, t, e, i, r, s) {
-  if (Math.floor(i / s) >= Math.floor(r / s))
-    return;
-  const o = n[i + r >> 1];
-  let a = i - 1, h = r + 1;
-  for (; ; ) {
-    do
-      a++;
-    while (n[a] < o);
-    do
-      h--;
-    while (n[h] > o);
-    if (a >= h)
-      break;
-    kt(n, t, e, a, h);
-  }
-  k(n, t, e, i, h, s), k(n, t, e, h + 1, r, s);
-}
-function kt(n, t, e, i, r) {
-  const s = n[i];
-  n[i] = n[r], n[r] = s;
-  const o = 4 * i, a = 4 * r, h = t[o], l = t[o + 1], c = t[o + 2], f = t[o + 3];
-  t[o] = t[a], t[o + 1] = t[a + 1], t[o + 2] = t[a + 2], t[o + 3] = t[a + 3], t[a] = h, t[a + 1] = l, t[a + 2] = c, t[a + 3] = f;
-  const u = e[i];
-  e[i] = e[r], e[r] = u;
-}
-function Bt(n, t) {
-  let e = n ^ t, i = 65535 ^ e, r = 65535 ^ (n | t), s = n & (t ^ 65535), o = e | i >> 1, a = e >> 1 ^ e, h = r >> 1 ^ i & s >> 1 ^ r, l = e & r >> 1 ^ s >> 1 ^ s;
-  e = o, i = a, r = h, s = l, o = e & e >> 2 ^ i & i >> 2, a = e & i >> 2 ^ i & (e ^ i) >> 2, h ^= e & r >> 2 ^ i & s >> 2, l ^= i & r >> 2 ^ (e ^ i) & s >> 2, e = o, i = a, r = h, s = l, o = e & e >> 4 ^ i & i >> 4, a = e & i >> 4 ^ i & (e ^ i) >> 4, h ^= e & r >> 4 ^ i & s >> 4, l ^= i & r >> 4 ^ (e ^ i) & s >> 4, e = o, i = a, r = h, s = l, h ^= e & r >> 8 ^ i & s >> 8, l ^= i & r >> 8 ^ (e ^ i) & s >> 8, e = h ^ h >> 1, i = l ^ l >> 1;
-  let c = n ^ t, f = i | 65535 ^ (c | e);
-  return c = (c | c << 8) & 16711935, c = (c | c << 4) & 252645135, c = (c | c << 2) & 858993459, c = (c | c << 1) & 1431655765, f = (f | f << 8) & 16711935, f = (f | f << 4) & 252645135, f = (f | f << 2) & 858993459, f = (f | f << 1) & 1431655765, (f << 1 | c) >>> 0;
-}
-function Ot(n, t = 1e-7) {
-  const e = new U(n.length);
-  n.forEach((s) => {
-    const [o, a] = s.firstPoint;
-    e.add(o - t, a - t, o + t, a + t);
-  }), e.finish();
-  const i = [], r = /* @__PURE__ */ new Set();
-  return n.forEach((s, o) => {
-    if (r.has(o))
-      return;
-    const a = [s];
-    let h = o;
-    r.add(o);
-    let l = n.length;
-    for (; ; ) {
-      if (l-- < 0)
-        throw new Error("Infinite loop detected");
-      const c = a[a.length - 1].lastPoint, [f, u] = c, p = e.search(
-        f - t,
-        u - t,
-        f + t,
-        u + t
-      ), g = (w) => Math.abs((h - w) % n.length), m = p.filter((w) => !r.has(w)).map((w) => [
-        n[w],
-        w,
-        g(w)
-      ]).sort(([, , w], [, , M]) => g(w) - g(M));
-      if (m.length === 0) {
-        i.push(a);
-        break;
-      }
-      const [x, d] = m[0];
-      a.push(x), r.add(d), h = d;
-    }
-  }), i;
-}
-const B = 1e-8;
-function Ut(n, t) {
-  const e = n.map((h) => ({
-    offset: D(h, t),
-    original: h
-  })), i = [];
-  let r = null, s = e.at(-1);
-  if (!s)
+const I = 1e-8;
+function Dt(t, n) {
+  const e = t.map((c) => ({
+    offset: k(c, n),
+    original: c
+  })), r = [];
+  let s = null, i = e.at(-1);
+  if (!i)
     return [];
-  if (i.length === 1)
-    return i;
-  const o = (h) => {
-    r ? h.offset instanceof T ? _(h.offset.firstPoint, h.offset.lastPoint) || i.push(
-      new A(h.offset.firstPoint, h.offset.lastPoint)
-    ) : i.push(h.offset) : r = h;
-  }, a = function* () {
-    for (const h of e.slice(0, -1))
-      yield h;
-    if (!r)
+  if (r.length === 1)
+    return r;
+  const o = (c) => {
+    s ? c.offset instanceof F ? A(c.offset.firstPoint, c.offset.lastPoint) || r.push(
+      new p(c.offset.firstPoint, c.offset.lastPoint)
+    ) : r.push(c.offset) : s = c;
+  }, u = function* () {
+    for (const c of e.slice(0, -1))
+      yield c;
+    if (!s)
       throw new Error("Bug in the offset algorithm");
-    yield r;
+    yield s;
   };
-  for (const h of a()) {
-    const l = s.offset.lastPoint, c = h.offset.firstPoint;
-    if (_(l, c)) {
-      o(s), s = h;
+  for (const c of u()) {
+    const m = i.offset.lastPoint, a = c.offset.firstPoint;
+    if (A(m, a)) {
+      o(i), i = c;
       continue;
     }
     let f = [];
-    if (!(s.offset instanceof T) && !(h.offset instanceof T)) {
-      const { intersections: m, overlaps: x } = st(
-        s.offset,
-        h.offset,
-        B / 100
+    if (!(i.offset instanceof F) && !(c.offset instanceof F)) {
+      const { intersections: w, overlaps: d } = nt(
+        i.offset,
+        c.offset,
+        I / 100
       );
       f = [
-        ...m,
-        ...x.flatMap((d) => [d.firstPoint, d.lastPoint])
+        ...w,
+        ...d.flatMap((h) => [h.firstPoint, h.lastPoint])
       ];
     }
     if (f.length > 0) {
-      let m = f[0];
+      let w = f[0];
       if (f.length > 1) {
-        const w = s == null ? void 0 : s.original.lastPoint, M = f.map(
-          (lt) => Ft(lt, w)
+        const x = i == null ? void 0 : i.original.lastPoint, y = f.map(
+          (at) => vt(at, x)
         );
-        m = f[M.indexOf(Math.min(...M))];
+        w = f[y.indexOf(Math.min(...y))];
       }
-      const x = s.offset.splitAt([
-        m
-      ])[0], d = h.offset.splitAt([m]).at(-1);
-      if (!d)
+      const d = i.offset.splitAt([
+        w
+      ])[0], h = c.offset.splitAt([w]).at(-1);
+      if (!h)
         throw new Error("Bug in the splitting algo in offset");
       o({
-        offset: x,
-        original: s.original
-      }), s = { offset: d, original: h.original };
+        offset: d,
+        original: i.original
+      }), i = { offset: h, original: c.original };
       continue;
     }
-    const u = s.original.lastPoint, p = et(
-      L(c, u),
-      L(l, u)
-    ) > 0, g = new y(l, c, u, p);
-    o(s), i.push(g), s = h;
-  }
-  return o(s), i;
-}
-function H(n, t) {
-  const e = n.clockwise ? t : -t, i = Ut(n.segments, e);
-  if (i.length < 2)
-    return new P();
-  const r = /* @__PURE__ */ new Map(), s = (c, f) => {
-    const u = r.get(c) || [];
-    r.set(c, [...u, ...f]);
+    const l = i.original.lastPoint, v = j(
+      $(a, l),
+      $(m, l)
+    ) > 0, b = new P(m, a, l, v);
+    o(i), r.push(b), i = c;
+  }
+  return o(i), r;
+}
+function W(t, n) {
+  const e = t.clockwise ? n : -n, r = Dt(t.segments, e);
+  if (r.length < 2)
+    return new g();
+  const s = /* @__PURE__ */ new Map(), i = (a, f) => {
+    const l = s.get(a) || [];
+    s.set(a, [...l, ...f]);
   };
-  if (i.forEach((c, f) => {
-    i.slice(f + 1).forEach((u, p) => {
-      const { intersections: g, overlaps: m } = st(c, u, B), x = [
-        ...g,
-        ...m.flatMap((d) => [d.firstPoint, d.lastPoint])
-      ].filter((d) => {
-        const w = _(d, c.firstPoint) || _(d, c.lastPoint), M = _(d, u.firstPoint) || _(d, u.lastPoint);
-        return !(w && M);
+  if (r.forEach((a, f) => {
+    r.slice(f + 1).forEach((l, v) => {
+      const { intersections: b, overlaps: w } = nt(a, l, I), d = [
+        ...b,
+        ...w.flatMap((h) => [h.firstPoint, h.lastPoint])
+      ].filter((h) => {
+        const x = A(h, a.firstPoint) || A(h, a.lastPoint), y = A(h, l.firstPoint) || A(h, l.lastPoint);
+        return !(x && y);
       });
-      x.length && (s(f, x), s(p + f + 1, x));
+      d.length && (i(f, d), i(v + f + 1, d));
     });
-  }), !r.size) {
-    const c = new I(i);
-    return new P([new b(c)]);
-  }
-  const a = i.flatMap((c, f) => {
-    if (!r.has(f))
-      return c;
-    const u = r.get(f) || [];
-    return c.splitAt(u);
-  }).filter((c) => !n.segments.some((u) => $t(u, c) < Math.abs(t) - B));
-  if (!a.length)
-    return new P();
-  const l = Ot(a).filter((c) => c.length > 1).filter((c) => _(c[0].firstPoint, c.at(-1).lastPoint)).map((c) => new I(c));
-  return l.length ? new P(l.map((c) => new b(c))) : new P();
-}
-function Yt(n, t) {
-  const e = n.map((i) => {
-    const r = G(
-      i.holes.map((s) => H(s, t))
+  }), !s.size) {
+    const a = new M(r);
+    return new g([new T(a)]);
+  }
+  const u = r.flatMap((a, f) => {
+    if (!s.has(f))
+      return a;
+    const l = s.get(f) || [];
+    return a.splitAt(l);
+  }).filter((a) => !t.segments.some((l) => xt(l, a) < Math.abs(n) - I));
+  if (!u.length)
+    return new g();
+  const m = St(u).filter((a) => a.length > 1).filter((a) => A(a[0].firstPoint, a.at(-1).lastPoint)).map((a) => new M(a));
+  return m.length ? new g(m.map((a) => new T(a))) : new g();
+}
+function kt(t, n) {
+  const e = t.map((r) => {
+    const s = U(
+      r.holes.map((i) => W(i, n))
     );
-    return Tt(H(i.contour, t), r);
+    return Mt(W(r.contour, n), s);
   });
-  return G(e);
+  return U(e);
 }
-function Wt(n, t) {
-  return Yt(E(n), t);
+function Ut(t, n) {
+  return kt(E(t), n);
 }
-function ot(n) {
-  if (n instanceof A)
-    return `L ${n.lastPoint.join(" ")}`;
-  if (n instanceof y)
-    return `A ${n.radius} ${n.radius} 0 ${n.angularLength > Math.PI ? "1" : "0"} ${n.clockwise ? "0" : "1"} ${n.lastPoint.join(" ")}`;
+function R(t) {
+  if (t instanceof p)
+    return `L ${t.lastPoint.join(" ")}`;
+  if (t instanceof P)
+    return `A ${t.radius} ${t.radius} 0 ${t.angularLength > Math.PI ? "1" : "0"} ${t.clockwise ? "0" : "1"} ${t.lastPoint.join(" ")}`;
   throw new Error("Unknown segment type");
 }
-function at(n) {
-  const t = `M ${n.firstPoint.join(" ")}`, e = n.segments.map(ot).join(" ");
-  return `${t} ${e} Z`;
+function rt(t) {
+  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(R).join(" ");
+  return `${n} ${e} Z`;
 }
-function ht(n) {
-  return `<path d="${n.allLoops.map(at).join(" ")}" />`;
+function it(t) {
+  return `<path d="${t.allLoops.map(rt).join(" ")}" />`;
 }
-function Rt(n) {
+function It(t) {
   return `<g>
-  ${n.figures.map(ht).join(`
+  ${t.figures.map(it).join(`
 `)}
 </g>`;
 }
-function Vt(n, t = 1) {
-  const e = n.xMin - t, i = n.yMin - t;
-  return `${e} ${i} ${n.width + 2 * t} ${n.height + 2 * t}`;
+function Ot(t) {
+  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(R).join(" ");
+  return `${n} ${e}`;
 }
-function K(n, t, e = 1) {
+function Rt(t, n = 1) {
+  const e = t.xMin - n, r = t.yMin - n;
+  return `${e} ${r} ${t.width + 2 * n} ${t.height + 2 * n}`;
+}
+function J(t, n, e = 1) {
   return `<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${Vt(t, e)}" fill="none" stroke="black" stroke-width="0.2%" vector-effect="non-scaling-stroke">
-    ${n}
+<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${Rt(n, e)}" fill="none" stroke="black" stroke-width="0.2%" vector-effect="non-scaling-stroke">
+    ${t}
 </svg>`;
 }
-function j(n) {
-  if (n instanceof P)
-    return Rt(n);
-  if (n instanceof b)
-    return ht(n);
-  if (n instanceof I)
-    return `<path d="${at(n)}" />`;
-  if (n instanceof y || n instanceof A)
-    return `<path d="${`M ${n.firstPoint.join(" ")}`} ${ot(
-      n
+function X(t) {
+  if (t instanceof g)
+    return It(t);
+  if (t instanceof T)
+    return it(t);
+  if (t instanceof M)
+    return `<path d="${rt(t)}" />`;
+  if (t instanceof Lt)
+    return `<path d="${Ot(t)}" />`;
+  if (t instanceof P || t instanceof p)
+    return `<path d="${`M ${t.firstPoint.join(" ")}`} ${R(
+      t
     )}" />`;
   throw new Error("Unknown shape type");
 }
-function Jt(n, t = 1) {
-  if (Array.isArray(n)) {
-    const i = n.map((o) => o.mirror()), r = i.map((o) => j(o)).join(`
-`), s = i.slice(1).reduce((o, a) => o.merge(a.boundingBox), i[0].boundingBox);
-    return K(r, s);
-  }
-  const e = n.mirror();
-  return K(j(e), e.boundingBox, t);
-}
-const ct = (n) => {
-  if (n.type === "LINE")
-    return new A(n.firstPoint, n.lastPoint);
-  if (n.type === "ARC")
-    return new y(
-      n.firstPoint,
-      n.lastPoint,
-      n.center,
-      n.clockwise
+const Z = (t) => "shape" in t ? t.shape : t, H = (t, n) => {
+  if (!("shape" in t))
+    return n;
+  const { color: e } = t;
+  return e ? `<g stroke="${e}">${n}</g>` : n;
+};
+function Yt(t, n = 1) {
+  if (Array.isArray(t)) {
+    const r = t.map((o) => Z(o).mirror()), s = r.map((o, u) => H(t[u], X(o))).join(`
+`), i = r.slice(1).reduce((o, u) => o.merge(u.boundingBox), r[0].boundingBox);
+    return J(s, i);
+  }
+  const e = Z(t).mirror();
+  return J(
+    H(t, X(e)),
+    e.boundingBox,
+    n
+  );
+}
+const st = (t) => {
+  if (t.type === "LINE")
+    return new p(t.firstPoint, t.lastPoint);
+  if (t.type === "ARC")
+    return new P(
+      t.firstPoint,
+      t.lastPoint,
+      t.center,
+      t.clockwise
     );
   throw new Error("Unknown segment type");
-}, O = (n) => {
-  const t = n.segments.map(ct);
-  return new I(t);
-}, ft = (n) => {
-  const t = O(n.contour), e = n.holes.map(O);
-  return new b(t, e);
-}, Nt = (n) => {
-  const t = n.figures.map(ft);
-  return new P(t);
+}, O = (t) => {
+  const n = t.segments.map(st);
+  return new M(n);
+}, ot = (t) => {
+  const n = O(t.contour), e = t.holes.map(O);
+  return new T(n, e);
+}, _t = (t) => {
+  const n = t.figures.map(ot);
+  return new g(n);
 };
-function Qt(n) {
-  if (n.type === "DIAGRAM")
-    return Nt(n);
-  if (n.type === "FIGURE")
-    return ft(n);
-  if (n.type === "LOOP")
-    return O(n);
-  if (n.type === "LINE" || n.type === "ARC")
-    return ct(n);
+function qt(t) {
+  if (t.type === "DIAGRAM")
+    return _t(t);
+  if (t.type === "FIGURE")
+    return ot(t);
+  if (t.type === "LOOP")
+    return O(t);
+  if (t.type === "LINE" || t.type === "ARC")
+    return st(t);
   throw new Error("Unknown shape type");
 }
-const tt = Math.PI / 180, Xt = 180 / Math.PI;
-function Zt(n, t) {
-  const e = Math.cos(t * tt) * n, i = Math.sin(t * tt) * n;
-  return [e, i];
+const K = Math.PI / 180, Vt = 180 / Math.PI;
+function zt(t, n) {
+  const e = Math.cos(n * K) * t, r = Math.sin(n * K) * t;
+  return [e, r];
 }
-function Ht([n, t]) {
-  const e = Math.sqrt(n * n + t * t), i = Math.atan2(t, n) * Xt;
-  return [e, i];
+function Wt([t, n]) {
+  const e = Math.sqrt(t * t + n * n), r = Math.atan2(n, t) * Vt;
+  return [e, r];
 }
 export {
-  tt as DEG2RAD,
-  Xt as RAD2DEG,
-  Ht as cartesianToPolar,
-  Tt as cut,
-  qt as draw,
-  tn as exportJSON,
-  Jt as exportSVG,
-  Mt as fuse,
-  G as fuseAll,
-  Qt as importJSON,
-  zt as intersect,
-  Wt as offset,
-  Zt as polarToCartesian,
-  j as svgBody
+  K as DEG2RAD,
+  Vt as RAD2DEG,
+  Wt as cartesianToPolar,
+  Mt as cut,
+  Gt as draw,
+  Zt as exportJSON,
+  Yt as exportSVG,
+  Ft as fuse,
+  U as fuseAll,
+  qt as importJSON,
+  Nt as intersect,
+  Ut as offset,
+  zt as polarToCartesian,
+  X as svgBody
 };
 //# sourceMappingURL=pantograph.js.map