pantograph2d 0.1.0 → 0.3.0

package/dist/pantograph.js

@@ -1,172 +1,825 @@
-import { L as g, s as L, T, a as P, D as s, F as a, b as f, p as l, c as m, f as x, d as $, i as y } from "./Diagram-8b41118e.js";
-function D(t) {
-  if (!t.length)
-    throw new Error("No segments to close");
-  const n = t[0], e = t.at(-1);
-  return P(n.firstPoint, e.lastPoint) ? t : [
-    ...t,
-    new g(e.lastPoint, n.firstPoint)
+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);
+  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 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
+  );
+  if (Math.abs(i) < 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)
+    return null;
+  let h;
+  try {
+    h = ut(o, a, 1e-9).at(-1);
+  } catch {
+    return null;
+  }
+  if (!h)
+    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)
+    return console.warn(
+      "Cannot fillet between segments",
+      n.repr,
+      t.repr
+    ), [n, t];
+  const { first: r, second: s } = i;
+  return [
+    r,
+    nt(r.lastPoint, s.firstPoint, r.tangentAtLastPoint),
+    s
   ];
 }
-function h(t) {
-  return new s([new a(new f(t))]);
+function N(n, t, e) {
+  const i = rt(n, t, e);
+  if (!i)
+    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];
 }
-class k {
-  constructor(n = [0, 0]) {
-    this.pointer = n, this.firstPoint = n, this.pendingSegments = [];
+function X(n) {
+  return new P([new b(new I(n))]);
+}
+class Et {
+  constructor(t = [0, 0]) {
+    this.pointer = t, this.firstPoint = t, this.pendingSegments = [], this._nextCorner = null;
   }
-  movePointerTo(n) {
+  movePointerTo(t) {
     if (this.pendingSegments.length)
       throw new Error(
         "You can only move the pointer if there is no segment defined"
       );
-    return this.pointer = n, this.firstPoint = n, this;
+    return this.pointer = t, this.firstPoint = t, this;
   }
-  saveSegment(n) {
-    return this.pendingSegments.push(n), this;
+  saveSegment(t) {
+    if (_(t.firstPoint, t.lastPoint))
+      throw new Error(`Segment has no length, ${t.repr}`);
+    if (!this._nextCorner)
+      return this.pendingSegments.push(t), 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;
+    return this.pendingSegments.push(
+      ...i(e, t, this._nextCorner.radius)
+    ), this._nextCorner = null, this;
   }
-  lineTo(n) {
-    const e = new g(this.pointer, n);
-    return this.pointer = n, this.saveSegment(e);
+  lineTo(t) {
+    const e = new A(this.pointer, t);
+    return this.pointer = t, this.saveSegment(e);
   }
-  line(n, e) {
-    return this.lineTo([this.pointer[0] + n, this.pointer[1] + e]);
+  line(t, e) {
+    return this.lineTo([this.pointer[0] + t, this.pointer[1] + e]);
   }
-  vLine(n) {
-    return this.line(0, n);
+  vLine(t) {
+    return this.line(0, t);
   }
-  hLine(n) {
-    return this.line(n, 0);
+  hLine(t) {
+    return this.line(t, 0);
   }
-  vLineTo(n) {
-    return this.lineTo([this.pointer[0], n]);
+  vLineTo(t) {
+    return this.lineTo([this.pointer[0], t]);
   }
-  hLineTo(n) {
-    return this.lineTo([n, this.pointer[1]]);
+  hLineTo(t) {
+    return this.lineTo([t, this.pointer[1]]);
   }
-  polarLineTo([n, e]) {
-    const r = e * m, i = l(n, r);
-    return this.lineTo(i);
+  polarLineTo([t, e]) {
+    const i = e * R, r = Y(t, i);
+    return this.lineTo(r);
   }
-  polarLine(n, e) {
-    const r = e * m, [i, u] = l(n, r);
-    return this.line(i, u);
+  polarLine(t, e) {
+    const i = e * R, [r, s] = Y(t, i);
+    return this.line(r, s);
   }
-  tangentLine(n) {
+  tangentLine(t) {
     const e = this.pendingSegments.at(-1);
     if (!e)
       throw new Error("You need a previous segment to sketch a tangent line");
-    const [r, i] = e.tangentAtLastPoint;
-    return this.line(r * n, i * n);
+    const [i, r] = e.tangentAtLastPoint;
+    return this.line(i * t, r * t);
+  }
+  threePointsArcTo(t, e) {
+    return this.saveSegment(dt(this.pointer, e, t)), this.pointer = t, this;
+  }
+  threePointsArc(t, e, i, r) {
+    const [s, o] = this.pointer;
+    return this.threePointsArcTo(
+      [s + t, o + e],
+      [s + i, o + r]
+    );
+  }
+  sagittaArcTo(t, 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);
+  }
+  sagittaArc(t, e, i) {
+    return this.sagittaArcTo(
+      [t + this.pointer[0], e + this.pointer[1]],
+      i
+    );
+  }
+  vSagittaArc(t, e) {
+    return this.sagittaArc(0, t, e);
+  }
+  hSagittaArc(t, e) {
+    return this.sagittaArc(t, 0, e);
+  }
+  bulgeArcTo(t, e) {
+    if (!e)
+      return this.lineTo(t);
+    const i = S(this.pointer, t) / 2, r = -e * i;
+    return this.sagittaArcTo(t, r);
+  }
+  bulgeArc(t, e, i) {
+    return this.bulgeArcTo(
+      [t + this.pointer[0], e + this.pointer[1]],
+      i
+    );
+  }
+  vBulgeArc(t, e) {
+    return this.bulgeArc(0, t, e);
+  }
+  hBulgeArc(t, e) {
+    return this.bulgeArc(t, 0, e);
+  }
+  tangentArcTo(t) {
+    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;
+  }
+  tangentArc(t, e) {
+    const [i, r] = this.pointer;
+    return this.tangentArcTo([t + i, e + r]);
+  }
+  customCorner(t, 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;
+  }
+  _customCornerLastWithFirst(t, e = "fillet") {
+    if (!t)
+      return;
+    const i = this.pendingSegments.pop(), r = this.pendingSegments.shift();
+    if (!i || !r)
+      throw new Error("Not enough curves to close and fillet");
+    const s = e === "chamfer" ? N : V;
+    this.pendingSegments.push(...s(i, r, t));
   }
   close() {
-    const n = D(this.pendingSegments);
-    return h(n);
+    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(
+      this._nextCorner.radius,
+      this._nextCorner.mode
+    ), this._nextCorner = null), X(this.pendingSegments);
   }
   closeWithMirror() {
     if (!this.pendingSegments.length)
       throw new Error("No segments to close");
-    const n = this.pendingSegments[0], e = this.pendingSegments.at(-1), r = L(
+    const t = this.pendingSegments[0], e = this.pendingSegments.at(-1), i = L(
       e.lastPoint,
-      n.firstPoint
-    ), i = new T().mirrorLine(
-      r,
-      n.firstPoint
-    ), u = this.pendingSegments.map(
-      (o) => o.transform(i).reverse()
+      t.firstPoint
+    ), r = new gt().mirrorLine(
+      i,
+      t.firstPoint
+    ), s = this.pendingSegments.map(
+      (o) => o.transform(r).reverse()
     );
-    return u.reverse(), h([
+    return s.reverse(), X([
       ...this.pendingSegments,
-      ...u
+      ...s
     ]);
   }
 }
-function A(t = [0, 0]) {
-  return new k(t);
+function qt(n = [0, 0]) {
+  return new Et(n);
 }
-function c(t) {
-  if (t instanceof a)
-    return [t];
-  if (t instanceof f)
-    return [new a(t)];
-  if (t instanceof s)
-    return t.figures;
+function E(n) {
+  if (n instanceof b)
+    return [n];
+  if (n instanceof I)
+    return [new b(n)];
+  if (n instanceof P)
+    return n.figures;
   throw new Error("Unknown shape");
 }
-function E(t, n) {
-  return new s(
-    x(c(t), c(n))
+function Mt(n, t) {
+  return new P(
+    mt(E(n), E(t))
   );
 }
-function B(t) {
-  return t.reduce(
-    (n, e) => E(n, e),
-    new s()
+function G(n) {
+  return n.reduce(
+    (t, e) => Mt(t, e),
+    new P()
   );
 }
-function M(t, n) {
-  return new s(
-    $(c(t), c(n))
+function Tt(n, t) {
+  return new P(
+    wt(E(n), E(t))
   );
 }
-function G(t, n) {
-  return new s(
-    y(c(t), c(n))
+function zt(n, t) {
+  return new P(
+    Pt(E(n), E(t))
+  );
+}
+function q(n) {
+  return n < 0 ? "before" : n > 1 ? "after" : "between";
+}
+const z = (n, t, e) => {
+  if (e === "before")
+    return n.distanceFrom(t.firstPoint);
+  if (e === "after")
+    return n.distanceFrom(t.lastPoint);
+  throw new Error("Invalid position");
+};
+function It(n, t) {
+  const e = At(n, t);
+  if (e === "parallel")
+    return Math.min(
+      n.distanceFrom(t.firstPoint),
+      n.distanceFrom(t.lastPoint)
+    );
+  const { intersectionParam1: i, intersectionParam2: r } = e, s = q(i), o = q(r);
+  if (s === "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);
+  throw new Error("Invalid position");
+}
+function W(n, t) {
+  if (xt(n, t).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))
+      return 0;
+    if (i - t.radius > n.precision) {
+      const r = it(
+        L(e, t.center)
+      ), s = F(
+        t.center,
+        v(r, t.radius)
+      );
+      if (t.isOnSegment(s))
+        return S(s, e);
+    }
+  }
+  return Math.min(
+    t.distanceFrom(n.firstPoint),
+    t.distanceFrom(n.lastPoint),
+    n.distanceFrom(t.firstPoint),
+    n.distanceFrom(t.lastPoint)
   );
 }
-function F(t) {
-  if (t instanceof g)
-    return `L ${t.lastPoint.join(" ")}`;
+const Lt = (n, t) => {
+  const e = n.angleToParam(t.firstAngle);
+  if (n.isValidParameter(e))
+    return !0;
+  const i = n.angleToParam(t.lastAngle);
+  return !!n.isValidParameter(i);
+};
+function Ct(n, t) {
+  if (_t(n, t, !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),
+    t.distanceFrom(n.firstPoint),
+    t.distanceFrom(n.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);
+  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)
+    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)
+      throw new Error("Bug in the offset algorithm");
+    yield r;
+  };
+  for (const h of a()) {
+    const l = s.offset.lastPoint, c = h.offset.firstPoint;
+    if (_(l, c)) {
+      o(s), s = h;
+      continue;
+    }
+    let f = [];
+    if (!(s.offset instanceof T) && !(h.offset instanceof T)) {
+      const { intersections: m, overlaps: x } = st(
+        s.offset,
+        h.offset,
+        B / 100
+      );
+      f = [
+        ...m,
+        ...x.flatMap((d) => [d.firstPoint, d.lastPoint])
+      ];
+    }
+    if (f.length > 0) {
+      let m = f[0];
+      if (f.length > 1) {
+        const w = s == null ? void 0 : s.original.lastPoint, M = f.map(
+          (lt) => Ft(lt, w)
+        );
+        m = f[M.indexOf(Math.min(...M))];
+      }
+      const x = s.offset.splitAt([
+        m
+      ])[0], d = h.offset.splitAt([m]).at(-1);
+      if (!d)
+        throw new Error("Bug in the splitting algo in offset");
+      o({
+        offset: x,
+        original: s.original
+      }), s = { offset: d, original: h.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]);
+  };
+  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);
+      });
+      x.length && (s(f, x), s(p + f + 1, x));
+    });
+  }), !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))
+    );
+    return Tt(H(i.contour, t), r);
+  });
+  return G(e);
+}
+function Wt(n, t) {
+  return Yt(E(n), t);
+}
+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(" ")}`;
   throw new Error("Unknown segment type");
 }
-function d(t) {
-  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(F).join(" ");
-  return `${n} ${e} Z`;
+function at(n) {
+  const t = `M ${n.firstPoint.join(" ")}`, e = n.segments.map(ot).join(" ");
+  return `${t} ${e} Z`;
 }
-function v(t) {
-  return `<path d="${t.allLoops.map(d).join(" ")}" />`;
+function ht(n) {
+  return `<path d="${n.allLoops.map(at).join(" ")}" />`;
 }
-function b(t) {
+function Rt(n) {
   return `<g>
-  ${t.figures.map(v).join(`
+  ${n.figures.map(ht).join(`
 `)}
 </g>`;
 }
-function j(t, n = 1) {
-  const e = t.xMin - n, r = t.yMin - n;
-  return `${e} ${r} ${t.width + 2 * n} ${t.height + 2 * n}`;
+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 w(t, n, e = 1) {
+function K(n, t, e = 1) {
   return `<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${j(n, e)}" fill="none" stroke="black" stroke-width="0.2%" vector-effect="non-scaling-stroke">
-    ${t}
+<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>`;
 }
-function p(t) {
-  if (t instanceof s)
-    return b(t);
-  if (t instanceof a)
-    return v(t);
-  if (t instanceof f)
-    return `<path d="${d(t)}" />`;
+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
+    )}" />`;
   throw new Error("Unknown shape type");
 }
-function U(t, n = 1) {
-  if (Array.isArray(t)) {
-    const r = t.map((o) => o.mirror()), i = r.map((o) => p(o)).join(`
-`), u = r.slice(1).reduce((o, S) => o.merge(S.boundingBox), r[0].boundingBox);
-    return w(i, u);
+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 = t.mirror();
-  return w(p(e), e.boundingBox, n);
+  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
+    );
+  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);
+};
+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);
+  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];
+}
+function Ht([n, t]) {
+  const e = Math.sqrt(n * n + t * t), i = Math.atan2(t, n) * Xt;
+  return [e, i];
 }
 export {
-  M as cut,
-  A as draw,
-  U as exportSVG,
-  E as fuse,
-  B as fuseAll,
-  G as intersect,
-  p as svgBody
+  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
 };
 //# sourceMappingURL=pantograph.js.map