pantograph2d 0.3.1 → 0.5.0

package/dist/pantograph.js

@@ -1,328 +1,169 @@
-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) {
+import { o as ct, D as b } from "./draw-cd61ec6b.js";
+import { d as _t } from "./draw-cd61ec6b.js";
+import { F as g, L as d, D as p, f as O, r as ut, z as lt, s as pt, a as Pt, c as gt, i as mt, l as wt, d as h, b as dt, p as ht, n as B, e as v, g as St, h as At, j as Mt, k as $t, m as w, A as S, o as H, q as A, t as Lt, u as Ft, v as vt, S as K } from "./Diagram-9915ed5e.js";
+import { w as tn } from "./Diagram-9915ed5e.js";
+function M(t) {
+  if (t instanceof g)
+    return [t];
+  if (t instanceof d)
+    return [new g(t)];
   if (t instanceof p)
-    return Ct(t, n);
-  if (t instanceof P)
-    return Tt(t, n);
-  throw new Error("Not implemented");
-}
-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))
-  );
+    return t.figures;
+  throw new Error("Unknown shape");
 }
-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(r) < 1e-10)
-    return null;
-  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 c;
-  try {
-    c = ct(o, u, 1e-9).at(-1);
-  } catch {
-    return null;
-  }
-  if (!c)
-    return null;
-  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",
-      t.repr,
-      n.repr
-    ), [t, n];
-  const { first: s, second: i } = r;
-  return [
-    s,
-    Q(s.lastPoint, i.firstPoint, s.tangentAtLastPoint),
-    i
-  ];
-}
-function G(t, n, e) {
-  const r = et(t, n, e);
-  if (!r)
-    return console.warn(
-      "Cannot chamfer between segments",
-      t.repr,
-      n.repr
-    ), [t, n];
-  const { first: s, second: i } = r;
-  return [s, new p(s.lastPoint, i.firstPoint), i];
-}
-function N(t) {
-  return new g([new T(new M(t))]);
-}
-class Et {
-  constructor(n = [0, 0]) {
-    this.pointer = n, this.firstPoint = n, this.pendingSegments = [], this._nextCorner = null;
-  }
-  movePointerTo(n) {
-    if (this.pendingSegments.length)
-      throw new Error(
-        "You can only move the pointer if there is no segment defined"
+function Q(t, n, e = 1e-9) {
+  let r = [];
+  const o = [], s = new Array(n.segments.length).fill(0).map(() => []);
+  n.segments.forEach((a, u) => {
+    t.segments.forEach((f) => {
+      const { intersections: l, overlaps: m } = O(
+        a,
+        f,
+        e
       );
-    return this.pointer = n, this.firstPoint = n, this;
-  }
-  saveSegment(n) {
-    if (A(n.firstPoint, n.lastPoint))
-      throw new Error(`Segment has no length, ${n.repr}`);
-    if (!this._nextCorner)
-      return this.pendingSegments.push(n), this;
-    const e = this.pendingSegments.pop();
-    if (!e)
-      throw new Error("bug in the custom corner algorithm");
-    const r = this._nextCorner.mode === "chamfer" ? G : B;
-    return this.pendingSegments.push(
-      ...r(e, n, this._nextCorner.radius)
-    ), this._nextCorner = null, this;
-  }
-  lineTo(n) {
-    const e = new p(this.pointer, n);
-    return this.pointer = n, this.saveSegment(e);
-  }
-  line(n, e) {
-    return this.lineTo([this.pointer[0] + n, this.pointer[1] + e]);
-  }
-  vLine(n) {
-    return this.line(0, n);
-  }
-  hLine(n) {
-    return this.line(n, 0);
-  }
-  vLineTo(n) {
-    return this.lineTo([this.pointer[0], n]);
-  }
-  hLineTo(n) {
-    return this.lineTo([n, this.pointer[1]]);
-  }
-  polarLineTo([n, e]) {
-    const r = e * V, s = _(n, r);
-    return this.lineTo(s);
-  }
-  polarLine(n, e) {
-    const r = e * V, [s, i] = _(n, r);
-    return this.line(s, i);
-  }
-  tangentLine(n) {
-    const e = this.pendingSegments.at(-1);
-    if (!e)
-      throw new Error("You need a previous segment to sketch a tangent line");
-    const [r, s] = e.tangentAtLastPoint;
-    return this.line(r * n, s * n);
-  }
-  threePointsArcTo(n, e) {
-    return this.saveSegment(ut(this.pointer, e, n)), this.pointer = n, this;
-  }
-  threePointsArc(n, e, r, s) {
-    const [i, o] = this.pointer;
-    return this.threePointsArcTo(
-      [i + n, o + e],
-      [i + r, o + s]
-    );
-  }
-  sagittaArcTo(n, e) {
-    if (!e)
-      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(n, e, r) {
-    return this.sagittaArcTo(
-      [n + this.pointer[0], e + this.pointer[1]],
-      r
-    );
-  }
-  vSagittaArc(n, e) {
-    return this.sagittaArc(0, n, e);
-  }
-  hSagittaArc(n, e) {
-    return this.sagittaArc(n, 0, e);
-  }
-  bulgeArcTo(n, e) {
-    if (!e)
-      return this.lineTo(n);
-    const r = S(this.pointer, n) / 2, s = -e * r;
-    return this.sagittaArcTo(n, s);
-  }
-  bulgeArc(n, e, r) {
-    return this.bulgeArcTo(
-      [n + this.pointer[0], e + this.pointer[1]],
-      r
-    );
-  }
-  vBulgeArc(n, e) {
-    return this.bulgeArc(0, n, e);
-  }
-  hBulgeArc(n, e) {
-    return this.bulgeArc(n, 0, e);
-  }
-  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(
-      Q(this.pointer, n, e.tangentAtLastPoint)
-    ), this.pointer = n, this;
-  }
-  tangentArc(n, e) {
-    const [r, s] = this.pointer;
-    return this.tangentArcTo([n + r, e + s]);
-  }
-  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: n }, this;
-  }
-  _customCornerLastWithFirst(n, e = "fillet") {
-    if (!n)
-      return;
-    const r = this.pendingSegments.pop(), s = this.pendingSegments.shift();
-    if (!r || !s)
-      throw new Error("Not enough curves to close and fillet");
-    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 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), N(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 = $(
-      e.lastPoint,
-      n.firstPoint
-    ), s = new lt().mirrorLine(
+      r.push(...l), s[u].push(...l), o.push(...m);
+      const P = m.flatMap((c) => [
+        c.firstPoint,
+        c.lastPoint
+      ]);
+      r.push(...P), s[u].push(...P);
+    });
+  }), r = ut(r, e);
+  const i = lt([n.segments, s]).flatMap(([a, u]) => u.length ? a.splitAt(u) : [a]);
+  return Array.from(
+    pt(
+      i,
       r,
-      n.firstPoint
-    ), i = this.pendingSegments.map(
-      (o) => o.transform(s).reverse()
-    );
-    return i.reverse(), N([
-      ...this.pendingSegments,
-      ...i
-    ]);
-  }
+      o
+    )
+  );
 }
-function Gt(t = [0, 0]) {
-  return new Et(t);
+function C(t, n, e = !1) {
+  return Q(n, t).filter((o) => {
+    const s = o.segments[0].midPoint;
+    return n.onStroke(s) ? !e : !n.contains(s);
+  });
 }
-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 G(t, n, e = !1) {
+  return Q(n, t).filter((o) => {
+    const s = o.segments[0].midPoint;
+    return n.onStroke(s) ? !e : n.contains(s);
+  });
+}
+function R(t, n, e = !1) {
+  const r = C(
+    t,
+    n.contour,
+    e
+  ), o = n.holes.flatMap(
+    (s) => G(t, s, e)
+  );
+  return [...r, ...o];
 }
-function Ft(t, n) {
-  return new g(
-    ht(E(t), E(n))
+function U(t, n, e = !1) {
+  let r = G(
+    t,
+    n.contour,
+    e
+  );
+  return n.holes.forEach((o) => {
+    r = r.flatMap(
+      (s) => C(s, o, e)
+    );
+  }), r;
+}
+function Et(t, n) {
+  return new p(
+    Pt(M(t), M(n))
   );
 }
-function U(t) {
+function E(t) {
   return t.reduce(
-    (n, e) => Ft(n, e),
-    new g()
+    (n, e) => Et(n, e),
+    new p()
   );
 }
-function Mt(t, n) {
-  return new g(
-    gt(E(t), E(n))
+function _(t, n) {
+  return new p(
+    gt(M(t), M(n))
   );
 }
 function Nt(t, n) {
-  return new g(
-    pt(E(t), E(n))
+  return new p(
+    mt(M(t), M(n))
   );
 }
-function Y(t) {
+function qt(t, n, e = !0) {
+  if (n instanceof d)
+    return C(t, n, e);
+  if (n instanceof g)
+    return R(t, n, e);
+  let r = [t];
+  return n.figures.forEach((o) => {
+    r = r.flatMap((s) => R(s, o, e));
+  }), r;
+}
+function Jt(t, n, e = !1) {
+  if (n instanceof d)
+    return G(t, n, e);
+  if (n instanceof g)
+    return U(t, n, e);
+  let r = [t];
+  return n.figures.forEach((o) => {
+    r = r.flatMap((s) => U(s, o, e));
+  }), r;
+}
+function z(t) {
   return t < 0 ? "before" : t > 1 ? "after" : "between";
 }
-const q = (t, n, e) => {
+const N = (t, n, e) => {
   if (e === "before")
     return t.distanceFrom(n.firstPoint);
   if (e === "after")
     return t.distanceFrom(n.lastPoint);
   throw new Error("Invalid position");
 };
-function bt(t, n) {
-  const e = mt(t, n);
+function yt(t, n) {
+  const e = wt(t, n);
   if (e === "parallel")
     return Math.min(
       t.distanceFrom(n.firstPoint),
       t.distanceFrom(n.lastPoint)
     );
-  const { intersectionParam1: r, intersectionParam2: s } = e, i = Y(r), o = Y(s);
-  if (i === "between" && o === "between")
+  const { intersectionParam1: r, intersectionParam2: o } = e, s = z(r), i = z(o);
+  if (s === "between" && i === "between")
     return 0;
-  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);
+  if (s === "between" && i !== "between")
+    return N(t, n, i);
+  if (i === "between" && s !== "between")
+    return N(n, t, s);
+  if (s === "before" && i === "before")
+    return h(t.firstPoint, n.firstPoint);
+  if (s === "after" && i === "after")
+    return h(t.lastPoint, n.lastPoint);
+  if (s === "before" && i === "after")
+    return h(t.firstPoint, n.lastPoint);
+  if (s === "after" && i === "before")
+    return h(t.lastPoint, n.firstPoint);
   throw new Error("Invalid position");
 }
-function z(t, n) {
-  if (Pt(t, n).length > 0)
+function q(t, n) {
+  if (dt(t, n).length > 0)
     return 0;
-  const e = wt(t, n.center);
+  const e = ht(t, n.center);
   if (t.isOnSegment(e)) {
-    const r = S(e, n.center);
+    const r = h(e, n.center);
     if (Math.abs(r - n.radius) < t.precision && n.isOnSegment(e))
       return 0;
     if (r - n.radius > t.precision) {
-      const s = tt(
-        $(e, n.center)
-      ), i = L(
+      const o = B(
+        v(e, n.center)
+      ), s = St(
         n.center,
-        C(s, n.radius)
+        At(o, n.radius)
       );
-      if (n.isOnSegment(i))
-        return S(i, e);
+      if (n.isOnSegment(s))
+        return h(s, e);
     }
   }
   return Math.min(
@@ -332,277 +173,345 @@ function z(t, n) {
     t.distanceFrom(n.lastPoint)
   );
 }
-const $t = (t, n) => {
+const It = (t, n) => {
   const e = t.angleToParam(n.firstAngle);
   if (t.isValidParameter(e))
     return !0;
   const r = t.angleToParam(n.lastAngle);
   return !!t.isValidParameter(r);
 };
-function yt(t, n) {
-  if (dt(t, n, !0).length > 0)
+function bt(t, n) {
+  if (Mt(t, n, !0).length > 0)
     return 0;
-  const e = S(t.center, n.center);
-  if (e < t.precision && $t(t, n))
+  const e = h(t.center, n.center);
+  if (e < t.precision && It(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(
+  const r = B(v(n.center, t.center)), o = e - Math.abs(t.radius - n.radius) < t.precision;
+  let s = $t(r);
+  o && n.radius > t.radius && (s += Math.PI);
+  const i = o ? s : s + Math.PI, a = t.angleToParam(s), u = n.angleToParam(i);
+  return t.isValidParameter(a) && n.isValidParameter(u) ? h(t.paramPoint(a), n.paramPoint(u)) : Math.min(
     t.distanceFrom(n.firstPoint),
     t.distanceFrom(n.lastPoint),
     n.distanceFrom(t.firstPoint),
     n.distanceFrom(t.lastPoint)
   );
 }
-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)
+function kt(t, n) {
+  if (t instanceof w && n instanceof w)
     return yt(t, n);
+  if (t instanceof w && n instanceof S)
+    return q(t, n);
+  if (t instanceof S && n instanceof w)
+    return q(n, t);
+  if (t instanceof S && n instanceof S)
+    return bt(t, n);
   throw new Error("Not implemented");
 }
-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 (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;
+const V = 1e-8;
+function k(t, n, e = !0) {
+  const r = t.map((f) => ({
+    offset: ct(f, n),
+    original: f
+  })), o = [];
+  let s = e ? null : r.at(-1), i = e ? r.at(-1) : null;
+  if (o.length === 1)
+    return o;
+  const a = (f) => {
+    s ? f.offset instanceof b ? A(f.offset.firstPoint, f.offset.lastPoint) || o.push(
+      new w(f.offset.firstPoint, f.offset.lastPoint)
+    ) : o.push(f.offset) : s = f;
   }, u = function* () {
-    for (const c of e.slice(0, -1))
-      yield c;
+    for (const f of r.slice(0, -1))
+      yield f;
     if (!s)
       throw new Error("Bug in the offset algorithm");
     yield s;
   };
-  for (const c of u()) {
-    const m = i.offset.lastPoint, a = c.offset.firstPoint;
-    if (A(m, a)) {
-      o(i), i = c;
+  for (const f of u()) {
+    if (!i) {
+      i = f;
       continue;
     }
-    let f = [];
-    if (!(i.offset instanceof F) && !(c.offset instanceof F)) {
-      const { intersections: w, overlaps: d } = nt(
+    const l = i.offset.lastPoint, m = f.offset.firstPoint;
+    if (A(l, m)) {
+      a(i), i = f;
+      continue;
+    }
+    let P = [];
+    if (!(i.offset instanceof b) && !(f.offset instanceof b)) {
+      const { intersections: $, overlaps: I } = O(
         i.offset,
-        c.offset,
-        I / 100
+        f.offset,
+        V / 100
       );
-      f = [
-        ...w,
-        ...d.flatMap((h) => [h.firstPoint, h.lastPoint])
+      P = [
+        ...$,
+        ...I.flatMap((L) => [L.firstPoint, L.lastPoint])
       ];
     }
-    if (f.length > 0) {
-      let w = f[0];
-      if (f.length > 1) {
-        const x = i == null ? void 0 : i.original.lastPoint, y = f.map(
-          (at) => vt(at, x)
+    if (P.length > 0) {
+      let $ = P[0];
+      if (P.length > 1) {
+        const ft = i == null ? void 0 : i.original.lastPoint, T = P.map(
+          (at) => Lt(at, ft)
         );
-        w = f[y.indexOf(Math.min(...y))];
+        $ = P[T.indexOf(Math.min(...T))];
       }
-      const d = i.offset.splitAt([
-        w
-      ])[0], h = c.offset.splitAt([w]).at(-1);
-      if (!h)
+      const I = i.offset.splitAt([
+        $
+      ])[0], L = f.offset.splitAt([$]).at(-1);
+      if (!L)
         throw new Error("Bug in the splitting algo in offset");
-      o({
-        offset: d,
+      a({
+        offset: I,
         original: i.original
-      }), i = { offset: h, original: c.original };
+      }), i = { offset: L, original: f.original };
       continue;
     }
-    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]);
+    const c = i.original.lastPoint, F = vt(
+      v(m, c),
+      v(l, c)
+    ) > 0, it = new S(l, m, c, F);
+    a(i), o.push(it), i = f;
+  }
+  return a(i), o;
+}
+function j(t) {
+  const n = /* @__PURE__ */ new Map(), e = (r, o) => {
+    const s = n.get(r) || [];
+    n.set(r, [...s, ...o]);
   };
-  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);
+  return t.forEach((r, o) => {
+    t.slice(o + 1).forEach((s, i) => {
+      const { intersections: a, overlaps: u } = O(r, s, V), f = [
+        ...a,
+        ...u.flatMap((l) => [l.firstPoint, l.lastPoint])
+      ].filter((l) => {
+        const m = A(l, r.firstPoint) || A(l, r.lastPoint), P = A(l, s.firstPoint) || A(l, s.lastPoint);
+        return !(m && P);
       });
-      d.length && (i(f, d), i(v + f + 1, d));
+      f.length && (e(o, f), e(i + o + 1, f));
     });
-  }), !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();
+  }), n;
+}
+function tt(t, n) {
+  return n.flatMap((e, r) => {
+    if (!t.has(r))
+      return e;
+    const o = t.get(r);
+    return o ? e.splitAt(o) : e;
+  });
 }
-function kt(t, n) {
+function nt(t, n, e) {
+  return t.filter((r) => !n.segments.some((s) => kt(s, r) < Math.abs(e) - V));
+}
+function y(t, n) {
+  const e = t.clockwise ? n : -n, r = k(t.segments, e);
+  if (r.length < 2)
+    return new p();
+  const o = j(r);
+  if (!o.size) {
+    const f = new d(r);
+    return new p([new g(f)]);
+  }
+  const s = tt(
+    o,
+    r
+  ), i = nt(s, t, n);
+  if (!i.length)
+    return new p();
+  const u = H(i).filter((f) => f.length > 1).filter((f) => A(f[0].firstPoint, f.at(-1).lastPoint)).map((f) => new d(f));
+  return u.length ? new p(u.map((f) => new g(f))) : new p();
+}
+function Dt(t, n, e = "round") {
+  const r = n / 2, o = k(t.segments, r, !1), s = k(t.segments, -r, !1).map(
+    (c) => c.reverse()
+  );
+  s.reverse();
+  const i = (c, F) => e === "round" ? Ft(
+    c.lastPoint,
+    F.firstPoint,
+    c.tangentAtLastPoint
+  ) : new w(c.lastPoint, F.firstPoint), a = [
+    ...o,
+    i(
+      o[o.length - 1],
+      s[0]
+    ),
+    ...s,
+    i(
+      s[s.length - 1],
+      o[0]
+    )
+  ], u = j(a);
+  if (!u.size) {
+    const c = new d(a);
+    return new p([new g(c)]);
+  }
+  const f = tt(
+    u,
+    a
+  ), l = nt(f, t, r);
+  if (!l.length)
+    return new p();
+  const P = H(l).filter((c) => c.length > 1).filter((c) => A(c[0].firstPoint, c.at(-1).lastPoint)).map((c) => new d(c));
+  return P.length ? new p(P.map((c) => new g(c))) : new p();
+}
+function Ot(t, n) {
   const e = t.map((r) => {
-    const s = U(
-      r.holes.map((i) => W(i, n))
+    const o = E(
+      r.holes.map((s) => y(s, n))
     );
-    return Mt(W(r.contour, n), s);
+    return _(y(r.contour, n), o);
   });
-  return U(e);
+  return E(e);
 }
-function Ut(t, n) {
-  return kt(E(t), n);
+function Ct(t, n) {
+  const e = Math.abs(n / 2), r = t.map(
+    (o) => E(
+      o.allLoops.map((s) => _(y(s, e), y(s, -e)))
+    )
+  );
+  return E(r);
 }
-function R(t) {
-  if (t instanceof p)
+function Wt(t, n) {
+  return Ot(M(t), n);
+}
+function Xt(t, n, { endCap: e = "round" } = {}) {
+  return t instanceof K ? Dt(t, n, e) : Ct(M(t), n);
+}
+function x(t) {
+  if (t instanceof w)
     return `L ${t.lastPoint.join(" ")}`;
-  if (t instanceof P)
+  if (t instanceof S)
     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 rt(t) {
-  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(R).join(" ");
+function et(t) {
+  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(x).join(" ");
   return `${n} ${e} Z`;
 }
-function it(t) {
-  return `<path d="${t.allLoops.map(rt).join(" ")}" />`;
+function rt(t) {
+  return `<path d="${t.allLoops.map(et).join(" ")}" />`;
 }
-function It(t) {
+function Gt(t) {
   return `<g>
-  ${t.figures.map(it).join(`
+  ${t.figures.map(rt).join(`
 `)}
 </g>`;
 }
-function Ot(t) {
-  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(R).join(" ");
+function Vt(t) {
+  const n = `M ${t.firstPoint.join(" ")}`, e = t.segments.map(x).join(" ");
   return `${n} ${e}`;
 }
-function Rt(t, n = 1) {
+function xt(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) {
+function J(t, n, e = 1, r) {
+  const o = xt(n, e), s = r ? `width="${n.width + 2 * e}${r}" height="${n.height + 2 * e}${r}"` : "";
   return `<?xml version="1.0" encoding="UTF-8" standalone="no"?>
-<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">
+<svg version="1.1" xmlns="http://www.w3.org/2000/svg" viewBox="${o}" fill="none" stroke="black" stroke-width="0.2%" vector-effect="non-scaling-stroke" ${s}>
     ${t}
 </svg>`;
 }
-function X(t) {
+function W(t) {
+  if (t instanceof p)
+    return Gt(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(
+    return rt(t);
+  if (t instanceof d)
+    return `<path d="${et(t)}" />`;
+  if (t instanceof K)
+    return `<path d="${Vt(t)}" />`;
+  if (t instanceof S || t instanceof w)
+    return `<path d="${`M ${t.firstPoint.join(" ")}`} ${x(
       t
     )}" />`;
   throw new Error("Unknown shape type");
 }
-const Z = (t) => "shape" in t ? t.shape : t, H = (t, n) => {
+const X = (t) => "shape" in t ? t.shape : t, Y = (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) {
+function Yt(t, {
+  margin: n = 1,
+  unit: e = null
+} = {}) {
   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 o = t.map((a) => X(a).mirror()), s = o.map((a, u) => Y(t[u], W(a))).join(`
+`), i = o.slice(1).reduce((a, u) => a.merge(u.boundingBox), o[0].boundingBox);
+    return J(s, i, n, e);
   }
-  const e = Z(t).mirror();
+  const r = X(t).mirror();
   return J(
-    H(t, X(e)),
-    e.boundingBox,
-    n
+    Y(t, W(r)),
+    r.boundingBox,
+    n,
+    e
   );
 }
 const st = (t) => {
   if (t.type === "LINE")
-    return new p(t.firstPoint, t.lastPoint);
+    return new w(t.firstPoint, t.lastPoint);
   if (t.type === "ARC")
-    return new P(
+    return new S(
       t.firstPoint,
       t.lastPoint,
       t.center,
       t.clockwise
     );
   throw new Error("Unknown segment type");
-}, O = (t) => {
+}, D = (t) => {
   const n = t.segments.map(st);
-  return new M(n);
+  return new d(n);
 }, ot = (t) => {
-  const n = O(t.contour), e = t.holes.map(O);
-  return new T(n, e);
-}, _t = (t) => {
+  const n = D(t.contour), e = t.holes.map(D);
+  return new g(n, e);
+}, Tt = (t) => {
   const n = t.figures.map(ot);
-  return new g(n);
+  return new p(n);
 };
-function qt(t) {
+function Zt(t) {
   if (t.type === "DIAGRAM")
-    return _t(t);
+    return Tt(t);
   if (t.type === "FIGURE")
     return ot(t);
   if (t.type === "LOOP")
-    return O(t);
+    return D(t);
   if (t.type === "LINE" || t.type === "ARC")
     return st(t);
   throw new Error("Unknown shape type");
 }
-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;
+const Z = Math.PI / 180, Rt = 180 / Math.PI;
+function Bt(t, n) {
+  const e = Math.cos(n * Z) * t, r = Math.sin(n * Z) * t;
   return [e, r];
 }
-function Wt([t, n]) {
-  const e = Math.sqrt(t * t + n * n), r = Math.atan2(n, t) * Vt;
+function Ht([t, n]) {
+  const e = Math.sqrt(t * t + n * n), r = Math.atan2(n, t) * Rt;
   return [e, r];
 }
 export {
-  K as DEG2RAD,
-  Vt as RAD2DEG,
-  Wt as cartesianToPolar,
-  Mt as cut,
-  Gt as draw,
-  Zt as exportJSON,
+  Z as DEG2RAD,
+  Rt as RAD2DEG,
+  Ht as cartesianToPolar,
+  Jt as confineStrand,
+  _ as cut,
+  _t as draw,
+  qt as eraseStrand,
+  tn as exportJSON,
   Yt as exportSVG,
-  Ft as fuse,
-  U as fuseAll,
-  qt as importJSON,
+  Et as fuse,
+  E as fuseAll,
+  Zt as importJSON,
   Nt as intersect,
-  Ut as offset,
-  zt as polarToCartesian,
-  X as svgBody
+  Wt as offset,
+  Xt as outlineStroke,
+  Bt as polarToCartesian,
+  W as svgBody
 };
 //# sourceMappingURL=pantograph.js.map