pantograph2d 0.3.0 → 0.4.0

package/dist/exportJSON-c42ca4ac.js

@@ -1,1427 +0,0 @@
-function G(n, t, e, r) {
-  return n <= r && t >= e;
-}
-class q {
-  constructor(t = 1 / 0, e = 1 / 0, r = -1 / 0, s = -1 / 0) {
-    this.xMin = t, this.yMin = e, this.xMax = r, this.yMax = s;
-  }
-  get width() {
-    return this.xMax - this.xMin;
-  }
-  get height() {
-    return this.yMax - this.yMin;
-  }
-  contains(t) {
-    const [e, r] = t;
-    return G(this.xMin, this.xMax, e, e) && G(this.yMin, this.yMax, r, r);
-  }
-  overlaps(t) {
-    return G(this.xMin, this.xMax, t.xMin, t.xMax) && G(this.yMin, this.yMax, t.yMin, t.yMax);
-  }
-  addPoint(t) {
-    const [e, r] = t;
-    return new q(
-      Math.min(this.xMin, e),
-      Math.min(this.yMin, r),
-      Math.max(this.xMax, e),
-      Math.max(this.yMax, r)
-    );
-  }
-  merge(t) {
-    return new q(
-      Math.min(this.xMin, t.xMin),
-      Math.min(this.yMin, t.yMin),
-      Math.max(this.xMax, t.xMax),
-      Math.max(this.yMax, t.yMax)
-    );
-  }
-}
-const lt = (n, t = 1e-9) => {
-  let e = n;
-  return Math.abs(n) < t && (e = 0), e.toFixed(-Math.log10(t));
-};
-function J(n, t = 1e-9) {
-  return Array.from(
-    new Map(
-      n.map(([e, r]) => [
-        `[${lt(e, t)},${lt(r, t)}]`,
-        [e, r]
-      ])
-    ).values()
-  );
-}
-const Ot = Math.PI / 180, B = (n) => `[${n[0]}, ${n[1]}]`, h = ([n, t], [e, r], s = 1e-9) => Math.abs(n - e) <= s && Math.abs(t - r) <= s, M = ([n, t], [e, r]) => [n + e, t + r], y = ([n, t], [e, r]) => [n - e, t - r], X = ([n, t]) => n * n + t * t, k = ([n, t], e) => [n * e, t * e], j = ([n, t], [e, r] = [0, 0]) => (n - e) ** 2 + (t - r) ** 2, v = (n, t = [0, 0]) => Math.sqrt(j(n, t));
-function $([n, t], [e, r]) {
-  return n * r - t * e;
-}
-function et([n, t], [e, r]) {
-  return n * e + t * r;
-}
-function E([n, t]) {
-  const e = v([n, t]);
-  return [n / e, t / e];
-}
-function U(n, t) {
-  const e = Math.cos(t) * n, r = Math.sin(t) * n;
-  return [e, r];
-}
-function Ft([n, t]) {
-  return Math.atan2(t, n);
-}
-function Lt(n) {
-  const t = v(n), e = Ft(n);
-  return [t, e];
-}
-function xt(n, t, e = 1e-9) {
-  const r = $(n, t), s = X(n), i = X(t);
-  return r * r < s * i * e * e;
-}
-function C(n) {
-  return [-n[1], n[0]];
-}
-function Z(n) {
-  return [n[1], -n[0]];
-}
-const _ = (n, t) => {
-  const [e, r, s, i, o, a, u, c, l] = n, [f, P, p, d, w, x, I, S, T] = t;
-  return [
-    e * f + r * d + s * I,
-    e * P + r * w + s * S,
-    e * p + r * x + s * T,
-    i * f + o * d + a * I,
-    i * P + o * w + a * S,
-    i * p + o * x + a * T,
-    u * f + c * d + l * I,
-    u * P + c * w + l * S,
-    u * p + c * x + l * T
-  ];
-};
-class V {
-  constructor() {
-    this._matrix = [1, 0, 0, 0, 1, 0, 0, 0, 1];
-  }
-  translate(t, e) {
-    return this._matrix = _(this._matrix, [1, 0, t, 0, 1, e, 0, 0, 1]), this;
-  }
-  rotate(t, e) {
-    const r = Math.cos(t), s = Math.sin(t), i = [r, -s, 0, s, r, 0, 0, 0, 1];
-    return e && this.translate(e[0], e[1]), this._matrix = _(this._matrix, i), e && this.translate(-e[0], -e[1]), this;
-  }
-  mirrorX() {
-    return this._matrix = _(this._matrix, [1, 0, 0, 0, -1, 0, 0, 0, 1]), this;
-  }
-  mirrorY() {
-    return this._matrix = _(this._matrix, [-1, 0, 0, 0, 1, 0, 0, 0, 1]), this;
-  }
-  mirrorLine(t, e) {
-    const [r, s] = t, i = Math.atan2(s, r);
-    return e && this.translate(e[0], e[1]), this.rotate(i), this.mirrorX(), this.rotate(-i), e && this.translate(-e[0], -e[1]), this;
-  }
-  mirrorCenter(t) {
-    return t && this.translate(t[0], t[1]), this._matrix = _(this._matrix, [-1, 0, 0, 0, -1, 0, 0, 0, 1]), t && this.translate(-t[0], -t[1]), this;
-  }
-  scale(t, e) {
-    return e && this.translate(e[0], e[1]), this._matrix = _(this._matrix, [t, 0, 0, 0, t, 0, 0, 0, 1]), e && this.translate(-e[0], -e[1]), this;
-  }
-  transform(t) {
-    const [e, r] = t, [s, i, o, a, u, c] = this._matrix;
-    return [s * e + i * r + o, a * e + u * r + c];
-  }
-  keepsOrientation() {
-    const [t, , , , e] = this._matrix;
-    return t * e > 0;
-  }
-}
-class K {
-  translateX(t) {
-    const e = new V().translate(t, 0);
-    return this.transform(e);
-  }
-  translateY(t) {
-    const e = new V().translate(0, t);
-    return this.transform(e);
-  }
-  translate(t, e) {
-    const r = new V().translate(t, e);
-    return this.transform(r);
-  }
-  translateTo([t, e]) {
-    const r = new V().translate(t, e);
-    return this.transform(r);
-  }
-  rotate(t, e) {
-    const r = new V().rotate(
-      t * Ot,
-      e
-    );
-    return this.transform(r);
-  }
-  scale(t, e) {
-    const r = new V().scale(t, e);
-    return this.transform(r);
-  }
-  mirrorCenter(t) {
-    const e = new V().mirrorCenter(t);
-    return this.transform(e);
-  }
-  mirror(t = "x", e) {
-    const r = new V();
-    return t === "x" ? r.mirrorX() : t === "y" ? r.mirrorY() : r.mirrorLine(t, e), this.transform(r);
-  }
-}
-class Mt extends K {
-  constructor(t, e) {
-    super(), this.firstPoint = t, this.lastPoint = e, this.precision = 1e-9, this.firstPoint = t, this.lastPoint = e;
-  }
-  get repr() {
-    return `${this.segmentType} ${B(this.firstPoint)} - ${B(
-      this.lastPoint
-    )}`;
-  }
-  [Symbol.for("nodejs.util.inspect.custom")]() {
-    return this.repr;
-  }
-}
-class m extends Mt {
-  constructor() {
-    super(...arguments), this.segmentType = "LINE", this._V = null, this._boundingBox = null;
-  }
-  isValidParameter(t) {
-    const e = this.length * this.precision;
-    return t >= -e && 1 - t >= -e;
-  }
-  paramPoint(t) {
-    return M(this.firstPoint, k(this.V, t));
-  }
-  get length() {
-    return v(this.firstPoint, this.lastPoint);
-  }
-  get squareLength() {
-    return j(this.firstPoint, this.lastPoint);
-  }
-  get V() {
-    return this._V === null && (this._V = y(this.lastPoint, this.firstPoint)), this._V;
-  }
-  get midPoint() {
-    return M(this.firstPoint, k(this.V, 0.5));
-  }
-  isSame(t) {
-    return t instanceof m ? h(this.firstPoint, t.firstPoint) && h(this.lastPoint, t.lastPoint) || h(this.lastPoint, t.firstPoint) && h(this.firstPoint, t.lastPoint) : !1;
-  }
-  clone() {
-    return new m(this.firstPoint, this.lastPoint);
-  }
-  reverse() {
-    return new m(this.lastPoint, this.firstPoint);
-  }
-  get boundingBox() {
-    return this._boundingBox === null && (this._boundingBox = new q(
-      Math.min(this.firstPoint[0], this.lastPoint[0]) - this.precision,
-      Math.min(this.firstPoint[1], this.lastPoint[1]) - this.precision,
-      Math.max(this.firstPoint[0], this.lastPoint[0]) + this.precision,
-      Math.max(this.firstPoint[1], this.lastPoint[1]) + this.precision
-    )), this._boundingBox;
-  }
-  distanceFrom(t) {
-    const e = y(t, this.firstPoint), r = et(e, this.V) / this.squareLength;
-    if (r < 0)
-      return v(t, this.firstPoint);
-    if (r > 1)
-      return v(t, this.lastPoint);
-    const s = this.paramPoint(r);
-    return v(t, s);
-  }
-  isOnSegment(t) {
-    if (h(t, this.firstPoint, this.precision))
-      return !0;
-    const e = y(t, this.firstPoint);
-    if (!xt(this.V, e))
-      return !1;
-    const r = et(e, this.V) / this.squareLength;
-    return this.isValidParameter(r);
-  }
-  tangentAt(t) {
-    if (!this.isOnSegment(t))
-      throw new Error("Point is not on segment");
-    return E(this.V);
-  }
-  get normalVector() {
-    return C(E(this.V));
-  }
-  get tangentAtFirstPoint() {
-    return E(this.V);
-  }
-  get tangentAtLastPoint() {
-    return E(this.V);
-  }
-  splitAt(t) {
-    let e;
-    if (Array.isArray(t) && t.length === 0)
-      return [this];
-    Array.isArray(t[0]) ? e = t : e = [t], e.forEach((u) => {
-      if (!this.isOnSegment(u))
-        throw new Error(
-          `Point ${B(u)} is not on segment ${this.repr}`
-        );
-    });
-    const r = [this.firstPoint, ...e, this.lastPoint], s = J(r), i = this.lastPoint[0] - this.firstPoint[0];
-    let o = Math.sign(i), a = 0;
-    return Math.abs(i) < this.precision && (o = Math.sign(this.lastPoint[1] - this.firstPoint[1]), a = 1), s.sort(
-      (u, c) => o * (u[a] - c[a])
-    ), s.flatMap((u, c) => c === s.length - 1 ? [] : new m(u, s[c + 1]));
-  }
-  transform(t) {
-    return new m(
-      t.transform(this.firstPoint),
-      t.transform(this.lastPoint)
-    );
-  }
-}
-function Bt(n) {
-  return Array.from(Array(n).keys());
-}
-function L(n) {
-  const t = Math.min(...n.map((e) => e.length));
-  return Bt(t).map((e) => n.map((r) => r[e]));
-}
-function tt(n) {
-  return n < 0 ? n + 2 * Math.PI : n >= 2 * Math.PI ? n % (2 * Math.PI) : n;
-}
-function ht(n, t, e) {
-  let r = t - n;
-  return e && (r = -r), r < 0 && (r += 2 * Math.PI), r;
-}
-const Q = (n, t, e) => {
-  const r = $(n.V, t.V), s = X(n.V), i = X(t.V), o = e ? e * e : n.precision * t.precision;
-  if (r * r < s * i * o)
-    return "parallel";
-  const a = y(t.firstPoint, n.firstPoint), u = $(a, t.V) / r, c = $(a, n.V) / r;
-  return {
-    intersectionParam1: u,
-    intersectionParam2: c
-  };
-};
-function yt(n, t, e = !1, r) {
-  const s = Q(n, t, r);
-  if (s === "parallel") {
-    if (!e)
-      return null;
-    if (n.isSame(t))
-      return n;
-    const a = J(
-      [
-        t.isOnSegment(n.firstPoint) ? n.firstPoint : null,
-        t.isOnSegment(n.lastPoint) ? n.lastPoint : null,
-        n.isOnSegment(t.firstPoint) ? t.firstPoint : null,
-        n.isOnSegment(t.lastPoint) ? t.lastPoint : null
-      ].filter((u) => u !== null)
-    ).sort((u, c) => u[0] - c[0]);
-    if (a.length === 0)
-      return null;
-    if (a.length === 1)
-      return null;
-    if (a.length === 2)
-      return new m(a[0], a[1]);
-    throw console.error(a), new Error(
-      "Unexpected number of points while intersecting parallel lines"
-    );
-  }
-  const { intersectionParam1: i, intersectionParam2: o } = s;
-  return !n.isValidParameter(i) || !t.isValidParameter(o) ? null : n.paramPoint(i);
-}
-const W = (n, t) => {
-  const e = y(n, t);
-  return Lt(e);
-};
-class g extends Mt {
-  constructor(t, e, r, s = !1, { ignoreChecks: i = !1 } = {}) {
-    if (super(t, e), this.segmentType = "ARC", this._angularLength = null, this._radius = null, this._firstAngle = null, this._lastAngle = null, this._boundingBox = null, this.center = r, this.clockwise = s, !i) {
-      if (h(t, e))
-        throw new Error("Invalid arc, cannot be a full circle");
-      if (Math.abs(this.radius - v(this.lastPoint, this.center)) > this.precision)
-        throw new Error(
-          "Invalid arc, radius does not match between start and end"
-        );
-    }
-  }
-  isValidParameter(t) {
-    return 1 - t >= -this.precision && t >= -this.precision;
-  }
-  angleToParam(t) {
-    return ht(this.firstAngle, tt(t), this.clockwise) / this.angularLength;
-  }
-  get angularLength() {
-    return this._angularLength || (this._angularLength = ht(
-      this.firstAngle,
-      this.lastAngle,
-      this.clockwise
-    )), this._angularLength;
-  }
-  paramPoint(t) {
-    return M(
-      this.center,
-      U(
-        this.radius,
-        this.firstAngle + t * this.angularLength * (this.clockwise ? -1 : 1)
-      )
-    );
-  }
-  pointToParam(t) {
-    const [e, r] = W(t, this.center);
-    if (Math.abs(e - this.radius) > this.precision)
-      throw new Error(
-        `Point ${B(t)} is not on segment ${this.repr}`
-      );
-    const s = this.angleToParam(r);
-    if (!this.isValidParameter(s))
-      throw new Error(
-        `Point ${B(t)} is not on segment ${this.repr}`
-      );
-    return s;
-  }
-  get radius() {
-    return this._radius === null && (this._radius = v(this.firstPoint, this.center)), this._radius;
-  }
-  get firstAngle() {
-    if (this._firstAngle === null) {
-      const [t, e] = y(this.firstPoint, this.center);
-      this._firstAngle = tt(Math.atan2(e, t));
-    }
-    return this._firstAngle;
-  }
-  get lastAngle() {
-    if (this._lastAngle === null) {
-      const [t, e] = y(this.lastPoint, this.center);
-      this._lastAngle = tt(Math.atan2(e, t));
-    }
-    return this._lastAngle;
-  }
-  get length() {
-    return this.radius * this.angularLength;
-  }
-  get squareLength() {
-    return this.length * this.length;
-  }
-  get midPoint() {
-    return this.paramPoint(0.5);
-  }
-  isSame(t) {
-    return !(t instanceof g) || !h(this.center, t.center) ? !1 : h(this.firstPoint, t.firstPoint) && h(this.lastPoint, t.lastPoint) && this.clockwise === t.clockwise || h(this.lastPoint, t.firstPoint) && h(this.firstPoint, t.lastPoint) && this.clockwise === !t.clockwise;
-  }
-  clone() {
-    return new g(
-      this.firstPoint,
-      this.lastPoint,
-      this.center,
-      this.clockwise
-    );
-  }
-  reverse() {
-    return new g(
-      this.lastPoint,
-      this.firstPoint,
-      this.center,
-      !this.clockwise
-    );
-  }
-  get boundingBox() {
-    if (this._boundingBox === null) {
-      const t = this.radius + this.precision, e = (r) => this.isValidParameter(this.angleToParam(r));
-      this._boundingBox = new q(
-        e(Math.PI) ? this.center[0] - t : Math.min(this.firstPoint[0], this.lastPoint[0]) - this.precision,
-        e(Math.PI * 1.5) ? this.center[1] - t : Math.min(this.firstPoint[1], this.lastPoint[1]) - this.precision,
-        e(0) ? this.center[0] + t : Math.max(this.firstPoint[0], this.lastPoint[0]) + this.precision,
-        e(Math.PI / 2) ? this.center[1] + t : Math.max(this.firstPoint[1], this.lastPoint[1]) + this.precision
-      );
-    }
-    return this._boundingBox;
-  }
-  distanceFrom(t) {
-    const [e, r] = W(t, this.center);
-    return this.isValidParameter(this.angleToParam(r)) ? Math.abs(e - this.radius) : Math.sqrt(
-      Math.min(
-        j(t, this.firstPoint),
-        j(t, this.lastPoint)
-      )
-    );
-  }
-  isOnSegment(t) {
-    const [e, r] = W(t, this.center);
-    if (Math.abs(e - this.radius) > this.precision)
-      return !1;
-    const s = this.angleToParam(r);
-    return this.isValidParameter(s);
-  }
-  tangentAt(t) {
-    const [e, r] = W(t, this.center);
-    if (Math.abs(e - this.radius) > this.precision)
-      throw new Error("Point is not on the arc");
-    const s = this.angleToParam(r);
-    if (!this.isValidParameter(s))
-      throw new Error("Point is not on the arc");
-    const i = U(1, r);
-    return (this.clockwise ? Z : C)(E(i));
-  }
-  get tangentAtFirstPoint() {
-    const t = U(1, this.firstAngle);
-    return (this.clockwise ? Z : C)(E(t));
-  }
-  get tangentAtLastPoint() {
-    const t = U(1, this.lastAngle);
-    return (this.clockwise ? Z : C)(E(t));
-  }
-  splitAt(t) {
-    let e;
-    if (Array.isArray(t) && t.length === 0)
-      return [this];
-    Array.isArray(t[0]) ? e = t : e = [t];
-    const s = [0, 1, ...e.map((a) => this.pointToParam(a))], i = new Map(
-      L([s, [this.firstPoint, this.lastPoint, ...e]])
-    );
-    s.sort((a, u) => a - u);
-    let o = null;
-    return s.flatMap((a, u) => {
-      if (u === s.length - 1)
-        return [];
-      const c = s[u + 1];
-      if (c - a < this.precision)
-        return o === null && (o = a), [];
-      const l = o === null ? a : o, f = new g(
-        i.get(l) || this.paramPoint(l),
-        i.get(c) || this.paramPoint(c),
-        this.center,
-        this.clockwise
-      );
-      return o = null, f;
-    });
-  }
-  transform(t) {
-    return new g(
-      t.transform(this.firstPoint),
-      t.transform(this.lastPoint),
-      t.transform(this.center),
-      t.keepsOrientation() ? this.clockwise : !this.clockwise
-    );
-  }
-}
-function rn(n, t, e) {
-  const r = new m(t, n), s = new m(t, e), i = C(r.tangentAtFirstPoint), o = C(s.tangentAtLastPoint), a = Q(
-    { firstPoint: r.midPoint, V: i, precision: 1e-9 },
-    { firstPoint: s.midPoint, V: o, precision: 1e-9 }
-  );
-  if (a === "parallel")
-    throw new Error("Cannot create an arc from three colinear points");
-  const u = $(
-    y(n, t),
-    y(e, t)
-  ) > 0;
-  return new g(
-    n,
-    e,
-    M(r.midPoint, k(i, a.intersectionParam1)),
-    u,
-    { ignoreChecks: !0 }
-  );
-}
-function sn(n, t, e) {
-  const r = new m(t, n), s = C(r.tangentAtFirstPoint), i = Q(
-    { firstPoint: r.midPoint, V: s, precision: 1e-9 },
-    {
-      firstPoint: n,
-      V: C(e),
-      precision: 1e-9
-    }
-  );
-  if (i === "parallel")
-    throw new Error("Cannot create an arc from three colinear points");
-  const o = M(
-    r.midPoint,
-    k(s, i.intersectionParam1)
-  ), a = $(
-    y(o, n),
-    M(n, e)
-  ) > 0;
-  return new g(n, t, o, a, {
-    ignoreChecks: !0
-  });
-}
-function Tt(n, t) {
-  const e = y(t, n.firstPoint), r = et(e, n.V) / n.squareLength;
-  return n.paramPoint(r);
-}
-function z(n, t, e) {
-  const r = e || n.precision, s = Tt(n, t.center), i = v(s, t.center);
-  if (i > t.radius + r)
-    return [];
-  if (Math.abs(i - t.radius) < r) {
-    const f = s;
-    return n.isOnSegment(f) && t.isOnSegment(f) ? [f] : [];
-  }
-  const o = [], a = Math.sqrt(
-    t.radius * t.radius - i * i
-  ), u = n.tangentAtFirstPoint, c = M(s, k(u, a));
-  n.isOnSegment(c) && t.isOnSegment(c) && o.push(c);
-  const l = M(s, k(u, -a));
-  return n.isOnSegment(l) && t.isOnSegment(l) && o.push(l), o;
-}
-const _t = (n) => {
-  const { firstPoint: t, lastPoint: e, center: r, clockwise: s } = n;
-  return new g(e, t, r, s, {
-    ignoreChecks: !0
-  });
-}, $t = (n, t) => {
-  if (n.isSame(t))
-    return [n];
-  const e = J(
-    [
-      t.isOnSegment(n.firstPoint) ? n.firstPoint : null,
-      t.isOnSegment(n.lastPoint) ? n.lastPoint : null,
-      n.isOnSegment(t.firstPoint) ? t.firstPoint : null,
-      n.isOnSegment(t.lastPoint) ? t.lastPoint : null
-    ].filter((r) => r !== null)
-    // We sort by the param value of the first arc. This means that the points
-    // will be sorted with the same orientation than arc1
-  ).sort((r, s) => n.pointToParam(r) - n.pointToParam(s));
-  if (e.length === 0)
-    return [];
-  if (e.length === 1)
-    return [];
-  if (e.length === 2)
-    return n.isSame(_t(t)) ? [] : [new g(e[0], e[1], n.center, n.clockwise)];
-  if (e.length === 3) {
-    const r = h(e[0], t.lastPoint) || h(e[0], t.firstPoint) ? 1 : 0;
-    return [
-      new g(
-        e[0 + r],
-        e[1 + r],
-        n.center,
-        n.clockwise
-      )
-    ];
-  } else if (e.length === 4)
-    return [
-      new g(e[0], e[1], n.center, n.clockwise),
-      new g(e[2], e[3], n.center, n.clockwise)
-    ];
-  throw new Error("Bug in the arc arc overlap algorithm");
-};
-function St(n, t, e = !1, r) {
-  const s = r || n.precision, i = v(n.center, t.center), o = n.radius + t.radius;
-  if (i > o + s)
-    return [];
-  const a = Math.abs(n.radius - t.radius);
-  if (i < a - s)
-    return [];
-  if (i < s)
-    return a > s ? [] : e ? $t(n, t) : [];
-  const u = E(y(t.center, n.center)), c = i > o - s;
-  if (
-    // circles are outside each other
-    c || // circles are inside each other
-    Math.abs(i - a) < s
-  ) {
-    const I = c || n.radius > t.radius ? 1 : -1, S = M(
-      n.center,
-      k(u, I * n.radius)
-    );
-    return n.isOnSegment(S) && t.isOnSegment(S) ? [S] : [];
-  }
-  const l = n.radius * n.radius / (2 * i) - t.radius * t.radius / (2 * i) + i / 2, f = M(
-    n.center,
-    k(u, l)
-  ), P = Math.sqrt(
-    n.radius * n.radius - l * l
-  ), p = C(u), d = M(f, k(p, P)), w = M(f, k(p, -P)), x = [];
-  return n.isOnSegment(d) && t.isOnSegment(d) && x.push(d), n.isOnSegment(w) && t.isOnSegment(w) && x.push(w), x;
-}
-function on(n, t, e) {
-  if (n instanceof m && t instanceof m) {
-    const r = yt(
-      n,
-      t,
-      !1,
-      e
-    );
-    return r === null ? [] : [r];
-  }
-  if (n instanceof m && t instanceof g)
-    return z(n, t, e);
-  if (n instanceof g && t instanceof m)
-    return z(t, n, e);
-  if (n instanceof g && t instanceof g)
-    return St(n, t, !1, e);
-  throw new Error("Not implemented");
-}
-function ot(n, t, e) {
-  if (n instanceof m && t instanceof m) {
-    const r = yt(
-      n,
-      t,
-      !0,
-      e
-    );
-    return r === null ? { intersections: [], overlaps: [], count: 0 } : r instanceof m ? { intersections: [], overlaps: [r], count: 1 } : { intersections: [r], overlaps: [], count: 1 };
-  }
-  if (!n.boundingBox.overlaps(t.boundingBox))
-    return { intersections: [], overlaps: [], count: 0 };
-  if (n instanceof m && t instanceof g) {
-    const r = z(n, t, e);
-    return { intersections: r, overlaps: [], count: r.length };
-  }
-  if (n instanceof g && t instanceof m) {
-    const r = z(t, n, e);
-    return { intersections: r, overlaps: [], count: r.length };
-  }
-  if (n instanceof g && t instanceof g) {
-    const r = St(
-      n,
-      t,
-      !0,
-      e
-    );
-    return r.length ? r[0] instanceof g ? {
-      intersections: [],
-      overlaps: r,
-      count: r.length
-    } : {
-      intersections: r,
-      overlaps: [],
-      count: r.length
-    } : { intersections: [], overlaps: [], count: 0 };
-  }
-  throw new Error("Not implemented");
-}
-function bt(n) {
-  const t = [];
-  for (let e = 0; e < n; e++)
-    for (let r = 0; r <= e; r++)
-      t.push([e, r]);
-  return t;
-}
-function* rt(n) {
-  for (const [t, e] of bt(n.length))
-    t !== e && (yield [n[t], n[e]]);
-}
-class b extends K {
-  constructor(t, e = [], { ignoreChecks: r = !1 } = {}) {
-    super(), r || qt(t, e), this.contour = t, this.holes = e;
-  }
-  get boundingBox() {
-    return this.contour.boundingBox;
-  }
-  get isFull() {
-    return this.holes.length === 0;
-  }
-  get allLoops() {
-    return [this.contour, ...this.holes];
-  }
-  clone() {
-    return new b(
-      this.contour.clone(),
-      this.holes.map((t) => t.clone())
-    );
-  }
-  transform(t) {
-    return new b(
-      this.contour.transform(t),
-      this.holes.map((e) => e.transform(t))
-    );
-  }
-  contains(t) {
-    return this.contour.contains(t) && !this.holes.some((e) => e.contains(t));
-  }
-  intersects(t) {
-    return this.allLoops.some(
-      (e) => t.allLoops.some((r) => e.intersects(r))
-    );
-  }
-}
-function qt(n, t = []) {
-  if (!n)
-    throw new Error("Figure must have a contour");
-  for (const [e, r] of rt([n, ...t]))
-    if (e.intersects(r))
-      throw new Error("Loops in a figure must not intersect");
-  if (t.some((e) => !n.contains(e.firstPoint)))
-    throw new Error("Holes must be inside the contour");
-  for (const [e, r] of rt(t))
-    if (e.contains(r.firstPoint))
-      throw console.error(wt(e), wt(r)), new Error("Holes must not be inside other holes");
-}
-const Dt = (n) => {
-  const t = n.map((s, i) => n.slice(i + 1).map((o, a) => [a + i + 1, o]).filter(([, o]) => s.boundingBox.overlaps(o.boundingBox)).map(([o]) => o)), e = [], r = Array(t.length);
-  return t.forEach((s, i) => {
-    let o = r[i];
-    o || (o = [], e.push(o)), o.push(n[i]), s.length && s.forEach((a) => {
-      r[a] = o;
-    });
-  }), e;
-}, At = (n) => n.map((t, e) => {
-  const s = t.segments[0].midPoint, i = n.filter((o, a) => e === a ? !1 : o.contains(s));
-  return {
-    loop: t,
-    isIn: i
-  };
-}), jt = (n, t) => n.flatMap(({ loop: e }) => at(
-  t.filter(
-    ({ loop: r, isIn: s }) => r === e || s.indexOf(e) !== -1
-  )
-)), Nt = (n, t) => {
-  const e = t.filter(({ isIn: s }) => s.length <= 1), r = at(
-    At(n.map(({ loop: s }) => s))
-  );
-  return [e, ...r];
-}, at = (n) => {
-  if (!n.length)
-    return [];
-  const t = n.filter(({ isIn: r }) => !r.length), e = n.filter(({ isIn: r }) => r.length > 1);
-  return t.length === 1 && e.length === 0 ? [n] : t.length > 1 ? jt(t, n) : Nt(e, n);
-};
-function D(n) {
-  return Dt(n).map(At).flatMap(at).map((e) => {
-    if (e.length === 1)
-      return new b(e[0].loop);
-    e.sort((i, o) => i.isIn.length - o.isIn.length);
-    const [r, ...s] = e.map(({ loop: i }) => i);
-    return new b(r, s);
-  });
-}
-function Rt(n, t) {
-  const e = [];
-  for (const r of n)
-    for (const s of t)
-      e.push([r, s]);
-  return e;
-}
-class kt extends K {
-  constructor(t, { ignoreChecks: e = !1 } = {}) {
-    super(), this._boundingBox = null, e || vt(t), this.segments = t;
-  }
-  get repr() {
-    return this.segments.map((t) => t.repr).join(`
-`) + `
-`;
-  }
-  get firstPoint() {
-    return this.segments[0].firstPoint;
-  }
-  get lastPoint() {
-    return this.segments[this.segments.length - 1].lastPoint;
-  }
-  get segmentsCount() {
-    return this.segments.length;
-  }
-  onStroke(t) {
-    return this.segments.some((e) => e.isOnSegment(t));
-  }
-  intersects(t) {
-    return this.boundingBox.overlaps(t.boundingBox) ? this.segments.some(
-      (e) => t.segments.some(
-        (r) => ot(e, r).count > 0
-      )
-    ) : !1;
-  }
-  get boundingBox() {
-    if (this._boundingBox === null) {
-      let t = this.segments[0].boundingBox;
-      this.segments.slice(1).forEach((e) => {
-        t = t.merge(e.boundingBox);
-      }), this._boundingBox = t;
-    }
-    return this._boundingBox;
-  }
-  [Symbol.for("nodejs.util.inspect.custom")]() {
-    return this.repr;
-  }
-}
-function Gt(n, t = "Stroke") {
-  bt(n.length).forEach(
-    ([e, r]) => {
-      if (e === r)
-        return;
-      const s = n[e], i = n[r], o = ot(s, i);
-      if (o.count !== 0) {
-        if (o.count === 1 && !o.overlaps.length) {
-          const a = e - r, u = o.intersections[0];
-          if (a === 1 && h(s.firstPoint, u) || a === -1 && h(s.lastPoint, u) || a === n.length - 1 && h(s.lastPoint, u) && h(i.firstPoint, u) || -a === n.length - 1 && h(s.firstPoint, u) && h(i.lastPoint, u))
-            return;
-        }
-        throw new Error(
-          `${t} segments must not intersect, but segments ${s.repr} and ${i.repr} do`
-        );
-      }
-    }
-  );
-}
-function vt(n, t = "Stroke") {
-  if (n.length === 0)
-    throw new Error(`${t} must have at least one segment`);
-  L([n.slice(0, -1), n.slice(1)]).forEach(
-    ([e, r]) => {
-      if (!h(e.lastPoint, r.firstPoint))
-        throw new Error(
-          `${t} segments must be connected, but ${e.repr} and ${r.repr} are not`
-        );
-    }
-  ), Gt(n, t);
-}
-function ft(n, t) {
-  return !!(n instanceof m && t instanceof m && xt(n.V, t.V) || n instanceof g && t instanceof g && h(n.center, t.center) && n.radius - t.radius < n.precision);
-}
-function gt(n, t) {
-  if (n instanceof m && t instanceof m)
-    return new m(n.firstPoint, t.lastPoint);
-  if (n instanceof g && t instanceof g)
-    return new g(
-      n.firstPoint,
-      t.lastPoint,
-      n.center,
-      n.clockwise
-    );
-  throw new Error("Not implemented");
-}
-function Ct(n) {
-  let t = !1;
-  const e = [];
-  for (const r of n.segments) {
-    if (e.length === 0) {
-      e.push(r);
-      continue;
-    }
-    const s = e[e.length - 1];
-    ft(s, r) ? (t = !0, e.pop(), e.push(gt(s, r))) : e.push(r);
-  }
-  if (h(n.firstPoint, n.lastPoint) && ft(
-    e[0],
-    e[e.length - 1]
-  )) {
-    t = !0;
-    const r = e.pop();
-    e[0] = gt(r, e[0]);
-  }
-  return t ? e : null;
-}
-class A extends kt {
-  constructor() {
-    super(...arguments), this.strokeType = "STRAND";
-  }
-  reverse() {
-    const t = this.segments.map((e) => e.reverse());
-    return t.reverse(), new A(t, { ignoreChecks: !0 });
-  }
-  clone() {
-    return new A(
-      this.segments.map((t) => t.clone()),
-      { ignoreChecks: !0 }
-    );
-  }
-  extend(t) {
-    if (!h(this.lastPoint, t.firstPoint))
-      throw console.error(this.repr, t.repr), new Error("Cannot extend strand: connection point is not the same");
-    return new A([...this.segments, ...t.segments]);
-  }
-  simplify() {
-    const t = Ct(this);
-    return t ? new A(t, { ignoreChecks: !0 }) : this;
-  }
-  transform(t) {
-    return new A(
-      this.segments.map((e) => e.transform(t)),
-      { ignoreChecks: !0 }
-    );
-  }
-}
-const Ut = (n, t) => {
-  const e = Q(t, {
-    V: [1, 0],
-    firstPoint: n,
-    precision: t.precision
-  });
-  if (e === "parallel")
-    return 0;
-  const { intersectionParam1: r, intersectionParam2: s } = e;
-  if (!t.isValidParameter(r) || s <= -t.precision)
-    return 0;
-  if (Math.abs(r) < t.precision || Math.abs(r - 1) < t.precision) {
-    const [, i] = t.midPoint;
-    return n[1] - i < 0 ? 1 : 0;
-  }
-  return 1;
-}, Wt = (n, t) => {
-  const e = t.precision, r = Math.abs(n[1] - t.center[1]);
-  if (r > t.radius + e)
-    return 0;
-  const s = j(n, t.center), i = t.radius * t.radius, o = e * e;
-  if (Math.abs(s - i) < o)
-    return 0;
-  const a = s - i > o;
-  if (a && t.center[0] < n[0])
-    return 0;
-  const u = Math.sqrt(
-    t.radius * t.radius - r * r
-  );
-  let c = 0;
-  const l = (f) => {
-    t.isOnSegment(f) && (h(f, t.firstPoint) ? c += t.tangentAtFirstPoint[1] > 0 ? 1 : 0 : h(f, t.lastPoint) ? c += t.tangentAtLastPoint[1] > 0 ? 0 : 1 : c += 1);
-  };
-  return l([t.center[0] + u, n[1]]), a && l([t.center[0] - u, n[1]]), c;
-};
-function Xt(n, t) {
-  if (t instanceof m)
-    return Ut(n, t);
-  if (t instanceof g)
-    return Wt(n, t);
-  throw new Error("Not implemented");
-}
-class F extends kt {
-  constructor(t, { ignoreChecks: e = !1 } = {}) {
-    super(t, { ignoreChecks: !0 }), this.strokeType = "LOOP", this._clockwise = null, e || zt(t);
-  }
-  get clockwise() {
-    if (this._clockwise === null) {
-      const t = this.segments.flatMap((r) => r instanceof m ? [r.firstPoint] : [r.firstPoint, r.paramPoint(0.5)]), e = t.map((r, s) => {
-        const i = t[(s + 1) % t.length];
-        return (i[0] - r[0]) * (i[1] + r[1]);
-      }).reduce((r, s) => r + s, 0);
-      this._clockwise = e > 0;
-    }
-    return this._clockwise;
-  }
-  clone() {
-    return new F(
-      this.segments.map((t) => t.clone()),
-      { ignoreChecks: !0 }
-    );
-  }
-  reverse() {
-    const t = this.segments.map((e) => e.reverse());
-    return t.reverse(), new F(t, { ignoreChecks: !0 });
-  }
-  transform(t) {
-    return new F(
-      this.segments.map((e) => e.transform(t)),
-      { ignoreChecks: !0 }
-    );
-  }
-  contains(t) {
-    return this.onStroke(t) || !this.boundingBox.contains(t) ? !1 : this.segments.reduce((r, s) => r + Xt(t, s), 0) % 2 === 1;
-  }
-  simplify() {
-    const t = Ct(this);
-    return t ? new F(t, { ignoreChecks: !0 }) : this;
-  }
-}
-function zt(n) {
-  if (vt(n, "Loop"), !h(n[0].firstPoint, n[n.length - 1].lastPoint))
-    throw new Error("Loop segment must be closed");
-}
-const mt = (n, t) => {
-  const e = n.findIndex((i) => h(t, i.firstPoint)), r = n.slice(0, e);
-  return n.slice(e).concat(r);
-}, Pt = (n, t) => {
-  let e = n;
-  const r = (a) => h(a.firstPoint, t.firstPoint) && h(a.lastPoint, t.lastPoint);
-  let s = n.findIndex(r);
-  if (s === -1) {
-    const a = n.map((u) => u.reverse());
-    if (a.reverse(), s = a.findIndex(r), s === -1)
-      throw console.error(
-        a.map((u) => u.repr),
-        t.repr
-      ), new Error("Failed to rotate to segment start");
-    e = a;
-  }
-  const i = e.slice(0, s);
-  return e.slice(s).concat(i);
-};
-function* pt(n, t, e) {
-  const r = (o) => t.some((a) => h(a, o.lastPoint)), s = (o) => e.some((a) => o.isSame(a));
-  let i = [];
-  for (const o of n)
-    r(o) ? (i.push(o), yield new A(i, { ignoreChecks: !0 }), i = []) : s(o) ? (i.length && (yield new A(i, { ignoreChecks: !0 }), i = []), yield new A([o], { ignoreChecks: !0 })) : i.push(o);
-  i.length && (yield new A(i, { ignoreChecks: !0 }));
-}
-function Ht(n, t, e) {
-  return n.filter((r) => {
-    const s = t.filter((a) => h(a.firstPoint, r) || h(a.lastPoint, r));
-    if (s.length % 2)
-      throw new Error("Bug in the intersection algo on non crossing point");
-    const i = s.map((a) => e.contains(a.midPoint));
-    return !(i.every((a) => a) || !i.some((a) => a));
-  });
-}
-function Yt(n, t, e) {
-  let r = [];
-  const s = [], i = new Array(n.segments.length).fill(0).map(() => []), o = new Array(t.segments.length).fill(0).map(() => []);
-  if (n.segments.forEach((P, p) => {
-    t.segments.forEach((d, w) => {
-      const { intersections: x, overlaps: I } = ot(
-        P,
-        d,
-        e
-      );
-      r.push(...x), i[p].push(...x), o[w].push(...x), s.push(...I);
-      const S = I.flatMap((T) => [
-        T.firstPoint,
-        T.lastPoint
-      ]);
-      r.push(...S), i[p].push(...S), o[w].push(...S);
-    });
-  }), r = J(r, e), !r.length || r.length === 1)
-    return null;
-  const a = ([P, p]) => p.length ? P.splitAt(p) : [P];
-  let u = L([n.segments, i]).flatMap(a), c = L([t.segments, o]).flatMap(a);
-  if (r = Ht(
-    r,
-    u,
-    t
-  ), !r.length && !s.length)
-    return null;
-  if (s.length) {
-    const P = s[0];
-    u = Pt(
-      u,
-      P
-    ), c = Pt(
-      c,
-      P
-    );
-  } else {
-    const P = r[0];
-    u = mt(u, P), c = mt(c, P);
-  }
-  const l = Array.from(
-    pt(
-      u,
-      r,
-      s
-    )
-  );
-  let f = Array.from(
-    pt(
-      c,
-      r,
-      s
-    )
-  );
-  return (!h(
-    f[0].lastPoint,
-    l[0].lastPoint
-  ) || s.length > 0 && f[0].segmentsCount !== 1) && (f = f.reverse().map((P) => P.reverse())), L([l, f]).map(([P, p]) => P.segmentsCount === 1 && s.some((d) => P.segments[0].isSame(d)) ? [P, "same"] : [P, p]);
-}
-function nt(n) {
-  let t = n[0];
-  for (const e of n.slice(1))
-    t = t.extend(e);
-  if (!h(t.firstPoint, t.lastPoint))
-    throw console.error(
-      B(t.firstPoint),
-      B(t.lastPoint)
-    ), new Error("Bug in the intersection algo on non closing strand");
-  return new F(t.segments);
-}
-function Jt(n) {
-  if (!n.length)
-    return [];
-  const t = n.map((o) => o.firstPoint);
-  let e = n.map((o) => o.lastPoint);
-  e = e.slice(-1).concat(e.slice(0, -1));
-  const r = L([t, e]).flatMap(
-    ([o, a], u) => h(o, a) ? [] : u
-  );
-  if (!r.length)
-    return [nt(n)];
-  const s = L([
-    r.slice(0, -1),
-    r.slice(1)
-  ]).map(([o, a]) => nt(n.slice(o, a)));
-  let i = n.slice(
-    r[r.length - 1]
-  );
-  return r[0] !== 0 && (i = i.concat(n.slice(0, r[0]))), s.push(nt(i)), s;
-}
-const dt = (n, t) => {
-  if (n.length === 0)
-    return [t];
-  const e = n.at(-1);
-  return h(e.lastPoint, t.firstPoint) ? n.slice(0, -1).concat([e.extend(t)]) : h(e.lastPoint, t.lastPoint) ? n.slice(0, -1).concat([e.extend(t.reverse())]) : n.concat([t]);
-}, Kt = (n, t) => n.length === 0 ? [t] : h(n[0].firstPoint, t.lastPoint) ? [t.extend(n[0])].concat(n.slice(1)) : [t].concat(n);
-function ut(n, t, {
-  firstInside: e,
-  secondInside: r
-}) {
-  const s = Yt(n, t);
-  if (!s) {
-    const u = n.segments[0].midPoint, c = t.contains(u), l = t.segments[0].midPoint, f = n.contains(l);
-    return {
-      identical: !1,
-      firstCurveInSecond: c,
-      secondCurveInFirst: f
-    };
-  }
-  if (s.every(([, u]) => u === "same"))
-    return { identical: !0 };
-  let i = null, o = null;
-  const a = s.flatMap(([u, c]) => {
-    let l = [], f = 0;
-    if (c === "same")
-      return o === 1 ? (o = 1, u) : o === 2 || o === 0 ? (o = null, []) : o === null ? (i ? i = i.extend(u) : i = u, []) : (console.error("weird situation"), []);
-    const P = u.segments[0].midPoint, p = t.contains(P);
-    (e === "keep" && p || e === "remove" && !p) && (f += 1, l = dt(l, u));
-    const d = c.segments[0].midPoint, w = n.contains(d);
-    if (r === "keep" && w || r === "remove" && !w) {
-      const x = c;
-      f += 1, f === 2 && l.length ? (l = dt(l, x), i = null) : l = [x];
-    }
-    return o === null && f === 1 && i && (l = Kt(l, i)), f === 1 && (o = f, i = null), l.length ? l : (i = null, []);
-  });
-  return Jt(a);
-}
-const Qt = (n, t) => {
-  const e = ut(n, t, {
-    firstInside: "remove",
-    secondInside: "remove"
-  });
-  return Array.isArray(e) ? e : e.identical ? [n] : e.firstCurveInSecond ? [t] : e.secondCurveInFirst ? [n] : [n, t];
-}, H = (n, t) => {
-  const e = ut(n, t, {
-    firstInside: "remove",
-    secondInside: "keep"
-  });
-  return Array.isArray(e) ? e : e.identical ? [] : e.firstCurveInSecond ? [] : e.secondCurveInFirst ? [n, t] : [n];
-}, ct = (n, t) => {
-  const e = ut(n, t, {
-    firstInside: "keep",
-    secondInside: "keep"
-  });
-  return Array.isArray(e) ? e : e.identical ? [n] : e.firstCurveInSecond ? [n] : e.secondCurveInFirst ? [t] : [];
-};
-function Zt(n) {
-  const t = /* @__PURE__ */ new Map(), e = [];
-  return n.forEach((r, s) => {
-    let i;
-    t.has(s) ? i = t.get(s) : (i = { current: [r], fusedWith: /* @__PURE__ */ new Set([s]) }, e.push(i)), n.slice(s + 1).forEach((o, a) => {
-      const u = i.current, c = s + a + 1;
-      if (i.fusedWith.has(c))
-        return;
-      let l = [o], f = !1;
-      if (t.has(c) && (l = t.get(c).current, f = !0), !u.some(
-        (d) => l.some((w) => d.intersects(w))
-      ))
-        return;
-      let p;
-      u.length > 1 || l.length > 1 ? p = N(u, l) : p = It(u[0], l[0]), i.fusedWith.add(c), i.current = p, f || t.set(c, i);
-    });
-  }), e.flatMap(({ current: r }) => r);
-}
-function It(n, t) {
-  const e = Qt(n.contour, t.contour), r = t.holes.flatMap((o) => H(o, n.contour)), s = n.holes.flatMap((o) => H(o, t.contour)), i = Rt(n.holes, t.holes).flatMap(
-    ([o, a]) => ct(o, a)
-  );
-  return D([
-    ...e,
-    ...r,
-    ...s,
-    ...i
-  ]);
-}
-function Y(n, t) {
-  if (n.isFull && t.isFull)
-    return D(H(n.contour, t.contour));
-  if (n.isFull) {
-    const r = H(n.contour, t.contour), s = t.holes.flatMap(
-      (i) => ct(i, n.contour)
-    );
-    return D([...r, ...s]);
-  } else if (t.isFull && !n.contour.intersects(t.contour))
-    if (n.contour.contains(t.contour.firstPoint)) {
-      const r = N(
-        n.holes.map((s) => new b(s)),
-        [t]
-      );
-      return D([
-        n.contour,
-        ...r.flatMap((s) => s.allLoops)
-      ]);
-    } else
-      return [n];
-  let e = Y(new b(n.contour), t);
-  return n.holes.forEach((r) => {
-    e = e.flatMap((s) => Y(s, new b(r)));
-  }), e;
-}
-function tn(n, t) {
-  const e = ct(n.contour, t.contour);
-  if (!e.length)
-    return [];
-  let r = D(e);
-  return r = R(
-    r,
-    n.holes.map((s) => new b(s))
-  ), R(
-    r,
-    t.holes.map((s) => new b(s))
-  );
-}
-function N(n, t) {
-  if (!n.length)
-    return t;
-  if (!t.length)
-    return n;
-  if (n.length === 1 && t.length > 1 || t.length === 1 && n.length > 1)
-    return Zt([...n, ...t]);
-  if (n.length > 1 && t.length > 1) {
-    let e = N([n[0]], t);
-    return n.slice(1).forEach((r) => {
-      e = N([r], e);
-    }), e;
-  }
-  return n.length === 1 && t.length === 1 ? It(n[0], t[0]) : [];
-}
-function R(n, t) {
-  if (!n.length)
-    return [];
-  if (!t.length)
-    return n;
-  if (n.length === 1 && t.length === 1)
-    return Y(n[0], t[0]);
-  if (n.length > 1)
-    return n.flatMap((r) => R([r], t));
-  let e = Y(n[0], t[0]);
-  return t.slice(1).forEach((r) => {
-    e = R(e, [r]);
-  }), e;
-}
-function st(n, t) {
-  return !n.length || !t.length ? [] : n.length === 1 && t.length === 1 ? tn(n[0], t[0]) : n.length > 1 ? n.flatMap((e) => st([e], t)) : t.flatMap((e) => st(n, [e]));
-}
-class O extends K {
-  constructor(t = [], { ignoreChecks: e = !1 } = {}) {
-    super(), this._boundingBox = null, e || nn(t), this.figures = t;
-  }
-  get isEmpty() {
-    return this.figures.length === 0;
-  }
-  get boundingBox() {
-    if (this.isEmpty)
-      return new q();
-    if (this._boundingBox === null) {
-      let t = this.figures[0].boundingBox;
-      for (const e of this.figures.slice(1))
-        t = t.merge(e.boundingBox);
-      this._boundingBox = t;
-    }
-    return this._boundingBox;
-  }
-  clone() {
-    return new O(this.figures.map((t) => t.clone()));
-  }
-  transform(t) {
-    return new O(this.figures.map((e) => e.transform(t)));
-  }
-  contains(t) {
-    return this.figures.some((e) => e.contains(t));
-  }
-  intersects(t) {
-    return this.figures.some(
-      (e) => t.figures.some((r) => e.intersects(r))
-    );
-  }
-  fuse(t) {
-    return new O(N(this.figures, t.figures));
-  }
-  cut(t) {
-    return new O(R(this.figures, t.figures));
-  }
-  intersect(t) {
-    return new O(st(this.figures, t.figures));
-  }
-}
-function nn(n) {
-  for (const [t, e] of rt(n))
-    if (t.intersects(e))
-      throw new Error("Diagram figures must not intersect");
-}
-function Vt(n) {
-  if (n instanceof m)
-    return {
-      type: n.segmentType,
-      firstPoint: n.firstPoint,
-      lastPoint: n.lastPoint
-    };
-  if (n instanceof g)
-    return {
-      type: n.segmentType,
-      firstPoint: n.firstPoint,
-      lastPoint: n.lastPoint,
-      center: n.center,
-      clockwise: n.clockwise
-    };
-  throw new Error("Unknown segment type");
-}
-function it(n) {
-  return {
-    type: "LOOP",
-    segments: n.segments.map(Vt)
-  };
-}
-function Et(n) {
-  return {
-    type: "FIGURE",
-    contour: it(n.contour),
-    holes: n.holes.map(it)
-  };
-}
-function en(n) {
-  return {
-    type: "DIAGRAM",
-    figures: n.figures.map(Et)
-  };
-}
-function wt(n) {
-  if (n instanceof O)
-    return en(n);
-  if (n instanceof b)
-    return Et(n);
-  if (n instanceof F)
-    return it(n);
-  if (n instanceof g || n instanceof m)
-    return Vt(n);
-  throw new Error("Unknown shape type");
-}
-export {
-  g as A,
-  q as B,
-  O as D,
-  b as F,
-  m as L,
-  A as S,
-  V as T,
-  M as a,
-  Z as b,
-  $ as c,
-  h as d,
-  rn as e,
-  on as f,
-  v as g,
-  y as h,
-  F as i,
-  U as j,
-  Ot as k,
-  N as l,
-  R as m,
-  st as n,
-  Q as o,
-  C as p,
-  z as q,
-  Tt as r,
-  k as s,
-  sn as t,
-  E as u,
-  St as v,
-  Ft as w,
-  ot as x,
-  j as y,
-  wt as z
-};
-//# sourceMappingURL=exportJSON-c42ca4ac.js.map